Factorization Possibilities

How many different factorizations are there of

2310 = 2 3 5 7 11 ? 2310 = 2\cdot 3\cdot 5\cdot 7\cdot 11?

For instance, the number 42 = 2 3 7 42 = 2\cdot 3\cdot 7 has five different factorizations:

42 , 2 × 21 , 3 × 14 , 6 × 7 , 2 × 3 × 7. 42,\ \ 2\times 21,\ \ 3\times 14,\ \ 6\times 7,\ \ 2\times 3\times 7.

16 24 32 52 120

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.

2 solutions

Arjen Vreugdenhil
Feb 12, 2016

This is all about Bell numbers . There are five different factors to distribute, so we need the fourth Bell number, B 5 = 52 B_5 = 52 .

Inspiration

Why it can't be done this way?:
( 5 1 ) + ( 5 2 ) + ( 5 3 ) + ( 5 4 ) + ( 5 5 ) = 2 5 1 = 31 \binom{5}{1}+\binom{5}{2}+\binom{5}{3}+\binom{5}{4}+\binom{5}{5}=2^5-1=31

Rishabh Jain - 5 years, 4 months ago

Log in to reply

This misses out two scenarios, namely (i) two pairs of prime factors, e.g., ( 2 3 ) ( 5 7 ) 11 = 6 35 11 (2*3)*(5*7)*11 = 6*35*11 , ( 15 15 cases), and (ii) one triple and one pair of prime factors, e.g., ( 2 3 5 ) ( 7 11 ) = 30 77 (2*3*5)*(7*11) = 30*77 , ( 10 10 cases). It also over-counts with regards to the scenario where no prime factors are combined; there is only one case to count rather that ( 5 1 ) = 5 \binom{5}{1} = 5 cases. Thus we end up with 15 + 10 4 = 21 15 + 10 - 4 = 21 more cases, for a total of 31 + 21 = 52 31 + 21 = 52 cases, as Arjen has stated.

Brian Charlesworth - 5 years, 4 months ago

Log in to reply

Ohh ... I understood my mistake now.... Thanks .....

Rishabh Jain - 5 years, 4 months ago

Could you Pl elaborate on Bell numbers

nagarjuna reddy - 5 years, 4 months ago

Log in to reply

You could click on the link I provided :)

In short, the Bell number B n B_n is the number of partitions of a set with n n elements. In this case, we count the partitions of the set { 2 , 3 , 5 , 7 , 11 } \{2, 3, 5, 7, 11\} , so the answer is B 5 B_5 .

A basic recursion formula for the calculation of B n B_n is B 0 = 1 ; B n + 1 = k = 0 n ( n k ) B k . B_0 = 1;\ \ B_{n+1} = \sum_{k = 0}^n \left(\begin{array}{c} n \\ k\end{array}\right)\:B_k. The first few Bell numbers are B 0 = 1 ; B 1 = 1 ; B 2 = 2 ; B 3 = 5 ; B 4 = 15 ; B 5 = 52 ; B 6 = 203. B_0 = 1;\ \ B_1 = 1;\ \ B_2 = 2;\ \ B_3 = 5;\ \ B_4 = 15;\ \ B_5 = 52;\ \ B_6 = 203.

Arjen Vreugdenhil - 5 years, 4 months ago

What if we have two of the same prime factors twice (E.g. 4620 = 2 2 3 5 7 11 4620=2^{ 2 }*3*5*7*11 ) and we limit the factorizations so that only n n integers are multiplied by each other as opposed to any amount from 1 - 5 (E.g. How many ways are there of having 4620 = a b 4620=ab where a and b are integers, if n is equal to 2). Is there a way to generalize this / an easy solution to it?

Vladimir Smith - 5 years, 4 months ago

Log in to reply

Try this out : -link-

Vishnu Bhagyanath - 5 years, 4 months ago

Log in to reply

The difference is that the problem in Vishnu's link asks for the number of ordered tuples. That is much easier than counting unordered set!

Arjen Vreugdenhil - 5 years, 4 months ago

Log in to reply

@Arjen Vreugdenhil Thanks for the explanation :)

Vladimir Smith - 5 years, 3 months ago

For n = 2 n = 2 the answer is δ ( N ) 2 , \left\lceil \frac {\delta(N)} 2 \right\rceil, where δ ( N ) \delta(N) is the number of divisors of the given number N N . Moreover, if N = p i e i , N = \prod p_i^{e_i}, where the p i p_i are the distinct prime factors of N N , then δ ( N ) = ( e i + 1 ) . \delta(N) = \prod (e_i+1).

