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 "2019 AMC 10A Problems/Problem 5"
m (→‎Solution: Added proof)
Line 7: Line 7:
  
 
==Solution==
 
==Solution==
−
Note that every term in the sequence <math>-44, -43..., 44, 45</math> cancels out except <math>45</math>. This results in <math>\boxed{\textbf{(D) } 90 }</math> integers.
+
Note that every term in the sequence <math>-44, -43, \cdots, 44, 45</math> cancels out except <math>45</math>. Thus, the answer is, intuitively, <math>\boxed{\textbf{(D) } 90 }</math> integers.
 +
 
 +
Though impractical, a proof of maximality can proceed as follows:  Let the desired sequence of consecutive integers be <math>a, a+1, \cdots, a+(N-1)</math>, where there are <math>N</math> terms, and we want to maximize <math>N</math>.  Then the sum of the terms in this sequence is <math>aN + \frac{(N-1)(N)}{2}=45</math>.  Rearranging and factoring, this reduces to <math>N(2a+N-1) = 90</math>.  Since <math>N</math> must divide <math>90</math>, and we know that <math>90</math> is an attainable value of the sum, <math>90</math> must be the maximum.
  
 
==See Also==
 
==See Also==

Revision as of 19:17, 9 February 2019

The following problem is from both the 2019 AMC 10A #5 and 2019 AMC 12A #4, so both problems redirect to this page.

Problem

What is the greatest number of consecutive integers whose sum is $45?$

$\textbf{(A) } 9 \qquad\textbf{(B) } 25 \qquad\textbf{(C) } 45 \qquad\textbf{(D) } 90 \qquad\textbf{(E) } 120$

Solution

Note that every term in the sequence $-44, -43, \cdots, 44, 45$ cancels out except $45$. Thus, the answer is, intuitively, $\boxed{\textbf{(D) } 90 }$ integers.

Though impractical, a proof of maximality can proceed as follows: Let the desired sequence of consecutive integers be $a, a+1, \cdots, a+(N-1)$, where there are $N$ terms, and we want to maximize $N$. Then the sum of the terms in this sequence is $aN + \frac{(N-1)(N)}{2}=45$. Rearranging and factoring, this reduces to $N(2a+N-1) = 90$. Since $N$ must divide $90$, and we know that $90$ is an attainable value of the sum, $90$ must be the maximum.

See Also

2019 AMC 10A (Problems • Answer Key • Resources)
Preceded by
Problem 4 		Followed by
Problem 6
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 10 Problems and Solutions
2019 AMC 12A (Problems • Answer Key • Resources)
Preceded by
Problem 3 		Followed by
Problem 5
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=2019_AMC_10A_Problems/Problem_5&oldid=101658"