Balance the Factors

Let a , b , c a,b,c be positive integers such that a 2 = 2 b 3 = 3 c 5 . a^2 = 2b^3 = 3c^5. What is the minimum possible number of factors of a b c abc ( ( including 1 1 and a b c ) ? abc)?


The answer is 77.

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.

1 solution

Alistair Bill
Dec 16, 2017

It is clear that each of a a , b b and c c must have prime factors including 2 and 3 and, since we are seeking a minimal number of factors of a b c abc , these must be the only prime factors.

Let a = 2 p 3 q a = 2^p 3^q , b = 2 r 3 s b = 2^r 3^s and c = 2 v 3 w c = 2^v 3^w where p p , q q , r r , s s , v v and w w are positive integers or zero. Since a 2 = 2 b 3 = 3 c 5 a^2 = 2b^3 = 3c^5 we have 2 2 p 3 2 q = 2 3 r + 1 3 3 s = 2 5 v 3 5 w + 1 2^{2p} 3^{2q} = 2^{3r+1} 3^{3s} = 2^{5v} 3^{5w+1} .

Considering indices of 2 we have 2 p = 3 r + 1 = 5 v 2p = 3r+1 = 5v . The smallest values of ( p , r , v ) (p, r, v) which satisfy this equation are ( 5 , 3 , 2 ) (5, 3, 2) .

Considering indices of 3 we have 2 q = 3 s = 5 w + 1 2q = 3s = 5w+1 . The smallest values of ( q , s , w ) (q, s, w) which satisfy this equation are ( 3 , 2 , 1 ) (3, 2, 1) .

Using these values, a b c = ( 2 5 3 3 ) × ( 2 3 3 2 ) × ( 2 2 3 1 ) = 2 10 3 6 abc = (2^5 3^3) \times (2^3 3^2) \times (2^2 3^1) = 2^{10} 3^6 .

Any factors of a b c abc will be of the form 2 y 3 z 2^y 3^z where y { 0 , 1 , , 10 } y \in \{0, 1, \dots , 10\} and z { 0 , 1 , , 6 } z \in \{0, 1, \dots , 6\} . There are 11 possibilities for y y and 7 possibilities for z z . Hence a b c abc has 11 × 7 = 77 11 \times 7 = 77 factors.

Just nitpicking the presentation.

More accurately, you can classify that ( a , b , c ) = ( 2 5 3 3 n 15 , 2 3 3 2 n 10 , 2 2 3 1 n 6 ) (a, b, c) = ( 2^5 3^3 n^{15}, 2^3 3^2 n^{10}, 2^2 3^1 n^{6} ) , which explains why the minimum number of factors occur when n = 1 n = 1 , as opposed to arguing that "these must be the only prime factors". For example, n = 2 n = 2 satisfies "only prime factors", but not "minimal number of factors".

Calvin Lin Staff - 3 years, 5 months ago

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.

Abhinav Shripad - 3 years, 5 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...