Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2006 SMT/General Problems/Problem 16"

m (→‎Solution)
(→‎Solution)
 
(One intermediate revision by the same user not shown)
Line 5: Line 5:
 
==Solution==
 
==Solution==
  
−
The condition we are looking for is <math>35(n-1)\equiv 0 \mod 360</math>, because if any other <math>A_n = A_1</math> than <math>35(n-1)</math> must be a multiple of 360 as we have rotated <math>(n-1)</math> by the time we place <math>A_n</math>.  
+
The condition we are looking for is <math>110(n-1)\equiv 0 \mod 360</math>, because if any other <math>A_n = A_1</math>, than <math>110(n-1)</math> must be a multiple of 360. This is because the central angle formed between two consecutive points is 110 degrees, and because we have rotated <math>(n-1)</math> times by the time we place <math>A_n</math>.  
  
−
<cmath>35(n-1)\equiv 0\mod 360 \Rightarrow 5(n-1)\equiv 0\mod 360 \Rightarrow x\equiv 73,1\mod 360</cmath>
+
<cmath>110(n-1)\equiv 0\mod 360 \Rightarrow 10(n-1)\equiv 0\mod 360 \Rightarrow x\equiv 37\mod 360</cmath>
−
 
+
We want the first <math>A_n</math> that satisfies the conditions from the problem, therefore, our answer is <math>n=37</math> or <math>\boxed{A_{37}}</math>
−
We can ignore the case of <math>n=1</math> because be are looking for an <math>n\neq1</math>. Therefore, our answer is the second lowest option, <math>n=73</math> or <math>\boxed{A_{73}}</math>
 

Latest revision as of 11:43, 15 January 2020

Problem

Points $A_1, A_2, \cdots$ are placed on a circle with center $O$ such that $\angle OA_nA_{n+1}=35^\circ$ and $A_n\not=A_{n+2}$ for all positive integers $n$. What is the smallest $n>1$ for which $A_n=A_1$?


Solution

The condition we are looking for is $110(n-1)\equiv 0 \mod 360$, because if any other $A_n = A_1$, than $110(n-1)$ must be a multiple of 360. This is because the central angle formed between two consecutive points is 110 degrees, and because we have rotated $(n-1)$ times by the time we place $A_n$.

\[110(n-1)\equiv 0\mod 360 \Rightarrow 10(n-1)\equiv 0\mod 360 \Rightarrow x\equiv 37\mod 360\] We want the first $A_n$ that satisfies the conditions from the problem, therefore, our answer is $n=37$ or $\boxed{A_{37}}$

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2006_SMT/General_Problems/Problem_16&oldid=114793"