返回题库

AIME 2004 I · 第 8 题

AIME 2004 I — Problem 8

专题
Contest Math
难度
L4
来源
AIME

题目详情

Problem

Define a regular nn-pointed star to be the union of nn line segments P1P2,P2P3,,PnP1P_1P_2, P_2P_3,\ldots, P_nP_1 such that

  • the points P1,P2,,PnP_1, P_2,\ldots, P_n are coplanar and no three of them are collinear,
  • each of the nn line segments intersects at least one of the other line segments at a point other than an endpoint,
  • all of the angles at P1,P2,,PnP_1, P_2,\ldots, P_n are congruent,
  • all of the nn line segments P1P2,P2P3,,PnP1P_1P_2, P_2P_3,\ldots, P_nP_1 are congruent, and
  • the path P1P2,P2P3,,PnP1P_1P_2, P_2P_3,\ldots, P_nP_1 turns counterclockwise at an angle of less than 180 degrees at each vertex.

There are no regular 3-pointed, 4-pointed, or 6-pointed stars. All regular 5-pointed stars are similar, but there are two non-similar regular 7-pointed stars. How many non-similar regular 1000-pointed stars are there?

解析

Solution 1

We use the Principle of Inclusion-Exclusion (PIE).

If we join the adjacent vertices of the regular nn-star, we get a regular nn-gon. We number the vertices of this nn-gon in a counterclockwise direction: 0,1,2,3,,n1.0, 1, 2, 3, \ldots, n-1.

A regular nn-star will be formed if we choose a vertex number mm, where 0mn10 \le m \le n-1, and then form the line segments by joining the following pairs of vertex numbers: (0modn,mmodn),(0 \mod{n}, m \mod{n}), (mmodn,2mmodn),(m \mod{n}, 2m \mod{n}), (2mmodn,3mmodn),(2m \mod{n}, 3m \mod{n}), ,\cdots, ((n2)mmodn,(n1)mmodn),((n-2)m \mod{n}, (n-1)m \mod{n}), ((n1)mmodn,0modn).((n-1)m \mod{n}, 0 \mod{n}).

If gcd(m,n)>1\gcd(m,n) > 1, then the star degenerates into a regular ngcd(m,n)\frac{n}{\gcd(m,n)}-gon or a (2-vertex) line segment if ngcd(m,n)=2\frac{n}{\gcd(m,n)}= 2. Therefore, we need to find all mm such that gcd(m,n)=1\gcd(m,n) = 1.

Note that n=1000=2353.n = 1000 = 2^{3}5^{3}.

Let S={1,2,3,,1000}S = \{1,2,3,\ldots, 1000\}, and Ai={iSi divides 1000}A_{i}= \{i \in S \mid i\, \textrm{ divides }\,1000\}. The number of mm's that are not relatively prime to 10001000 is: A2A5=A2+A5A2A5\mid A_{2}\cup A_{5}\mid = \mid A_{2}\mid+\mid A_{5}\mid-\mid A_{2}\cap A_{5}\mid =10002+10005100025= \left\lfloor \frac{1000}{2}\right\rfloor+\left\lfloor \frac{1000}{5}\right\rfloor-\left\lfloor \frac{1000}{2 \cdot 5}\right\rfloor =500+200100=600.= 500+200-100 = 600.

Vertex numbers 11 and n1=999n-1=999 must be excluded as values for mm since otherwise a regular n-gon, instead of an n-star, is formed.

The cases of a 1st line segment of (0, m) and (0, n-m) give the same star. Therefore we should halve the count to get non-similar stars.

Therefore, the number of non-similar 1000 pointed stars is 100060022=199.\frac{1000-600-2}{2}= \boxed{199}.


Note that in general, the number of nn-pointed stars is given by ϕ(n)21\frac{\phi(n)}{2} - 1 (dividing by 22 to remove the reflectional symmetry, subtracting 11 to get rid of the 11-step case), where ϕ(n)\phi(n) is the Euler's totient function. It is well-known that ϕ(n)=n(11p1)(11p2)(11pn)\phi(n) = n\left(1-\frac{1}{p_1}\right)\left(1-\frac{1}{p_2}\right)\cdots \left(1-\frac{1}{p_n}\right), where p1,p2,,pnp_1,\,p_2,\ldots,\,p_n are the distinct prime factors of nn. Thus ϕ(1000)=1000(112)(115)=400\phi(1000) = 1000\left(1 - \frac 12\right)\left(1 - \frac 15\right) = 400, and the answer is 40021=199\frac{400}{2} - 1 = 199.

Solution 2

Continue as before by cyclically constructing a star by taking every kk-th point. We can think of this construction as the orbit of a point by a rotation RkD1000R^k\in D_{1000}. Then, we want Rk=1000|R^k|=1000, meaning that k(Z/1000Z)×k\in (\mathbb Z/1000\mathbb Z)^\times. Then, kk is coprime to 10001000, meaning kk may take on ϕ(1000)=400\phi(1000)=400 possible values. For any RkR^k, the dihedral symmetry TRkTR^k defines the figure-preserving bijection RkRkR^k\mapsto R^{-k}, meaning half of our possible values of kk are similar. Finally, the condition that each edge must intersect another rules out k=1k=1, giving a total of 40021=199\frac{400}2-1=\boxed{199} pointed stars.

~pineconee