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 "2022 AMC 12B Problems/Problem 3"

m (→‎Solution 1)
(→‎Solution 2)
Line 11: Line 11:
 
Let <math>P(a,b)</math> denote the digit <math>a</math> written <math>b</math> times and let <math>\overline{a_1a_2\cdots a_n}</math> denote the concatenation of <math>a_1</math>, <math>a_2</math>, ..., <math>a_n</math>.
 
Let <math>P(a,b)</math> denote the digit <math>a</math> written <math>b</math> times and let <math>\overline{a_1a_2\cdots a_n}</math> denote the concatenation of <math>a_1</math>, <math>a_2</math>, ..., <math>a_n</math>.
  
−
Observe that <cmath>\overline{P(1,n) 2 P(1,n)} = \overline{P(1,n+1)P(0,n)} + P(1,n+1) = P(1,n+1) \cdot 10^n + P(1,n+1) = (P(1,n+1))(10^n + 1).</cmath>
+
Observe that <cmath>\overline{P(1,n) 2 P(1,n)} = \overline{P(1,n+1)P(0,n)} + P(1,n+1).</cmath>
 +
 
 +
Since <math>\overline{k P(0,n)} = k \cdot 10^n</math> for all positive integers <math>k</math> and <math>n</math>, <math>\overline{P(1,n+1)P(0,n)} + P(1,n+1)</math> is equal to
 +
<cmath>P(1,n+1) \cdot 10^n + P(1,n+1) = (P(1,n+1))(10^n + 1).</cmath>
  
 
Both terms are integers larger than <math>1</math> since <math>n \geq 1</math>, so <math>\boxed{\textbf{(A) } 0}</math> of the numbers of the sequence are prime.  
 
Both terms are integers larger than <math>1</math> since <math>n \geq 1</math>, so <math>\boxed{\textbf{(A) } 0}</math> of the numbers of the sequence are prime.  

Revision as of 06:53, 18 November 2022

Problem

How many of the first ten numbers of the sequence $121$, $11211$, $1112111$, ... are prime numbers? $\textbf{(A) } 0 \qquad \textbf{(B) }1 \qquad \textbf{(C) }2 \qquad \textbf{(D) }3 \qquad \textbf{(E) }4$

Solution 1

Write $121 = 110 + 11 = 11(10+1)$, $11211 = 11100 + 111 = 111(100+1)$, $1112111 = 1111000 + 1111 = 1111(1000+1)$. It becomes clear that $\boxed{\textbf{(A) } 0}$ of these numbers are prime.

In general, $11...121...1$ (where there are $k$ $1$'s on either side of the $2$) can be written as $(11...11)10^k + 11...11 = 11...11(10^k + 1)$, where the first term has $(k + 1)$ $1$'s.

Solution 2

Let $P(a,b)$ denote the digit $a$ written $b$ times and let $\overline{a_1a_2\cdots a_n}$ denote the concatenation of $a_1$, $a_2$, ..., $a_n$.

Observe that \[\overline{P(1,n) 2 P(1,n)} = \overline{P(1,n+1)P(0,n)} + P(1,n+1).\]

Since $\overline{k P(0,n)} = k \cdot 10^n$ for all positive integers $k$ and $n$, $\overline{P(1,n+1)P(0,n)} + P(1,n+1)$ is equal to \[P(1,n+1) \cdot 10^n + P(1,n+1) = (P(1,n+1))(10^n + 1).\]

Both terms are integers larger than $1$ since $n \geq 1$, so $\boxed{\textbf{(A) } 0}$ of the numbers of the sequence are prime.

~Bxiao31415

See Also

2022 AMC 12B (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=2022_AMC_12B_Problems/Problem_3&oldid=182229"