Difference between revisions of "1979 USAMO Problems/Problem 3"
m (→Problem) |
m |
||
| Line 7: | Line 7: | ||
{{solution}} | {{solution}} | ||
| − | ==See | + | ==See Also== |
| + | {{USAMO box|year=1979|num-b=2|num-a=4}} | ||
| − | + | [[Category:Olympiad Combinatorics Problems]] | |
Revision as of 09:59, 5 October 2012
Problem
is an arbitrary sequence of positive integers. A member of the sequence is picked at
random. Its value is 
. Another member is picked at random, independently of the first. Its value is 
. Then a third value, 
. Show that the probability that 
is divisible by 
is at least 
.
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
See Also
| 1979 USAMO (Problems • Resources) | ||
| Preceded by Problem 2 |
Followed by Problem 4 | |
| 1 • 2 • 3 • 4 • 5 | ||
| All USAMO Problems and Solutions | ||
