2005 USAMO Problems/Problem 1: Difference between revisions
No edit summary |
I like pie (talk | contribs) mNo edit summary |
||
| Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
Determine all composite positive integers <math>n</math> for which it is possible to arrange all divisors of <math>n</math> that are greater than 1 in a circle so that no two adjacent divisors are relatively prime. | Determine all composite positive integers <math>n</math> for which it is possible to arrange all divisors of <math>n</math> that are greater than 1 in a circle so that no two adjacent divisors are relatively prime. | ||
== Solution == | == Solution == | ||
{{solution}} | |||
== See also == | |||
{{USAMO newbox|year=2005|before=First Question|num-a=2}} | |||
== | |||
{{USAMO newbox|year=2005|before=First | |||
[[Category:Olympiad Number Theory Problems]] | [[Category:Olympiad Number Theory Problems]] | ||
Revision as of 12:04, 3 May 2008
Problem
Determine all composite positive integers 
for which it is possible to arrange all divisors of that are greater than 1 in a circle so that no two adjacent divisors are relatively prime.
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
See also
| 2005 USAMO (Problems • Resources) | ||
| Preceded by First Question |
Followed by Problem 2 | |
| 1 • 2 • 3 • 4 • 5 • 6 | ||
| All USAMO Problems and Solutions | ||
