#Please someone disprove that such numbers exists for any n digits, n positive integer
26 messages · Page 1 of 1 (latest)
- Ask your question and show the work you've done so far. If you've posted a screenshot of a question, specify which part you need help with.
- Wait patiently for a helper to come along.
- Once someone helps you, say thank you and close the thread with:
+close - Feel free to nominate the person for helper of the week in #helper-nominations
- Do not ping the mods, unless someone is breaking the rules.
- If you're happy with the help you got here, and the server overall, you can contribute financially as well:
Because I think proving this fact is kinda too hard
and also I don't think that it's true in the first place
Please someone disprove that such numbers exists for any n digits, n positive integer
Is there any such 2-digit number?
Idk
Let 10a + b be such a 2-digit number with 1 <= a <= 9 and 0 <= b <= 9, hence a^2 + b^2 = 10a + b.
Suppose b in {0, 1, 5, 6}. Then b - b^2 is a multiple of 10, and thus so is a^2 = b - b^2 + 10a. Contradiction.
Suppose b in {2, 4, 7, 9}. Then b - b^2 has a remainder of 8 when divided by 10, and thus so does a^2. Contradiction.
Suppose b in {3, 8}. Then b - b^2 has a remainder of 4 when divided by 10, and thus so does a^2.
2^2 + 3^2 = 13, not 23.
8^2 + 3^2 = 73, not 83.
2^2 + 8^2 = 68, not 28.
8^2 + 8^2 = 128, not 88.
Hence a contradiction arises. There is no such 2-digit number.
@undone raven
@real oasis That's a nice proof. Although it's correct I think you should have also say that 13 is not 23 NOR 32 since the order of the sum 2^2 + 3^2 = 3^2 + 2^2. The same thing for
73 != 83 nor 38
68 != 28 nor 82
128 != 88 nor 88 (redundant here)
Other than this, thanks for your help
Although, do you think is there another way to prove in thcase of 3 digits other than your brute force way?
I think I rejected unit digit 2 elsewhere, didn't I?
Suppose b in {2, 4, 7, 9}. Then b - b^2 has a remainder of 8 when divided by 10, and thus so does a^2. Contradiction.
Exactly
So I don't have to consider 32 anymore
aaaaaaaaaaa
you're right...
But how about in the case of 3 digits?
Is there another way of proving that there isn't any without the brute force way
I thought the job was done, that we only had to disprove that for any natural n, there is some such number
I am not really intrigued enough to continue brute-forcing for obvious reasons
Let me sleep on it (albeit not spend extra effort) and give you an update if any idea pops up
ok