Aug-17-2018, 03:01 AM
(This post was last modified: Aug-17-2018, 03:01 AM by shihomiyano.)
There are several ways to write the number 1/2 as a sum of inverse squares using distinct integers.
In fact, only using integers between 2 and 45 inclusive, there are exactly three ways to do it: {2,3,4,6,7,9,10,20,28,35,36,45} and {2,3,4,6,7,9,12,15,28,30,35,36,45} and {2,3,4,5,7,12,15,20,28,35}
How many ways are there to write the number 1/2 as a sum of inverse squares using distinct integers between 2 and 80 inclusive?
That's my homework, guys.
Basically, algorithm is quite easy to find out, but the problem is python seems to be overloaded. I tried multiprocessing method but still get stuck. Could you guys help me with this?
In fact, only using integers between 2 and 45 inclusive, there are exactly three ways to do it: {2,3,4,6,7,9,10,20,28,35,36,45} and {2,3,4,6,7,9,12,15,28,30,35,36,45} and {2,3,4,5,7,12,15,20,28,35}
How many ways are there to write the number 1/2 as a sum of inverse squares using distinct integers between 2 and 80 inclusive?
That's my homework, guys.
Basically, algorithm is quite easy to find out, but the problem is python seems to be overloaded. I tried multiprocessing method but still get stuck. Could you guys help me with this?