An interesting problem...?

Stephen is making "the Stephen fractions". He chooses a set of two whole numbers (could be identical) greater than 1. He multiplies them, squares the result, and finds the reciprocal of the answer. (e.g. (3,4)=>1(34)21144) Given that the order of the numbers do not matter ((3,4) and (4,3) are the same), what is the sum of all Stephen fractions if there is a sum? Note that 1(34)2 and 1(26)2 are counted as two different fractions.

I think I have found a solution, and I would like to know how you would solve this problem!

1 Answer
Aug 8, 2018

The sum of all Stephen fractions is S=1+π436π23

Explanation:

Evaluating the problem, we know that Stephen fractions sum
S=x=2y=21(xy)2

S=x=2y=21x2y2

I replace in each sum k=2 by k=1, substracting to this sum the first missing element, knowing that z=11z2=π26,

S=x=21x2y=21y2

=x=1(1x21)y=21y2

=x=11x2y=21y2y=21y2

=π26(y=11y21)(y=11y21)

=π26(π261)(π261)

=π436π26π26+1

S=1+π436π23

\0/ Here's our answer !