The square-sum problem v2.0

76 Views Asked by At

My question concerns the problem of 'the square-sum problem' which is described in details in this video: https://youtu.be/G1m7goLCJDY On this video is told that a series of sequential numbers from 1 to 15 we can rearrange in such a way that the sum of two neighboring ones will be an perfect square. Here is a solution {9, 7, 2, 14, 11, 5, 4, 12, 13, 3, 6, 10, 15, 1, 8}. That is not the only number with this property. The question goes like 'does there exist the biggest N with these properties. If there is not, how to prove it?'. P.s. excuse for my not-inteligence on this comment, i'm not a student, i'm just a scholar who spent his time dealing with math and thus i don't have a perfect english and i may translate some verbs in not appropriate way. I need your help,hope you understand the statement correctly, thanks for your attention!!!!