For large enough 𝑁, there exists some permutation of {1,2,...,𝑁} such that for every pair of adjacent number, the sum is always square.
-
Notifications
You must be signed in to change notification settings - Fork 0
The Square-Sum Problem
License
faq3pa/square-sum-problem
About
The Square-Sum Problem
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published