2015 UMO Problems/Problem 1: Difference between revisions
Created page with "==Problem == Three trolls have divided <math>n</math> pancakes among themselves such that: • Each troll has a positive integer number of pancakes. • The greatest common..." |
No edit summary |
||
| Line 16: | Line 16: | ||
{{UMO box|year=2015|before=First Problem|num-a=2}} | {{UMO box|year=2015|before=First Problem|num-a=2}} | ||
[[Category: | [[Category:]] | ||
Latest revision as of 01:55, 6 November 2015
Problem
Three trolls have divided 
pancakes among themselves such that:
• Each troll has a positive integer number of pancakes.
• The greatest common divisor of the number of pancakes held by any two trolls is bigger than 
.
• The three greatest common divisors obtained in this way are all distinct.
What is the smallest possible value of ?
Solution
See Also
| 2015 UMO (Problems • Answer Key • Resources) | ||
| Preceded by First Problem |
Followed by Problem 2 | |
| 1 • 2 • 3 • 4 • 5 • 6 | ||
| All UMO Problems and Solutions | ||
[[Category:]]
