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 "2023 AMC 12A Problems/Problem 20"

(→‎Problem)
(→‎Solution 1)
Line 12: Line 12:
 
First, let <math>R(n)</math> be the sum of the <math>n</math>th row. Now, with some observations and math instinct, we can guess that <math>R(n) = 2^n - n</math>.
 
First, let <math>R(n)</math> be the sum of the <math>n</math>th row. Now, with some observations and math instinct, we can guess that <math>R(n) = 2^n - n</math>.
  
−
now we try to prove it by induction,
+
Now we try to prove it by induction,
  
 
<math>R(1) = 2^n - n = 2^1 - 1 = 1</math> (works for base case)
 
<math>R(1) = 2^n - n = 2^1 - 1 = 1</math> (works for base case)
Line 20: Line 20:
 
<math>R(k+1) = 2^{k+1} - (k + 1) = 2(2^k) - k - 1</math>
 
<math>R(k+1) = 2^{k+1} - (k + 1) = 2(2^k) - k - 1</math>
  
−
Now by definition from the question, the next row is always<math>:</math> double the sum of last row (Each number from last row branches off toward left and right to the next row), plus # of new row, minus 2 (leftmost and rightmost are just 1)
+
By definition from the question, the next row is always<math>:</math>  
 +
 
 +
Double the sum of last row (Imagine ach number from last row branches off toward left and right to the next row), plus # of new row, minus 2 (leftmost and rightmost are just 1)
 +
 
 +
Which gives us <math>:</math>
  
 
<math>2(2^k - k) + (k + 1) - 2 = 2(2^k) - k - 1</math>
 
<math>2(2^k - k) + (k + 1) - 2 = 2(2^k) - k - 1</math>
  
−
Hence proven.
+
Hence proven
  
−
Simply substitute <math>n = 2023</math>, we get <math>R(2023) = 2^{2023} - 2023</math>
+
Last, simply substitute <math>n = 2023</math>, we get <math>R(2023) = 2^{2023} - 2023</math>
  
 
Last digit of <math>2^{2023}</math> is <math>8</math>, <math>8-3 = \boxed{\textbf{(C) } 5}</math>
 
Last digit of <math>2^{2023}</math> is <math>8</math>, <math>8-3 = \boxed{\textbf{(C) } 5}</math>

Revision as of 22:07, 9 November 2023

Problem

Rows 1, 2, 3, 4, and 5 of a triangular array of integers are shown below.

[someone insert diagram pls]

Each row after the first row is formed by placing a 1 at each end of the row, and each interior entry is 1 greater than the sum of the two numbers diagonally above it in the previous row. What is the units digits of the sum of the 2023 numbers in the 2023rd row?

$\textbf{(A) } 1 \qquad \textbf{(B) } 3 \qquad \textbf{(C) } 5 \qquad \textbf{(D) } 7 \qquad \textbf{(E) } 9$

Solution 1

First, let $R(n)$ be the sum of the $n$th row. Now, with some observations and math instinct, we can guess that $R(n) = 2^n - n$.

Now we try to prove it by induction,

$R(1) = 2^n - n = 2^1 - 1 = 1$ (works for base case)

$R(k) = 2^k - k$

$R(k+1) = 2^{k+1} - (k + 1) = 2(2^k) - k - 1$

By definition from the question, the next row is always$:$

Double the sum of last row (Imagine ach number from last row branches off toward left and right to the next row), plus # of new row, minus 2 (leftmost and rightmost are just 1)

Which gives us $:$

$2(2^k - k) + (k + 1) - 2 = 2(2^k) - k - 1$

Hence proven

Last, simply substitute $n = 2023$, we get $R(2023) = 2^{2023} - 2023$

Last digit of $2^{2023}$ is $8$, $8-3 = \boxed{\textbf{(C) } 5}$

~lptoggled

See also

2023 AMC 12A (Problems • Answer Key • Resources)
Preceded by
Problem 19 		Followed by
Problem 21
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=2023_AMC_12A_Problems/Problem_20&oldid=201468"