Difference between revisions of "2021 USAJMO Problems/Problem 5"

m (See Also)
m (See Also)
Line 6: Line 6:
  
 
==See Also==
 
==See Also==
{{USAJMO newbox|year=2021|num-b=3|num-a=5}}
+
{{USAJMO newbox|year=2021|num-b=4|num-a=6}}
  
 
[[Category:Olympiad Number Theory Problems]]
 
[[Category:Olympiad Number Theory Problems]]
 
{{MAA Notice}}
 
{{MAA Notice}}

Revision as of 13:24, 16 April 2021

A finite set $S$ of positive integers has the property that, for each $s \in S,$ and each positive integer divisor $d$ of $s$, there exists a unique element $t \in S$ satisfying $\text{gcd}(s, t) = d$. (The elements $s$ and $t$ could be equal.)

Given this information, find all possible values for the number of elements of $S$.

Solution

See Also

2021 USAJMO (ProblemsResources)
Preceded by
Problem 4
Followed by
Problem 6
1 2 3 4 5 6
All USAJMO Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png