Let n be a natural number.
Suppose d 1 , d 2 , d 3 , … are the divisors of n such that
1 = d 1 < d 2 < d 3 < …
Suppose n = d 1 2 + d 2 2 + d 3 2 + d 4 2
Find the value of n .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
one cannot assume that d_(4) is equal to 2p. The answer takes invalid assumption
The problem previously stated 1 = d 1 < d 2 < d 4 . I have since corrected it to 1 = d 1 < d 2 < d 3 .
This doesn't cover the cases where p < d 4 < 2 p .
Problem Loading...
Note Loading...
Set Loading...
First show that n is even,but not divisible by 4
Then its clear d 2 = 2 and d 3 is the least possible prime divisor of n .Let d 3 = p
Then d 4 = 2 p
Hence, n = 5 ( p 2 + 1 ) .
The only possibility is p = 5 and so n = 1 2 + 2 2 + 5 2 + 1 0 2 = 1 3 0