Let N = 1 9 × 2 8 × 3 7 × 4 6 × 5 5 × 6 4 × 7 3 × 8 2 × 9 1 . How many perfect squares divide 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.
We could just make 2 3 0 × 3 1 3 × 5 5 × 7 3 = 4 1 5 × 9 6 × 2 5 2 × 4 9 1 × 3 × 5 × 7
The number of perfect number factors = 1 6 × 7 × 3 × 2 = 6 7 2
Btw it's still the same though.
i think n= 2^30 * 3^13 * 5^5 * 7^3 & i guess that doesnt make any difference
Good problem @Isaac but I remember seeing the same problem with a different title on this site :)
Log in to reply
Sorry, I didn't know the problem was already posted :(
Log in to reply
It's ok...the problem was actually slightly different. Titled-perfect square divisors. You actully had to find the P.F of the factorials, but over here you've given them already. :D
N=2^30 * 3^13 * 5^5 * 7^3 , :We know that for a number to be a perfect square, its factor must have the even number of powers. 2^(0,2,4,6,8,10,12,14,16,18,20,22,24,26,28,30) * 3^(0,2,4,6,8,10,12) * 5^(0,2,4) * 7^(0,2),Hence, the total number of factors which are perfect square are 16 7 3*2=672
Problem Loading...
Note Loading...
Set Loading...
Rewriting N as a product of primes, we get that N = 2 3 0 ∗ 3 1 3 ∗ 5 5 ∗ 7 3
Now since we want squares, we can tweak the divisor counting function such that it counts only square divisors.
First we note that the primes respectively have 1 6 , 7 , 3 , and 2 even powers.
So there are 1 6 ∗ 7 ∗ 3 ∗ 2 square factors of N .
1 6 ∗ 7 ∗ 3 ∗ 2 = 6 7 2