n = d 6 2 + d 7 2 − 1 Find sum of all positive integers n that satisfy equation above, where 1 = d 1 < d 2 < d 3 < ⋯ < d k = n are divisors 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.
What does the di and dj over the corresponding sign imply? After the di|(dj^2 - 1) step?
Log in to reply
For a positive integer n , two integers a and b are said to be congruent modulo n , written: a ≡ b ( mod n ) or equivalently a ≡ n b
Problem Loading...
Note Loading...
Set Loading...
From the equality n = d 6 2 + d 7 2 − 1 we see that d 6 and d 7 are relatively prime and d 7 ∣ d 6 2 − 1 = ( d 6 − 1 ) ( d 6 + 1 ) , d 6 ∣ d 7 2 − 1 = ( d 7 − 1 ) ( d 7 + 1 ) . Suppose that d 6 = a b , d 7 = c d with 1 < a < b , 1 < c < d . Then n has 7 divisors smaller than d 7 , namely 1 , a , b , c , d , a b , a c , which is impossible. Hence, one of the two numbers d 6 and d 7 is either a prime p or the square p 2 of a prime p = 2 .
Let it be d i , { i , j } = { 6 , 7 } ; then d i ∣ ( d j − 1 ) ( d j + 1 ) implies that d j ≡ d i ± 1 , and consequently ( d i 2 − 1 ) / d j ≡ d i ± 1 as well. But either d j or ( d i 2 − 1 ) / d j is less than d i , and therefore equals d i − 1 or equals 1 . The only nontrivial possibilities are ( d i 2 − 1 ) / d j = 1 and d j = d i ± 1 . In the first case we get d i < d j ; hence d 7 = d 6 2 − 1 = ( d 6 − 1 ) ( d 6 + 1 ) ; hence d 6 + 1 is a divisor of n that is between d 6 and d 7 . This is impossible. We thus conclude that d 7 = d 6 + 1 . Setting d 6 = x , d 7 = x + 1 we obtain that n = x 2 + ( x + 1 ) 2 − 1 = 2 x ( x + 1 ) is even.
( i ) Assume that one of x , x + 1 is a prime p . The other one has at most 6 divisors and hence must be of the form 2 3 , 2 4 , 2 5 , 2 q , 2 q 2 , 4 q , where q is an odd prime. The numbers 2 3 and 2 4 are easily eliminated, while 2 5 yields the solution x = 3 1 , x + 1 = 3 2 , n = 1 9 8 4 . Also, 2 q is eliminated because n = 4 p q then has only 4 divisors less than x ; 2 q 2 is eliminated because n = 4 p q 2 has at least 6 divisors less than x ; 4 q is also eliminated because n = 8 p q has 6 divisors less than x .
( i i ) Assume that one of x , x + 1 is p 2 . The other one has at most 5 divisors ( p excluded), and hence is of the form 2 3 , 2 4 , 2 q , where q is an odd prime. The number 2 3 yields the solution x = 8 , x + 1 = 9 , n = 1 4 4 , while 2 4 is easily eliminated. Also, the number 2 q is eliminated because n = 4 p 2 q has 6 divisors less than x .
Thus there are two solutions in total: 1 4 4 and 1 9 8 4 .