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 10B Problems/Problem 2"

(→‎Solution)
(→‎Video Solution (HOW TO THINK CRITICALLY!!!))
 
(18 intermediate revisions by 15 users not shown)
Line 3: Line 3:
 
==Problem==
 
==Problem==
  
−
Consider the statement, "If <math>n</math> is not prime, then <math>n-2</math> is prime." Which of the following values of <math>n</math> is a counterexample to this statement.
+
Consider the statement, "If <math>n</math> is not prime, then <math>n-2</math> is prime." Which of the following values of <math>n</math> is a counterexample to this statement?
  
 
<math>\textbf{(A) } 11 \qquad \textbf{(B) } 15 \qquad \textbf{(C) } 19 \qquad \textbf{(D) } 21 \qquad \textbf{(E) } 27</math>
 
<math>\textbf{(A) } 11 \qquad \textbf{(B) } 15 \qquad \textbf{(C) } 19 \qquad \textbf{(D) } 21 \qquad \textbf{(E) } 27</math>
Line 9: Line 9:
 
==Solution==
 
==Solution==
  
−
Since a counter example must be when n is not prime, n must be composite, so we eliminate A and D. Now we subtract 2 from the remaining answer choices, and we see that the only time <math>n-2</math> is prime is when <math>n = 27</math>, which is E.
+
Since a counterexample must be a value of <math>n</math> which is not prime, <math>n</math> must be composite, so we eliminate <math>\text{A}</math> and <math>\text{C}</math>. Now we subtract <math>2</math> from the remaining answer choices, and we see that the only time <math>n-2</math> is '''not''' prime is when <math>n = \boxed{\textbf{(E) }27}</math>.
  
−
iron
+
~IronicNinja
 +
 
 +
minor edit (the inclusion of not) by AlcBoy1729
 +
 
 +
==Video Solution==
 +
https://youtu.be/CgZnUftXoig
 +
 
 +
~Education, the Study of Everything
  
 
==See Also==
 
==See Also==

Latest revision as of 09:23, 24 June 2023

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

Problem

Consider the statement, "If $n$ is not prime, then $n-2$ is prime." Which of the following values of $n$ is a counterexample to this statement?

$\textbf{(A) } 11 \qquad \textbf{(B) } 15 \qquad \textbf{(C) } 19 \qquad \textbf{(D) } 21 \qquad \textbf{(E) } 27$

Solution

Since a counterexample must be a value of $n$ which is not prime, $n$ must be composite, so we eliminate $\text{A}$ and $\text{C}$. Now we subtract $2$ from the remaining answer choices, and we see that the only time $n-2$ is not prime is when $n = \boxed{\textbf{(E) }27}$.

~IronicNinja

minor edit (the inclusion of not) by AlcBoy1729

Video Solution

https://youtu.be/CgZnUftXoig

~Education, the Study of Everything

See Also

2019 AMC 10B (Problems • Answer Key • Resources)
Preceded by
Problem 1 		Followed by
Problem 3
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 12B (Problems • Answer Key • Resources)
Preceded by
Problem 1 		Followed by
Problem 3
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_10B_Problems/Problem_2&oldid=194735"