Let be all the positive factors of . Find the value 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.
We first calculate d ( 1 1 ! ) , the number of positive divisors of 1 1 ! , by finding its prime decomposition. 1 1 ! will only have prime factors 2 , 3 , 5 , 7 and 1 1 ; if we write 1 1 ! = 2 a ⋅ 3 b ⋅ 5 c ⋅ 7 d ⋅ 1 1 e , we can find the exponents of each prime factor as follows:
a b c d e = ⌊ 2 1 1 ! ⌋ + ⌊ 2 2 1 1 ! ⌋ + ⌊ 2 3 1 1 ! ⌋ = 8 = ⌊ 3 1 1 ! ⌋ + ⌊ 3 2 1 1 ! ⌋ = 4 = ⌊ 5 1 1 ! ⌋ = 2 = ⌊ 7 1 1 ! ⌋ = 1 = ⌊ 1 1 1 1 ! ⌋ = 1
This gives 1 1 ! = 2 8 ⋅ 3 4 ⋅ 5 2 ⋅ 7 ⋅ 1 1 , and then the number of positive divisors would be d ( 1 1 ! ) = ( 8 + 1 ) ( 4 + 1 ) ( 2 + 1 ) ( 1 + 1 ) ( 1 + 1 ) = 5 4 0 .
We now arrange the factors, not in increasing size, but by factor pairs; i.e. d 1 = 1 , d 2 = 1 1 ! , d 3 = 2 , d 4 = 2 1 1 ! , … Then d 2 k − 1 and d 2 k will form factor pairs, and we will have 270 such factor pairs.
Consider any two terms in the sum formed from such a factor pair.
d 2 k − 1 + 1 1 ! 1 + d 2 k + 1 1 ! 1 = ( d 2 k − 1 + 1 1 ! ) ( d 2 k + 1 1 ! ) d 2 k + 1 1 ! + d 2 k − 1 + 1 1 ! = d 2 k − 1 d 2 k + 1 1 ! ( d 2 k − 1 + d 2 k ) + 1 1 ! 2 1 1 ! + d 2 k − 1 + d 2 k = 2 ( 1 1 ! ) + 1 1 ! ( d 2 k − 1 + d 2 k ) 2 1 1 ! + d 2 k − 1 + d 2 k = 1 1 ! ( 2 1 1 ! + d 2 k − 1 + d 2 k ) 2 1 1 ! + d 2 k − 1 + d 2 k = 1 1 ! 1 [ But d 2 k − 1 d 2 k = 1 1 ! ]
Thus every such pair of terms adds up to 1 1 ! 1 , and there are 2 7 0 such pairs in our sum. Therefore
∑ k = 0 n d k + 1 1 ! 1 = 1 1 ! 2 7 0 ≈ 0 . 0 4 2 7 3 5 2 1 6