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 "2007 AMC 12B Problems/Problem 23"

(New page: ==Problem 23== How many non-congruent right triangles with positive integer leg lengths have areas that are numerically equal to <math>3</math> times their perimeters? <math>\mathrm {(A)}...)
 
m (→‎Problem 23)
Line 2: Line 2:
 
How many non-congruent right triangles with positive integer leg lengths have areas that are numerically equal to <math>3</math> times their perimeters?
 
How many non-congruent right triangles with positive integer leg lengths have areas that are numerically equal to <math>3</math> times their perimeters?
  
−
<math>\mathrm {(A)} 6</math>  <math>\mathrm {(B)} 7</math>  <math>\mathrm {(C)} 8</math>  <math>\mathrm {(D)} 10</math>  <math>\mathrm {(E)} 12</math>
+
<math>\mathrm {(A)} 6\qquad \mathrm {(B)} 7\qquad \mathrm {(C)} 8\qquad \mathrm {(D)} 10\qquad \mathrm {(E)} 12</math>
  
 
==Solution==
 
==Solution==

Revision as of 03:01, 11 March 2012

Problem 23

How many non-congruent right triangles with positive integer leg lengths have areas that are numerically equal to $3$ times their perimeters?

$\mathrm {(A)} 6\qquad \mathrm {(B)} 7\qquad \mathrm {(C)} 8\qquad \mathrm {(D)} 10\qquad \mathrm {(E)} 12$

Solution

$\frac{1}{2}ab = 3(a+b+c)$

$ab = 6(a+b+c)$

Using Euclid's formula for generating primitive triples: $a = m^2-n^2$, $b=2mn$, $c=m^2+n^2$ where $m$ and $n$ are relatively prime positive integers, exactly one of which being even.

Since we do not want to restrict ourselves to only primitives, we will add a factor of k. $a = k(m^2-n^2)$, $b=2kmn$, $c=k(m^2+n^2)$

$(m^2-n^2)\cdot 2mn \cdot k^2 = 6(2m^2 + 2mn)k$

$mn(m-n)(m+n)k = 6m(m+n)$

$n(m-n)k = 6$

Now we do some casework.

For $k=1$

$n(m-n) = 6$ which has solutions $(7,1)$, $(5,2)$, $(5,3)$, $(7,6)$

Removing the solutions that do not satisfy the conditions of Euclid's formula, the only solutions are $(5,2)$ and $(7,6)$

For $k=2$

$n(m-n)=3$ has solutions $(4,1)$, $(4,3)$, both of which are valid.

For $k=3$

$n(m-n)=2$ has solutions $(3,1)$, $(3,2)$ of which only $(3,2)$ is valid.

For $k=6$

$n(m-n)=1$ has solution $(1,2)$, which is valid.

This means that the solutions for $(m,n,k)$ are

$(5,2,1), (7,6,1), (4,1,2), (4,3,2), (3,2,3), (1,2,6)$

$6$ solutions $\Rightarrow \mathrm{(A)}$

See Also

2007 AMC 12B (Problems • Answer Key • Resources)
Preceded by
Problem 22 		Followed by
Problem 24
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25
All AMC 12 Problems and Solutions
Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2007_AMC_12B_Problems/Problem_23&oldid=45357"