AoPSWiki
Want to learn how to tackle those tough AMC/AIME/Olympiad counting and probability problems? Check out Art of Problem Solving's NEW Intermediate Counting & Probability by David Patrick.
Personal tools

1990 AIME Problems/Problem 10

From AoPSWiki

Problem

The sets and are both sets of complex roots of unity. The set C = \{zw : z \in A ~ \mbox{and} ~ w \in B\} is also a set of complex roots of unity. How many distinct elements are in ?

Contents

Solution

Solution 1

The least common multiple of and is , so define . We can write the numbers of set as \{n^8, n^{16}, \ldots n^{144}\} and of set as . can yield at most different values. All solutions for will be in the form of .

and are relatively prime, and it is well known that for two relatively prime integers , the largest number that cannot be expressed as the sum of multiples of is . For , this is ; however, we can easily see that the numbers to can be written in terms of . Since the exponents are of roots of unities, they reduce , so all numbers in the range are covered. Thus the answer is .

Solution 2

The 18 and 48th roots of can be found by De Moivre's Theorem. They are \text{cis}\,\left(\frac{2\pi k_1}{18}\right) and \text{cis}\,\left(\frac{2\pi k_2}{48}\right) respectively, where \text{cis}\,\theta = \cos \theta + i \sin \theta and and are integers from to and to , respectively.

zw = \text{cis}\,\left(\frac{\pi k_1}{9} + \frac{\pi k_2}{24}\right) = \text{cis}\,\left(\frac{8\pi k_1 + 3 \pi k_2}{72}\right). Since the trigonometric functions are periodic every , there are at most distinct elements in . As above, all of these will work.

See also

1990 AIME (ProblemsResources)
Preceded by
Problem 9
Followed by
Problem 11
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
NEW! Hard Problems DVD
A documentary about the 2006 US IMO team. Features many current and past AoPS members!
Click here for more details and to order
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us