Skip to main content

AMC 12 Mock Exam 4 Problem 16

Problem 16 of 25

An orchard has a tree at every point (x,y)(x,y) with integer coordinates satisfying 1≤x≤101\le x\le10 and 1≤y≤101\le y\le10. Lena stands at the origin (0,0)(0,0). A tree is visible to Lena if the line segment from (0,0)(0,0) to that tree contains no point with integer coordinates other than its two endpoints. (Treat each tree as a single point.) How many trees are visible to Lena?

Answer choices

Show solution

Solution

(Every lattice point strictly between the origin and a tree has both coordinates between 11 and 1010, so it is itself a tree; “blocked by a tree” and “contains another lattice point” mean the same thing.) The segment from (0,0)(0,0) to (x,y)(x,y) passes through the lattice points (kxg,kyg)\left(\frac{kx}{g},\frac{ky}{g}\right) for k=0,…,gk=0,\dots,g, where g=gcd⁡(x,y)g=\gcd(x,y), and through no others. So (x,y)(x,y) is visible exactly when gcd⁡(x,y)=1\gcd(x,y)=1.

Count pairs with x<yx<y: for each yy, there are φ(y)\varphi(y) values x<yx<y coprime to yy (for y≥2y\ge2), and none for y=1y=1. So these number φ(2)+⋯+φ(10)=1+2+2+4+2+6+4+6+4=31\varphi(2)+\cdots+\varphi(10)=1+2+2+4+2+6+4+6+4=31. By symmetry, 3131 pairs have x>yx>y, and the only coprime pair with x=yx=y is (1,1)(1,1). Total: 31+31+1=6331+31+1=\boxed{63}.

Tagged: lattice points visible from the origin, gcd and Euler's phi