150 Friends Problem - 2

Find the number of ordered pairs of positive integers ( a , b , c , d , e , f ) (a,b,c,d,e,f) that satisfy the condition

a b c d e f = 150150 \Large abcdef = 150150

Bonus : Generalize this for a b c d e f = n abcdef = n , where n N n \in \mathbb{N} .


The answer is 163296.

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.

3 solutions

150150 = 2 × 3 × 5 2 × 7 × 11 × 13 150150=2\times3\times5^2\times7\times11\times13 Excepting 5 2 5^2 ,the remaining 5 elements are distinguishable and the number of ways to arrange them into 6 different variables is 6 5 6^5 . In these 6 5 6^5 arrangements, 2 2 indistinguishable 5 5 are to be arranged into 6 different variables. By Stars and Bars there are ( 6 + 2 1 2 ) = 21 \binom{6+2-1}{2} = 21 ways to arrange them 6 5 × 21 = 163296 6^5 \times 21 = 163296

Thanks for the answer Mr Bhagyanath. But doesn’t it look a bit odd that a number (150150) can have more(than itself) ways to achieve itself by multiplication of its factors (163296)?

Akash Tyagi - 2 years, 1 month ago
Kartik Sharma
Nov 15, 2015

My solution is same as Vishnu but just more general.

Let this be our problem -

a 1 a 2 a 3 a m = n = p 1 α 1 p 2 α 2 p n α n \displaystyle a_1 a_2 a_3 \cdots a_m = n = p_1^{\alpha_1} p_2^{\alpha_2} \cdots p_n^{\alpha_n}

Now, one can see that a i = p 1 x i , 1 p 2 x i , 2 p n x i , n \displaystyle a_i = p_1^{x_{i,1}} p_2^{x_{i,2}} \cdots p_n^{x_{i,n}}

such that i a i = p 1 α 1 p 2 α 2 p n α n \displaystyle \prod_i{a_i} = p_1^{\alpha_1} p_2^{\alpha_2} \cdots p_n^{\alpha_n} which gives us that

x 1 , j + x 2 , j + x 3 , j + + x m , j = α j , x k , j 0 \displaystyle x_{1,j} + x_{2,j} + x_{3,j} + \cdots + x_{m,j} = \alpha_j , x_{k,j}\geq 0

giving us the number of solutions for α j \displaystyle \alpha_j by generating functions = ( m + α j 1 m 1 ) \displaystyle = \dbinom{m + \alpha_j -1}{m-1}

and the similar results will be there for all α \displaystyle \alpha 's, thus giving by Law of multiplication,

Total number of solutions for ( a 1 a 2 a 3 a m = n ) = j = 1 n ( m + α j 1 m 1 ) \displaystyle \text{Total number of solutions for} (a_1 a_2 a_3 \cdots a_m = n) = \prod_{j=1}^{n}{\dbinom{m+\alpha_j-1}{m-1}}

Arjen Vreugdenhil
Sep 22, 2015

In general, let the prime decomposition of n n be n = p 1 e 1 p 2 e 2 p k e k n = p_1^{e_1}\cdot p_2^{e_2}\cdots p_k^{e_k} with 1 < p 1 < p 2 < < p n 1 < p_1 < p_2 < \dots < p_n .

Each prime factor must be assigned to one of the six factors a , b , c , d , e , f a, b, c, d, e, f . If there are e i e_i factors p i p_i , then this assignment can be made in ( 5 + e i 5 ) \left(\begin{array}{c} 5+e_i \\ 5 \end{array}\right) ways. Multiplying gives N = ( 5 + e 1 5 ) ( 5 + e 2 5 ) ( 5 + e n 5 ) . N = \left(\begin{array}{c} 5+e_1 \\ 5 \end{array}\right) \cdot \left(\begin{array}{c} 5+e_2 \\ 5 \end{array}\right) \cdots \left(\begin{array}{c} 5+e_n \\ 5 \end{array}\right).

For n = 150150 n = 150150 , 150150 = 150 × 1100 = 2 × 3 × 5 2 × 7 × 11 × 13 , 150150 = 150\times 1100 = 2\times 3 \times 5^2 \times 7 \times 11 \times 13, so that N = ( 6 5 ) 5 ( 7 5 ) = 6 5 × 21 = 163296. N = \left(\begin{array}{c} 6 \\ 5 \end{array}\right)^5 \cdot \left(\begin{array}{c} 7 \\ 5 \end{array}\right) = 6^5\times 21 = 163296.

1 pending report

Vote up reports you agree with

×

Problem Loading...

Note Loading...

Set Loading...