Recent content by epte

Ok, how about this: Assume a = (11d + n) and b = (11e + 11-n). Knowing the difference of a and b must be even, then: (11d + n) - (11e + 11 - n) = 2k 11(d - e - 1) = 2(k - n) d - e must always be odd. Instead of using e, if we choose f such that we can use -n instead of 11-n, then we...

Hm.. but I do agree with you -- that's a bit of a weak point in the proof. Am I handling all the cases when I center around the same multiple of 11? Or are there some legitimate cases I'm not considering, such that I'm only proving that there is merely no solution within a subset of possible...

Correct. I think that was in my reasoning process, but I reported it a bit awkwardly. To put it in other words, since a^3 + b^3 must be even, the difference between a and b must be even. a and b therefore cannot be (11x + 1) and (11x + 10) respectively, since their difference will always be odd.

I ran into this problem yesterday in the introduction to The Riemann Hypothesis: The Greatest Unsolved Problem in Mathematics by Karl Sabbagh. I think I just solved it, but if I've made a mistake somewhere, I'd appreciate someone pointing it out. The version of the problem I have is: Find...