For your example, δ ( 4620 ) = 3 2 2 2 2 = 48 , \delta(4620) = 3\cdot 2\cdot 2\cdot 2\cdot 2 = 48, which means that there are 24 ways to factorize 4620 as the product of two factors.

Rationale: if d d is a divisor of N N , then N = d N d N = d\cdot \frac N d is a factorization; and all factorizations of N N are of this form. However, we now have all factorizations double, e.g. 4620 = 60 77 4620 = 60\cdot 77 and 4620 = 77 60 4620 = 77\cdot 60 ; therefore we divide by two. The only exception is when δ ( N ) \delta(N) is odd, which means that N N is a perfect square. In that case the factorization N = N N N = \sqrt N \cdot \sqrt N should be excluded from the division by two; this I accomplish with the ceiling function \lceil\cdot\rceil .

Arjen Vreugdenhil - 5 years, 4 months ago

@Vladimir Smith See this , you will see that it is a known result that this works for square free numbers only.

Soumava Pal - 5 years, 3 months ago
Daryl Scott
Feb 16, 2016

By the fundamental theorem of arithmetic, 2310 2310 is expressed uniquely by the product of the primes 2 , 3 , 5 , 7 2, 3, 5, 7 and 11 11 .

Using these numbers, we may construct composite factorings of 2310 2310 by selecting pairs, triples, etc.

Lets consider the various pairings of the 5 5 primes:

[ 1 ] p 1 , p 2 , p 3 , p 4 , p 5 [ 2 ] ( p 1 , p 2 , p 3 ) , p 4 , p 5 [ 3 ] ( p 1 , p 2 , p 3 ) , ( p 4 , p 5 ) [ 4 ] ( p 1 , p 2 ) , ( p 3 , p 4 ) , p 5 [ 5 ] ( p 1 , p 2 ) , p 3 , p 4 , p 5 [ 6 ] ( p 1 , p 2 , p 3 , p 4 ) , p 5 [ 7 ] ( p 1 , p 2 , p 3 , p 4 , p 5 ) [1] \: p_{1}, p_{2}, p_{3}, p_{4}, p_{5} \\ [2] \: (p_{1}, p_{2}, p_{3}), p_{4}, p_{5} \\ [3] \: (p_{1}, p_{2}, p_{3}), (p_{4}, p_{5}) \\ [4] \: (p_{1}, p_{2}), (p_{3}, p_{4}), p_{5} \\ [5] \: (p_{1}, p_{2}), p_{3}, p_{4}, p_{5} \\ [6] \: (p_{1}, p_{2}, p_{3}, p_{4}), p_{5} \\ [7] \: (p_{1}, p_{2}, p_{3}, p_{4}, p_{5})

Above, primes within brackets indicate the product of the n n respective primes, c = i = 1 n p i c=\prod_{i=1}^{n}p_{i} Obviously, the primes 2 , 3 , 5 , 7 2, 3, 5, 7 and 11 11 can take any position in this set-up.

For [ 1 ] , there is obviously only 1 unique selection . For [ 2 ] , there are ( 5 3 ) selections . For [ 3 ] , there are also ( 5 3 ) selections . For [ 4 ] , there are ( 5 2 ) ( 3 2 ) 2 selections . For [ 5 ] , there are ( 5 2 ) selections . For [ 6 ] , there are ( 5 4 ) selections . For [ 7 ] , there is obviously only 1 unique selection . \text{For } [1], \text{there is obviously only } 1 \text{ unique selection}.\\ \text{For } [2], \text{there are } {5\choose 3} \text{ selections}.\\ \text{For } [3], \text{there are also } {5\choose 3} \text{ selections}.\\ \text{For } [4], \text{there are } \frac{{5\choose 2}\cdot {3\choose 2}}{2} \text{ selections}.\\ \text{For } [5], \text{there are } {5\choose 2} \text{ selections}.\\ \text{For } [6], \text{there are } {5\choose 4} \text{ selections}.\\ \text{For } [7], \text{there is obviously only } 1 \text{ unique selection}.

Hence there are 1 + 2 ( 5 3 ) + ( 5 2 ) ( ( 3 2 ) 2 + 1 ) + ( 5 4 ) + 1 = 52 1+2{5\choose 3}+{5\choose 2}\Big(\frac{{3\choose 2}}{2}+ 1\Big)+{5\choose 4}+1=52 different factorisations (including the one provided and 2310 = 2310 2310=2310 ).

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...