Puzzle Time - polynomials
- 
This puzzle is me being a dick. The smallest number in the smallest solution has more than 80 digits. Which is pretty amazing if you think about it. @jon-nyc said in Puzzle Time - polynomials: This puzzle is me being a dick. The smallest number in the smallest solution has more than 80 digits. Which is pretty amazing if you think about it. But is there a way to come up with the solution analytically? I know that Diophantine equations are undecidable in general, and analytical solutions only exist for a few special cases. 
- 
Yes. In fact it has to involve some clever analysis before doing automated searches. Naive messing around on a computer is not going to find an 80-digit number. https://drive.google.com/file/d/1NXYxl3tH7_mZMTBYL7pCeP8RY2bquVyF/view?usp=drivesdk The search involved elliptic curves. I just love how basic and innocent the problem seems. It looks like the solution should involve some one- or two-digit numbers. 



