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 "2004 AMC 12A Problems/Problem 3"

(→‎Solution)
m (→‎Solution 2)
 
Line 15: Line 15:
  
 
==Solution 2==
 
==Solution 2==
−
If <math>x</math> and <math>2y</math> must each be positive integers, then we can say that <math>x</math> is at least 1 and <math>2y</math> is at least 1. From there, we want to find out how many ways there are to distribute the other 98 ones (the smallest positive integer addends of 100). 98 identical objects can be distributed to two distinct bins in 99 ways (think stars and bars), yet this 99 is an overcount. Because <math>y</math> must be an integer, <math>2y</math> must be even; thus only <math>\lfloor \frac{99}{2} \rfloor = \boxed{ 49 \implies B}</math> ways exist to distribute these ones.
+
If <math>x</math> and <math>2y</math> must each be positive integers, then we can say that <math>x</math> is at least 1 and <math>2y</math> is at least 1. From there, we want to find out how many ways there are to distribute the other 98 ones (the smallest positive integer addends of 100). 98 identical objects can be distributed to two distinct bins in 99 ways (think stars and bars), yet this 99 is an overcount. Because <math>y</math> must be an integer, <math>2y</math> must be even; thus only <math>\left\lfloor \frac{99}{2} \right\rfloor = \boxed{ 49 \implies B}</math> ways exist to distribute these ones.
  
 
==See Also==
 
==See Also==

Latest revision as of 01:35, 29 September 2018

Problem

For how many ordered pairs of positive integers $(x,y)$ is $x + 2y = 100$?

$\text {(A)} 33 \qquad \text {(B)} 49 \qquad \text {(C)} 50 \qquad \text {(D)} 99 \qquad \text {(E)}100$

Solution 1

Every integer value of $y$ leads to an integer solution for $x$ Since $y$ must be positive, $y\geq 1$

Also, $y = \frac{100-x}{2}$ Since $x$ must be positive, $y < 50$

$1 \leq y < 50$ This leaves $49$ values for y, which mean there are $49$ solutions to the equation $\Rightarrow \mathrm{(B)}$

Solution 2

If $x$ and $2y$ must each be positive integers, then we can say that $x$ is at least 1 and $2y$ is at least 1. From there, we want to find out how many ways there are to distribute the other 98 ones (the smallest positive integer addends of 100). 98 identical objects can be distributed to two distinct bins in 99 ways (think stars and bars), yet this 99 is an overcount. Because $y$ must be an integer, $2y$ must be even; thus only $\left\lfloor \frac{99}{2} \right\rfloor = \boxed{ 49 \implies B}$ ways exist to distribute these ones.

See Also

2004 AMC 12A (Problems • Answer Key • Resources)
Preceded by
Problem 2 		Followed by
Problem 4
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

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2004_AMC_12A_Problems/Problem_3&oldid=97980"