|
||
|
Title: 51^51 Post by NickH on Feb 8th, 2003, 2:43pm Can 5151 be represented as the sum of a square and a fifth power? (In integers.) |
||
|
Title: Re: 51^51 Post by SWF on Feb 21st, 2003, 5:19pm This problem has been sitting around for a while with no comments at all. As the author of another fine problem which has received no comment after 2 months, I decided to take a shot at this one before it also falls into the abyss of page 2. Working in modulo 11 arthmetic shows that this can not be expressed as the sum of a square and a fifth power. Straight calculation shows that 5110=1 mod 11. So 5150=(5010)5 is also 1 mod 11, and 5151=7 mod 11. Trying the eleven possiblities shows that every square is either 0, 1, 3, 4, 5, or 9 mod 11. In the same way, it is found that every fifth power is either 0, 1, or 10 mod 11. Thus it is found that there no way to add a square to a fifth power to get a number equal to 7 mod 11, so 5151 cannot be expressed in this way. |
||
|
Title: Re: 51^51 Post by Icarus on Feb 22nd, 2003, 12:02pm I've been playing with this for some time without making any progress. Out of curiousity, SWF, how did you come up with this approach? Concerning your orphaned puzzle - sorry, but that sort of thing doesn't have much appeal to me - but for those with different tastes, here is a link (http://www.ocf.berkeley.edu/~wwu/cgi-bin/yabb/YaBB.cgi?board=riddles_hard;action=display;num=1040354716). |
||
|
Title: Re: 51^51 Post by SWF on Feb 23rd, 2003, 1:05pm I guessed that it was not possible, probably because if it was, it looked to be difficult. Without doing an exhaustive search, looking at modular arithmetic seemed like the best way to show it impossible. I figured a proof of impossibility would be much as written above, except I didn't know what number to use as the modulus. I just tried looking at possibilities for squares and fifth powers with different moduli until finding that modulo 11 had some impossible to reach values for the sum. Also, if it was possible, modular arithmetic would have given clues as to characteristics of the answer, which would have helped reduce the cases to check if it ever came to an exhaustive search. As for my orphaned problem, I consider it being neglected as tribute to its difficulty. Although one might expect somebody from this forum would be able to solve a 13 piece puzzle. |
||
|
Title: Re: 51^51 Post by Icarus on Feb 24th, 2003, 4:12pm In hindsight, 11 would be the best modulus to start looking with, since Fermat's little theorem provides n10=1 mod 11, if (n,11)=1, and both 2 and 5 divide 10, this limits the number of possible squares and 5th powers modulo 11. I'm guessing that you could also use mod 31 or mod 41. It's amazing how easy it is to see this if you already know the answer! |
||
|
Title: Re: 51^51 Post by David Ryan on Mar 7th, 2003, 6:41am Would anyone be willing to expain to me what modulus is? I have never heard of it, and don't foresee it surfacing reletively soon in math class. If it is not practical here, that is fine, please say so. |
||
|
Title: Re: 51^51 Post by wowbagger on Mar 7th, 2003, 8:20am David, when using "modular arithmetic", you basically throw away integral multiples of some number m, the modulus. Example: 7 = 1 (mod 6) Since 7 is greater than 6, you subtract 6 (once in this case) and end up with 1. For more info, let me refer you to a good web resource on mathematical terms: World of Mathematics (http://mathworld.wolfram.com/) with definitions of modulus (http://mathworld.wolfram.com/Modulus.html) and the related concept of congruence (http://mathworld.wolfram.com/Congruence.html). SWF, please excuse my not posting to your puzzle. I cut out the pieces and really tried to solve it for a while (back in December and January), but didn't get very far. So I thought it's not worth a post. Your creation did not go unnoticed, I can assure you. :) |
||
|
Powered by YaBB 1 Gold - SP 1.4! Forum software copyright © 2000-2004 Yet another Bulletin Board |