How many different factorizations are there of
2 3 1 0 = 2 ⋅ 3 ⋅ 5 ⋅ 7 ⋅ 1 1 ?
For instance, the number 4 2 = 2 ⋅ 3 ⋅ 7 has five different factorizations:
4 2 , 2 × 2 1 , 3 × 1 4 , 6 × 7 , 2 × 3 × 7 .
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.
Why it can't be done this way?:
(
1
5
)
+
(
2
5
)
+
(
3
5
)
+
(
4
5
)
+
(
5
5
)
=
2
5
−
1
=
3
1
Log in to reply
This misses out two scenarios, namely (i) two pairs of prime factors, e.g., ( 2 ∗ 3 ) ∗ ( 5 ∗ 7 ) ∗ 1 1 = 6 ∗ 3 5 ∗ 1 1 , ( 1 5 cases), and (ii) one triple and one pair of prime factors, e.g., ( 2 ∗ 3 ∗ 5 ) ∗ ( 7 ∗ 1 1 ) = 3 0 ∗ 7 7 , ( 1 0 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 ( 1 5 ) = 5 cases. Thus we end up with 1 5 + 1 0 − 4 = 2 1 more cases, for a total of 3 1 + 2 1 = 5 2 cases, as Arjen has stated.
Log in to reply
Ohh ... I understood my mistake now.... Thanks .....
Could you Pl elaborate on Bell numbers
Log in to reply
You could click on the link I provided :)
In short, the Bell number B n is the number of partitions of a set with n elements. In this case, we count the partitions of the set { 2 , 3 , 5 , 7 , 1 1 } , so the answer is B 5 .
A basic recursion formula for the calculation of B n is B 0 = 1 ; B n + 1 = k = 0 ∑ n ( n k ) B k . The first few Bell numbers are B 0 = 1 ; B 1 = 1 ; B 2 = 2 ; B 3 = 5 ; B 4 = 1 5 ; B 5 = 5 2 ; B 6 = 2 0 3 .
distinct objects into identical bins
What if we have two of the same prime factors twice (E.g. 4 6 2 0 = 2 2 ∗ 3 ∗ 5 ∗ 7 ∗ 1 1 ) and we limit the factorizations so that only n integers are multiplied by each other as opposed to any amount from 1 - 5 (E.g. How many ways are there of having 4 6 2 0 = a b where a and b are integers, if n is equal to 2). Is there a way to generalize this / an easy solution to it?
Log in to reply
Try this out : -link-
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!
Log in to reply
@Arjen Vreugdenhil – Thanks for the explanation :)
For n = 2 the answer is ⌈ 2 δ ( N ) ⌉ , where δ ( N ) is the number of divisors of the given number N . Moreover, if N = ∏ p i e i , where the p i are the distinct prime factors of N , then δ ( N ) = ∏ ( e i + 1 ) .
For your example, δ ( 4 6 2 0 ) = 3 ⋅ 2 ⋅ 2 ⋅ 2 ⋅ 2 = 4 8 , which means that there are 24 ways to factorize 4620 as the product of two factors.
Rationale: if d is a divisor of N , then N = d ⋅ d N is a factorization; and all factorizations of N are of this form. However, we now have all factorizations double, e.g. 4 6 2 0 = 6 0 ⋅ 7 7 and 4 6 2 0 = 7 7 ⋅ 6 0 ; therefore we divide by two. The only exception is when δ ( N ) is odd, which means that N is a perfect square. In that case the factorization N = N ⋅ N should be excluded from the division by two; this I accomplish with the ceiling function ⌈ ⋅ ⌉ .
@Vladimir Smith See this , you will see that it is a known result that this works for square free numbers only.
By the fundamental theorem of arithmetic, 2 3 1 0 is expressed uniquely by the product of the primes 2 , 3 , 5 , 7 and 1 1 .
Using these numbers, we may construct composite factorings of 2 3 1 0 by selecting pairs, triples, etc.
Lets consider the various pairings of the 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 )
Above, primes within brackets indicate the product of the n respective primes, c = ∏ i = 1 n p i Obviously, the primes 2 , 3 , 5 , 7 and 1 1 can take any position in this set-up.
For [ 1 ] , there is obviously only 1 unique selection . For [ 2 ] , there are ( 3 5 ) selections . For [ 3 ] , there are also ( 3 5 ) selections . For [ 4 ] , there are 2 ( 2 5 ) ⋅ ( 2 3 ) selections . For [ 5 ] , there are ( 2 5 ) selections . For [ 6 ] , there are ( 4 5 ) selections . For [ 7 ] , there is obviously only 1 unique selection .
Hence there are 1 + 2 ( 3 5 ) + ( 2 5 ) ( 2 ( 2 3 ) + 1 ) + ( 4 5 ) + 1 = 5 2 different factorisations (including the one provided and 2 3 1 0 = 2 3 1 0 ).
Problem Loading...
Note Loading...
Set Loading...
This is all about Bell numbers . There are five different factors to distribute, so we need the fourth Bell number, B 5 = 5 2 .
Inspiration