Difference between revisions of "1972 IMO Problems/Problem 3"
(→Solution) |
(→Solution 2) |
||
Line 30: | Line 30: | ||
== Solution 2 == | == Solution 2 == | ||
+ | Let p be a prime, and n be an integer. Let <math>V_p(n)</math> be the largest positive integer <math>k</math> such that <math>p^k|n</math> | ||
+ | |||
WTS: For all primes <math>p</math>, <math>V_p((2m)!)+V_p((2n)!) \ge V_p(m!)+V_p(n!)+V_p((m+n)!)</math> | WTS: For all primes <math>p</math>, <math>V_p((2m)!)+V_p((2n)!) \ge V_p(m!)+V_p(n!)+V_p((m+n)!)</math> | ||
Line 46: | Line 48: | ||
Apply Lemma 2.1 to the problem: and we are pretty much done. | Apply Lemma 2.1 to the problem: and we are pretty much done. | ||
− | + | Note: I am lazy, so this is only the most important part. I hope you can come up with the rest of the solution. This is my work, but perhaps someone have come up with this method before I did. |
Revision as of 20:32, 20 November 2018
Let and be arbitrary non-negative integers. Prove that is an integer. (.)
Solution 1
Let . We intend to show that is integral for all . To start, we would like to find a recurrence relation for .
First, let's look at :
Second, let's look at :
Combining,
.
Therefore, we have found the recurrence relation .
We can see that is integral because the RHS is just , which we know to be integral for all .
So, must be integral, and then must be integral, etc.
By induction, is integral for all .
Borrowed from http://www.cs.cornell.edu/~asdas/imo/imo/isoln/isoln723.html
Solution 2
Let p be a prime, and n be an integer. Let be the largest positive integer such that
WTS: For all primes ,
We know
Lemma 2.1: Let be real numbers. Then
Proof of Lemma 2.1: Let and
On the other hand,
It is trivial that
Apply Lemma 2.1 to the problem: and we are pretty much done.
Note: I am lazy, so this is only the most important part. I hope you can come up with the rest of the solution. This is my work, but perhaps someone have come up with this method before I did.