Let be the greatest integer such that for every positive integer ,
Find the number of (positive) divisors of .
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.
Notice that if p is a prime, and p − 1 ∣ 1 7 2 8 , then n 1 7 2 8 ≡ 1 ( m o d p ) , implying n 1 7 2 9 ≡ n ( m o d p ) , or that n 1 7 2 9 − n ≡ 0 ( m o d p ) .
Note, however, that even if p − 1 ∣ 1 7 2 8 , then if p ∣ n but p 2 ∤ n , then n 1 7 2 9 − n is not divisible by p 2 .
This implies d is squarefree.
Thus, the primes which divide d are those for which p − 1 ∣ 1 7 2 8 . UtiLiZiNG wOlFraM aLpHA, we can see that the primes are 2 , 3 , 5 , 7 , 1 3 , 1 7 , 1 9 , 3 7 , 7 3 , 9 7 , 1 0 9 . 1 9 3 , 4 3 3 , 5 7 7 . Notice that d is the product of these, thus since d has 1 4 primes in its factorization, d has 2 1 4 = 1 6 3 8 4 positive divisors.