n = ( 1 9 3 − 3 × 1 8 × 1 9 − 1 ) 2
Find the number of factors 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.
Note that if k is a positive integer, then ( k − 1 ) 3 = k 3 − 3 k 2 + 3 k − 1 = k 3 − 3 k ( k − 1 ) − 1 = k 3 − 3 × k × ( k − 1 ) − 1
From that 1 9 3 − 3 × 1 8 × 1 9 − 1 = ( 1 9 − 1 ) 3 = 1 8 3
1 8 = 2 1 × 3 2 . Ergo ( 1 8 3 ) 2 = ( 2 1 × 3 × 3 2 × 3 ) 2 = ( 2 3 × 3 6 ) 2 = 2 3 × 2 × 3 6 × 2 = 2 6 × 3 1 2 .
Therefore n has ( 6 + 1 ) × ( 1 2 + 1 ) = 7 × 1 3 = 9 1 divisors.
Yes , absolutely. Thank you for writing a solution ^^.
Problem Loading...
Note Loading...
Set Loading...
n = ( 1 9 3 − 3 × 1 8 × 1 9 − 1 ) 2 = ( 1 9 3 − 3 ( 1 9 − 1 ) ( 1 9 ) − 1 ) 2 = ( 1 9 3 − 3 ( 1 9 2 ) + 3 ( 1 9 ) − 1 ) 2 = ( 1 9 − 1 ) 3 × 2 = 1 8 6 = ( 2 × 3 2 ) 6 = 2 6 × 3 1 2 Note that ( a − 1 ) 3 = a 3 − 3 a 2 + 3 a − 1
Therefore the number of factors of n , σ 0 ( n ) = ( 6 + 1 ) ( 1 2 + 1 ) = 9 1