Let a , b , c be positive integers such that a 2 = 2 b 3 = 3 c 5 . What is the minimum possible number of factors of a b c ( including 1 and a b c ) ?
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.
Just nitpicking the presentation.
More accurately, you can classify that ( a , b , c ) = ( 2 5 3 3 n 1 5 , 2 3 3 2 n 1 0 , 2 2 3 1 n 6 ) , which explains why the minimum number of factors occur when n = 1 , as opposed to arguing that "these must be the only prime factors". For example, n = 2 satisfies "only prime factors", but not "minimal number of factors".
It can also be thought that when a 5th power is multiplied by 3 it gives a 3 rd power and when it is multiplied by 2 it gives a square.
Problem Loading...
Note Loading...
Set Loading...
It is clear that each of a , b and c must have prime factors including 2 and 3 and, since we are seeking a minimal number of factors of a b c , these must be the only prime factors.
Let a = 2 p 3 q , b = 2 r 3 s and c = 2 v 3 w where p , q , r , s , v and w are positive integers or zero. Since a 2 = 2 b 3 = 3 c 5 we have 2 2 p 3 2 q = 2 3 r + 1 3 3 s = 2 5 v 3 5 w + 1 .
Considering indices of 2 we have 2 p = 3 r + 1 = 5 v . The smallest values of ( p , r , v ) which satisfy this equation are ( 5 , 3 , 2 ) .
Considering indices of 3 we have 2 q = 3 s = 5 w + 1 . The smallest values of ( q , s , w ) which satisfy this equation are ( 3 , 2 , 1 ) .
Using these values, a b c = ( 2 5 3 3 ) × ( 2 3 3 2 ) × ( 2 2 3 1 ) = 2 1 0 3 6 .
Any factors of a b c will be of the form 2 y 3 z where y ∈ { 0 , 1 , … , 1 0 } and z ∈ { 0 , 1 , … , 6 } . There are 11 possibilities for y and 7 possibilities for z . Hence a b c has 1 1 × 7 = 7 7 factors.