Find the highest power of 1 2 that divides 4 9 ! .
Clarification: 4 9 ! = 1 × 2 × 3 × ⋯ × 4 9 .
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.
In 49! there are 16 multiples of 3, 5 multiples of 9 and 1 multiple of 27. Since 3=3^1
and 9=3^2 and 27 =3^3 we have 22 th power of 3 in prime factorization of 49!. similarly we find that 48th power of 2 exists in 49!, which means that 24Th power of 4 exists in its p.f. since 24>22, each three has a pair with 2 extra 4s after pairing. since 3x4=12, each pair gives 12 so 22th power of 12 exists in 49!.
Thank you. Today I learnt a new formula from your solution...
What led you to think of using Legendre's Formula?
Log in to reply
Muhammad Shariq: My solution also used Legendre´s Formula. What led me to think of using it were the 4 9 ! and the fact that they ask for the highest power of 12 which divides it. This is called multiplicity btw. When I saw a factorial and the multiplicity of a number, this was a huge indicator of using Legendre´s Formula, which finds the multiplicity of a prime factor for a factorial . However, note that this formula works with the multiplicity of primes, therefore we broke 1 2 as 2 2 × 3 . I don´t know about the author of this particular solution, but this is why I used it.
Good.
what does 2^{46} ||49! mean?
Log in to reply
It means 2 4 6 exactly divides 4 9 ! , and that means 4 6 is the largest power of 2 dividing 4 9 ! .
Log in to reply
But why 2 and not 12?
Log in to reply
@Klahrinz William Catubig – works only with prime numbers like 2,3,5...
So here's the thing: I actually tried to work this out the long way, counting the times 12 could be factored out from 49! -- and I cannot for the life of me get past 21.
Nope, naturally it's after wasting a whole evening on this and then posting this comment that I find what I had missed. 22 it is.
If we prime factorise 49! and look at the power of 3 we are done..as number of 2's in 49! well exceeds number of 3's and we need both 2 and 3 to make 12..hence we get enough 2's as compared to 3..hence power of 3 is the answer.
Log in to reply
Not neccesarily. Since 12 has 2 factors of 2 and only 1 factor of three, then you must divide the powers of 2 by 2.
i did the same way
Just a side note: I cannot access your link.
Here should be the correct link: Lengendre's Formula
can you this question in the same way. find the highest power of 2 which is the nearest to 50!.
I did a slight mistake it came 16 then20 then 19. What a bad luck
but if u divide 49! by 12 to the power 50 u still get an integer. so how is it 22?
we know 3>2. so the deciding factor is 3. isnt it enough if we check for 3 alone?
How many 2 's are there in 4 9 ! ?
⌊ 2 4 9 ⌋ + ⌊ 4 4 9 ⌋ + ⌊ 8 4 9 ⌋ + ⌊ 1 6 4 9 ⌋ + ⌊ 3 2 4 9 ⌋ = 4 6 .
How many 3 's?
⌊ 3 4 9 ⌋ + ⌊ 9 4 9 ⌋ + ⌊ 2 7 4 9 ⌋ = 2 2 .
But we know 1 2 = 2 ⋅ 2 ⋅ 3 . We have 2 3 pairs of 2 's that we can choose, but only 2 2 3 's. Thus, maximizing the power of 1 2 yields 2 2 .
Nice and logical. I applied the same method...
Nice latex.
First of all, observe that 1 2 n = 3 n × 2 2 n . Then observe that 4 9 ! has 4 8 factors 2 and 2 2 factors 3 . Then we want n such that
n = m i n ( 4 8 / 2 , 2 2 ) = 2 2
12=2 x 2 x 3
Because you get at least one 2 every even number, compared to the amount of 3's it is absolutely enormous, so we don't want to worry about that.
there is one 3 for every multiple of 3, an additional for every multiple of 9, and an additional for every multiple of 27.
[49/3]+[49/9]+[49/27]=16+5+1= 22
We express 4 9 ! in terms of 2 a 3 b k for some positive integer a , b , k . Now, from Legendre's theorem, we obtain
a = ∑ n = 1 ∞ ⌊ 2 n 4 9 ⌋ = 4 6
and
b = ∑ n = 1 ∞ ⌊ 3 n 4 9 ⌋ = 2 2
It follows that 4 9 ! = 2 4 6 3 2 2 k = ( 2 2 3 ) 2 2 2 2 k = 1 2 2 2 4 k . Hence, the largest power of 1 2 that would divide 4 9 ! ,must be 2 2
Notice that 1 2 = 2 × 2 × 3 , which means that we need to obtain two "2"s and a "3" from the prime factorization of 4 9 ! in order to be divisible by one power of 12. Therefore, we need to calculate the number of "2"s and the number of "3"s in the prime factorization of 4 9 ! .
The number of "2"s in the prime factorization of 4 9 !
= ⌊ 2 4 9 ⌋ + ⌊ 4 4 9 ⌋ + ⌊ 8 4 9 ⌋ + ⌊ 1 6 4 9 ⌋ + ⌊ 3 2 4 9 ⌋
= 2 4 + 1 2 + 6 + 3 + 1
= 4 6
The number of "3"s in the prime factorization of 4 9 !
= ⌊ 3 4 9 ⌋ + ⌊ 9 4 9 ⌋ + ⌊ 2 7 4 9 ⌋
= 1 6 + 5 + 1
= 2 2
There are 46 "2"s and 22 "3"s available, and since 2 4 6 > 2 2 , the answer is 22.
Here are two possible approaches (using Legendre's theorem):
1) We have v 3 ( 4 9 ! ) = i = 1 ∑ ∞ ⌊ 3 i 4 9 ⌋ = 2 2 v 4 ( 4 9 ! ) = 2 1 v 2 ( 4 9 ! ) = 2 1 i = 1 ∑ ∞ ⌊ 2 i 4 9 ⌋ = 2 3 Hence the answer is 2 2 .
2) We have v 3 ( 4 9 ! ) = 3 − 1 4 9 − S 3 ( 4 9 ) = 2 4 4 = 2 2 v 4 ( 4 9 ! ) = 2 1 v 2 ( 4 9 ! ) = 2 1 ⋅ 2 − 1 4 9 − S 2 ( 4 9 ) = 2 4 6 = 2 3 and the answer again comes out to be 2 2 .
No. of 2's conatined in 4 9 ! = 2 4 + 1 2 + 6 + 3 + 1 = 4 6
No. of 3's conatined in 4 9 ! = 1 6 + 5 + 1 = 2 2
since in 12 2's and 3's are in the ratio 2 : 1 and 4 6 > 4 4
thus 2 2
We know if to find many zero, we think that it divides by 10. but it divides by 5 up to 5^n. So, it's 12 = 2^2. 3, divides by 3 up to 3^n ----> | 49/3 | + | 49/9 | + | 49/27 | = 16 + 5 + 1 = 22. ANSWER : 22
Could you please elaborate upon this approach please? New to me- and why are the remainders redundant here for finding the solution?
here we will count total power of three's in 49!
3 = 1
6 = 1
9 = 2
12 = 1
15 = 1
18 = 2
21 = 1
24 = 1
27 = 3
30 = 1
33 = 1
36 = 2
39 = 1
42 = 1
45 = 2
48 = 1
total = 22
now we know that 12 = 2^2*3^1
so here in one (12) no. of three's required =1
so highest power of 12 that divides 49! is 22
(here we will not consider two since two will obviously more than twice of no. of three's and here it is 46)
12 = 2^2×3 We find the maximum power of 2 in 49! = 492+494+498+4916+4932=24+12+6+3+1=46 So maximum power of 2^2 in 49! is 23. Now we find the maximum power of 3 in 49! = 493+499+4927=16+5+1=22 ⇒49!=(22)23×3^22×some K So 22 is the maximum power of 12 that divides 49! exactly.
As a start, we need to break 12 down into its prime factors. Thus, 12 = 2 * 2 * 3.
To now find out the greatest power of 12 that can divide 49!, we need to figure out how many 3s and how many 2s does the expanded 49! contain.
To do this, we first divide 49 by 3, which gives the numerator as 16. Thus, there are 16 numbers in 49! that are directly divisible by 3. These numbers of course are the multiples of 3 like 3,6,9......48. Now, the above calculation only takes a single 3 into account. But what about numbers like 9 which contain two 3s. The above calculation only counted them as one 3. Thus, we have 49/9 = 5 more 3s in 49!. These come from multiples of 3 squared. Lastly, we have have multiple of 3^3 in 49!. To get the exact number, we divide 49/27 = 1 more 3.
How do we know when to stop? When 49 divided by 3^n gives a numerator of 0. In this case, 49/81 would give us 0 and hence 49! does not contain any more 3s.
Total number of 3s in 49! = 16+5+1 = 22 in number.
We must also check for 2s in 49!.
These are, by similar calculation as above, 49/2 = 24 in number 49/4 = 12 in number 49/8 = 6 in number 49/16 = 3 in number 49/32 =1 49/64 = 0 and hence we stop
Total numbers of 2s in 49! = 24+12+6+3+1 = 46.
Going to the start, 12 = 2 2 3. Thus, for every two 2s, we need to have only one 3. Thus, since 22 is less in number than 46/2 (Number of 2s by 2), the number of 3s become the decisive factor in this case.
Thus, the maximum power of 12 that can divide 49! is 22.
49 / 12 = 49 /(2^2 x 3)
Now let us count how many 2^2 and 3 in 49!
sources of 2 in 49 = 49/2 + 49 /4 + 49/8 + 49/16 + 49 /32 = 24 + 12 + 6 + 2 +1 = 45
sources of 3 in 49 = 49/3 + 49 / 9 + 49 / 27 = 16 + 5 + 1 = 22
This means there are 2^45 and 3 ^ 22 in 49 !
number of 12's in 49! = 2^3 x (2^2 x 3)^22
then, the highest power of 12 in 49 ! = 22
49 / 12 = 49 /(2^2 x 3)
Now let us count how many 2^2 and 3 in 49!
sources of 2 in 49 = 49/2 + 49 /4 + 49/8 + 49/16 + 49 /32 = 24 + 12 + 6 + 2 +1 = 46
sources of 3 in 49 = 49/3 + 49 / 9 + 49 / 27 = 16 + 5 + 1 = 22
This means there are 2^46 and 3 ^ 22 in 49 !
number of 12's in 49! = 2^2 x (2^2 x 3)^22
then, the highest power of 12 in 49 ! = 22
PGCD(4,3)=1 and 12=4*3 It is trivial to prove that the power of 4 in 49! is more than the power of 3 in 49! Which means the highest power of 12 that would divide 49! is the power of 3 in 49! which is easy to compute : 22
12=2x2x3....so ,the highest power of 12 is the highest power which the greatest prime factor of 12.,that is 3 possesses .. the greatest power of 3 is given by [49/3]+[49/3x3]+[49/3 3 3]= 22
This question is all about counting prime factors 2 and 3, since the number 12 contains two factors 2 and one factor 3. In order to find the highest power of 12, we count all factors 2 and 3 in 4 9 ! . This is the same thing as saying we count the number of factors in each of 1 , 2 , 3 , … , 4 9 and add these. It turns out there are 4 6 factors 2 and 2 2 factors 3 in 4 9 ! . Since 4 6 > 2 ⋅ 2 2 , the number of factors limits the powers of 12 and as a result, the highest power of 21 dividing 4 9 ! is 22.
Write the prime factorization of all numbers from 2 to 49. From these factorizations, cross out any number that is not a 2 or a 3. Create as many {2, 2, 3} sets as possible from the remaining numbers. You will be able to make 22 such sets.
We find the maximum power of 2 in 49! = 49/2+49/4+49/8+49/16+49/32=24+12+6+3+1=46
So maximum power of 22 in 49! is 23.
Now we find the maximum power of 3 in 49! = 49/3+49/9+49/27=16+5+1=22 ⇒49!=(2^2)^23×3^22×some K
So 22 is the maximum power of 12 that divides 49! exactly.
The highest power of 12 that divides 49! is the same as the highest power of 3 that divides 49! and this is [49/3]+[49/3^2]+[49/3^3] $$ \text{ where } [x] \text{ denotes the greatest integer } \le x$$
the highest power of 12 that would devide 49! is ⌊ 3 4 9 ⌋ + ⌊ 9 4 9 ⌋ + ⌊ 2 7 4 9 ⌋ = 1 6 + 5 + 1 = 2 2
Highest power of 49! is ⌊ 3 4 9 ⌋ + ⌊ 9 4 9 ⌋ + ⌊ 2 7 4 9 ⌋ = 1 6 + 5 + 1 = 2 2
Problem Loading...
Note Loading...
Set Loading...
First note that: 1 2 = 2 2 ⋅ 3 . Let e p ( n ! ) denote the the largest power of a prime p which divides n ! .
By Legendre's Formula , we have:
e 2 ( 4 9 ! ) = i = 1 ∑ ∞ ⌊ 2 i 4 9 ⌋ = ⌊ 2 1 4 9 ⌋ + ⌊ 2 2 4 9 ⌋ + ⌊ 2 3 4 9 ⌋ + ⌊ 2 4 4 9 ⌋ + ⌊ 2 5 4 9 ⌋ + ⌊ 2 6 4 9 ⌋ + ⋅ ⋅ ⋅
= 2 4 + 1 2 + 6 + 3 + 1 + 0 + 0 + 0 + ⋅ ⋅ ⋅ = 4 6
e 3 ( 4 9 ! ) = i = 1 ∑ ∞ ⌊ 3 i 4 9 ⌋ = ⌊ 3 1 4 9 ⌋ + ⌊ 3 2 4 9 ⌋ + ⌊ 3 3 4 9 ⌋ + ⌊ 3 4 4 9 ⌋ + ⌊ 3 5 4 9 ⌋ + ⌊ 3 6 4 9 ⌋ + ⋅ ⋅ ⋅
= 1 6 + 5 + 1 + 0 + 0 + 0 + ⋅ ⋅ ⋅ = 2 2
So we get 2 4 6 ∣ ∣ 4 9 ! ⟹ 4 2 3 ∣ ∣ 4 9 ! and 3 2 2 ∣ ∣ 4 9 ! . Since 2 3 > 2 2 , we get: 1 2 2 2 ∣ ∣ 4 9 ! .
Therefore, the largest power of 1 2 dividing 4 9 ! is 2 2 .