Maths Olympiad Prep

Library / /25 of 27

, 2016

Number theory Difficulty 4.1 AIME Prove it Canada

For a positive integer nn, f(n)f(n) is defined as the exponent of the largest power of 33 that divides nn.

For example, f(126)=2f(126) = 2 since 126=32×14126 = 3^2 \times 14 so 323^2 divides 126126, but 333^3 does not.

What is the value of f(405)f(405)?
What is the value of f(1×2×3×4×5×6×7×8×9×10)f(1 \times 2 \times 3 \times 4 \times 5 \times 6 \times 7 \times 8 \times 9 \times 10)?
Let NN be the positive integer equal to 100!50!20!\dfrac{100!}{50!20!}. Determine the value of f(N)f(N).

(Note: If mm is a positive integer, m!m! represents the product of the integers from 1 to mm, inclusive. For example, 5!=1×2×3×4×5=1205!=1 \times 2 \times 3 \times 4 \times 5=120.)
Given that f(a)=8f(a) = 8 and f(b)=7f(b) = 7, determine all possible values of f(a+b)f(a+b).

Solution

Since 405=34×5405=3^4\times5, then 405405 is divisible by 343^4 but is not divisible by 353^5.
Thus, f(405)=4f(405)=4.
First, we find all factors of 3 which exist in the product 1×2×3×4×5×6×7×8×9×101\times2\times3\times4\times5\times6\times7\times8\times9\times10.

The multiples of 3 are the only numbers which contain factors of 3.

The multiples of 3 in the given product are 3, 6 and 9.

Rewriting the given product, we get 1×2×3×4×5×6×7×8×9×10=1×2×3×4×5×(2×3)×7×8×(3×3)×10=34×(1×2×4×5×2×7×8×10).\begin{align*} & & \hspace{-1cm}1 \times 2 \times 3 \times 4 \times 5 \times 6 \times 7 \times 8 \times 9 \times 10\\ &=& 1 \times 2 \times 3 \times 4 \times 5 \times (2\times3) \times 7 \times 8 \times (3\times3) \times 10\\ &=& 3^4\times(1 \times 2 \times 4 \times 5 \times 2 \times 7 \times 8 \times 10).\end{align*} Since the product in parentheses does not include any factors of 3, then the largest power of 3 which divides the given product is 343^4, and so f(1×2×3×4×5×6×7×8×9×10)=4f(1 \times 2 \times 3 \times 4 \times 5 \times 6 \times 7 \times 8 \times 9 \times 10)=4.
First, we count the number of factors of 3 included in 100!100!.

Every multiple of 3 includes least 1 factor of 3.

The product 100!100! includes 33 multiples of 3 (since 33×3=9933\times3=99).

Counting one factor of 3 from each of the multiples of 3 (these are 3,6,9,12,15,18,,93,96,993,6,9,12,15,18,\dots,93,96,99), we see that 100!100! includes at least 33 factors of 3.

However, each multiple of 32=93^2=9 includes a second factor of 3 (since 9=32,18=32×29=3^2, 18=3^2\times2, etc.) which was not counted in the previous 33 factors.

The product 100!100! includes 11 multiples of 9 (since 11×9=9911\times9=99), and thus there are at least 11 additional factors of 3 in 100!.

Similarly, 100!100! includes 3 multiples of 33=273^3=27, each of which contribute an additional factor of 3 (these are 27=33,54=33×227=3^3, 54=3^3\times2, and 81=3481=3^4).

Finally, there is one multiple of 34=813^4=81 which contributes one more factor of 3.

Since 35>1003^5>100, then 100!100! does not include any multiples of 353^5 and so we have counted all possible factors of 3.

Thus, 100!100! includes exactly 33+11+3+1=4833+11+3+1=48 factors of 3, and so 100!=348×t100!=3^{48}\times t for some positive integer tt that is not divisible by 3.

Counting in a similar way, the product 50!50! includes 16 multiples of 3, 5 multiples of 9, and 1 multiple of 27, and thus includes 16+5+1=2216+5+1=22 factors of 3.

Therefore, 50!=322×r50!=3^{22}\times r for some positive integer rr that is not divisible by 3.

Also, 20!20! includes 6+2=86+2=8 factors of 3, and thus 20!=38×s20!=3^{8}\times s for some positive integer ss that is not divisible by 3.

Therefore, N=100!50!20!=348×t(322×r)(38×s)=348×t(330×rs)=318×trsN=\dfrac{100!}{50!20!}=\dfrac{3^{48}\times t}{(3^{22}\times r)(3^{8}\times s)}=\dfrac{3^{48}\times t}{(3^{30}\times rs)}=\dfrac{3^{18}\times t}{rs}.

Since we are given that NN is equal to a positive integer, then 318×trs\dfrac{3^{18}\times t}{rs} is a positive integer.

Since rr and ss contain no factors of 3 and 318×t3^{18}\times t is divisible by rsrs, then it must be the case that tt is divisible by rsrs.

In other words, we can re-write N=318×trsN = \dfrac{3^{18}\times t}{rs} as N=318×trsN = 3^{18}\times \dfrac{t}{rs} where trs\dfrac{t}{rs} is an integer.

Since each of rr, ss and tt does not include any factors of 3, then the integer trs\dfrac{t}{rs} is not divisible by 3.
Therefore, the largest power of 3 which divides 100!50!20!\dfrac{100!}{50!20!} is 3183^{18}, and so f(N)=18f(N)=18.
Since f(a)=8f(a)=8, then the exponent of the largest power of 3 that divides aa is 8.

That is, a=38ma=3^8m for some positive integer mm and 3 does not divide mm.

Since f(b)=7f(b)=7, then the exponent of the largest power of 3 that divides bb is 7.

That is, b=37nb=3^7n for some positive integer nn and 3 does not divide nn.

Substituting and simplifying, we get a+b=38m+37n=37(3m+n)a+b=3^8m + 3^7n=3^7(3m+n) Since 3 divides 3m3m but 3 does not divide nn, then 3 does not divide the sum 3m+n3m+n.

That is, 3m+n3m+n is not a multiple of 3 and so the largest power of 3 that divides a+ba+b is 373^7.

Therefore, f(a+b)=7f(a+b)=7.

Want a route through all this instead of an archive? The track puts 2,444 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: CEMC, University of Waterloo, licensed CC-BY-NC-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.