For a positive integer x , let f ( x ) be the function which returns the number of distinct positive factors of x . If p is a prime number, what is the minimum possible value of f ( 7 5 p 2 ) ?
This problem is posed by Michael T.
Details and assumptions
You may read up on Divisors of an Integer .
The distinct positive factors of x need not be prime. For example, f ( 1 2 ) = 6 , since 12 has distinct positive factors of 1 , 2 , 3 , 4 , 6 , 1 2 .
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.
Since p is prime, the prime factorization of 7 5 p 2 is 3 ⋅ 5 2 ⋅ p 2 .
If p = 3 , then we have f ( 3 3 ⋅ 5 2 ) = 4 ⋅ 3 = 1 2 .
If p = 5 , then we have f ( 3 ⋅ 5 4 ) = 2 ⋅ 5 = 1 0 .
For all other primes, we have f ( 3 ⋅ 5 2 ⋅ p 2 ) = 2 ⋅ 3 ⋅ 3 = 1 8 .
Therefore, the minimum value is 1 0 .
With p=5, x = 5 4 × 3 So the number of distinct prime factors of x reaches min. At this p, number of distinct factors of x is: 1 0
Overrated problem!!
Log in to reply
I dont like this stupid kind of comments. If you feel so, keep it to yourself -_-
Problem Loading...
Note Loading...
Set Loading...
7 5 p 2 = 3 × 5 2 × p 2 If p = 3 or 5, number of factor= ( 1 + 1 ) ( 2 + 1 ) ( 2 + 1 ) = 1 8
If p = 3 , number of factor= ( 3 + 1 ) ( 2 + 1 ) = 1 2
If p = 5 , number of factor= ( 1 + 1 ) ( 4 + 1 ) = 1 0