3

Here is a problem I was given: A lattice point in the plane is a point whose coordinates are both integers. Consider a triangle whose vertices are lattice points (0,0),(a,0) and (0,b), where b≤a. Suppose the triangle contains exactly 74 lattice points in its interior, not including those lattice points on the sides of the triangle. Determine the sums of the areas of all such triangles. The only way that I could see to do this problem was to try all possible values of a, checking to see which values of b gave 74 lattice points. I did this and gave up at a=5 so I suspect there must be an easier way. I was thinking Pick's theorem would be useful but I couldn't think of what to do with it. Can anyone provide a shortcut, or at least just give me the answer? By the way, I know it is less than 1000.

Batominovski
  • 50,341
Maxwell
  • 405

2 Answers2

2

Pick's theorem definitely seems like the way to go. We have to figure out how many lattice points are on the boundary, and the hypotenuse is the only nontrivial side to consider. You should convince yourself, perhaps by considering the slope of the hypotenuse and when it can go through lattice points, that the number of lattice points on the hypotenuse (not counting the vertices) is $\gcd(a,b)-1$. So Pick's theorem says that you're looking for triangles such that $$ 74 + \frac{a+b+\gcd(a,b)}2 - 1 = \text{area} = \frac{ab}2, $$ or $$ 146 = ab-a-b+\gcd(a,b). $$ Since the right-hand side is divisible by $\gcd(a,b)$, that gcd must be either 1, 2, 73, or 146. Now rearrange into $$ 147-\gcd(a,b) = ab-a-b+1 = (a-1)(b-1). $$ One quickly rules out the gcd equaling 73 or 146, and so there are two cases.

Case 1: $\gcd(a,b)=1$ and $146 = (a-1)(b-1)$. There are only two factorizations of $146$ to try, and they both work: $\{a,b\} = \{147,2\}$ and $\{a,b\} = \{74,3\}$.

Case 2: $\gcd(a,b)=2$ and $145 = (a-1)(b-1)$. Again there are only two factorizations of $145$, and now only one works: $\{a,b\} = \{146,2\}$ is good, but $\{a,b\} = \{30,6\}$ has the wrong gcd.

So there are six triangles in all, with total area $2(\frac12147\cdot2 + \frac1274\cdot3 + \frac12146\cdot2) = 808$.

Greg Martin
  • 92,241
  • 2
    Seems like the sign on $\gcd(a,b)$ isn't right. Is that so? – 2'5 9'2 Aug 12 '14 at 08:39
  • +1 Shouldn't change much though. $73$ and $146$ are still quickly tossed out. Then you have to factor $148$ and $149$ respecting the $\gcd$ conditions, so there aren't many cases. – 2'5 9'2 Aug 12 '14 at 08:44
  • The solutions should be (38,5), (149,2) and (150,2). – imj Aug 12 '14 at 08:46
  • @imj Yes, the only factorizations of $148$ that qualify are $37\cdot4$ and $148\cdot1$, and the only factorization of $149$ that qualifies is $149\cdot1$. Adding $1$ to each member of each pair gives your three triangles. – 2'5 9'2 Aug 12 '14 at 08:48
  • 2
    We don't need Pick's theorem: The rectangle $[0,a]\times[0,b]$ has $(a-1)(b-1)$ interior lattice points, and ${\rm gcd}(a,b)-1$ of them are on the descending diagonal. It follows that $$(a-1)(b-1)=2\cdot74+{\rm gcd}(a,b)-1\ .$$ (The sign of ${\rm gcd}$ in the given solution is wrong.) – Christian Blatter Aug 12 '14 at 09:09
  • I see - the very first displayed equation is correct, but I messed up the sign on the next algebra step. Can somebody correct it please? (I made the answer community wiki.) – Greg Martin Aug 13 '14 at 15:50
  • I tried it with the correct sign and got 299 but that seems wrong – Maxwell Aug 15 '14 at 07:07
0

There are exactly three such triangles from an exhaustive search: $$(a,b) = \{(150, 2),(149, 2),(38, 5)\}$$

with areas $150,149 $ and $95$ for a total of $394$.

For a non-search approach, we can build on Christian Blatter's observation that the $(a,b)$ rectangle has $(a-1)(b-1)$ (interior) lattice points and given $d =\gcd(a,b)$, it has $(d-1)$ points on its diagonal, giving the requirement here that
$$\begin{align}2\cdot 74 &= (a-1)(b-1)-(d-1) \\ 148 &= ab-a-b+1-d+1 \\ 146 &= ab-a-b-d \\ \end{align}$$

Since $d \mid a,b$, this means $d\mid 146 = 2\cdot 73$, and it's apparent that we need $b<14$, so $d = 1$ or $2$.

$d=2 \implies (a-1)(b-1) = 149$ (prime) giving $(a,b) =(150,2)$

$d=1 \implies (a-1)(b-1) = 148 = 2^2\cdot 37$ giving $(a,b) = \{(149,2),(38,5)\}$, with $(75,3)$ disqualified for $\gcd(75,3) = 3$.

Joffan
  • 40,356