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 12B Problems/Problem 15"
Line 81: Line 81:
 
~SpencerD. ~edited by A_MatheMagician
 
~SpencerD. ~edited by A_MatheMagician
  
−
==Video Solution 1 by OmegaLearn==
 
−
https://youtu.be/eOzhJ6e_Cjg
 
  
 
==See Also==
 
==See Also==

Revision as of 21:10, 15 November 2023

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

Problem

Suppose $a$, $b$, and $c$ are positive integers such that\[\frac{a}{14}+\frac{b}{15}=\frac{c}{210}.\]Which of the following statements are necessarily true?

I. If $\gcd(a,14)=1$ or $\gcd(b,15)=1$ or both, then $\gcd(c,210)=1$.

II. If $\gcd(c,210)=1$, then $\gcd(a,14)=1$ or $\gcd(b,15)=1$ or both.

III. $\gcd(c,210)=1$ if and only if $\gcd(a,14)=\gcd(b,15)=1$.

$\textbf{(A)}~\text{I, II, and III}\qquad\textbf{(B)}~\text{I only}\qquad\textbf{(C)}~\text{I and II only}\qquad\textbf{(D)}~\text{III only}\qquad\textbf{(E)}~\text{II and III only}$

Solution 1 (Guess and check + Contrapositive)

We examine each of the conditions.

The first condition is false. A simple counterexample is $a=3$ and $b=5$. The corresponding value of $c$ is $17\cdot15=255$. Clearly, $\gcd(3,14)=1$ and $\gcd(5,15)=5$, so condition $I$ would imply that $\gcd(c,210)=1.$ However, $\gcd(255,210)$ is clearly not $1$ (they share a common factor of $5$). Obviously, condition $I$ is false, so we can rule out choices $A,B,$ and $C$.

We are now deciding between the two answer choices $D$ and $E$. What differs between them is the validity of condition $II$, so it suffices to simply check $II$.

We look at statement $II$'s contrapositive to prove it. The contrapositive states that if $\gcd(a,14)\neq1$ and $\gcd(b,15)\neq1$, then $\gcd(c,210)\neq1.$ In other words, if $a$ shares some common factor that is not $1$ with $14$ and $b$ shares some common factor that is not $1$ with $15$, then $c$ also shares a common factor with $210$. Let's say that $a=a'\cdot n$, where $a'$ is a factor of $14$ not equal to $1$. (So $a'$ is the common factor.)

We can rewrite the given equation as $15a+14b=c\implies15(a'n)+14b=c.$ We can express $14$ as $a'\cdot n'$, for some positive integer $n'$ (this $n'$ can be $1$). We can factor $a'$ out to get $a'(15n+14n')=c.$

We know that all values in this equation are integers, so $c$ must be divisible by $a'$. Since $a'$ is a factor of $14$, $a'$ must also be a factor of $210$, a multiple of $14$. Therefore, we know that $c$ shares a common factor with $210$ (which is $a'$), so $\gcd(c,210)\neq1$. This is what $II$ states, so therefore $II$ is true.

Thus, our answer is $\boxed{\textbf{(E) }\text{II and III only}}.$ ~Technodoggo

Solution 2

The equation given in the problem can be written as \[ 15 a + 14 b = c. \hspace{1cm} (1) \]

$\textbf{First, we prove that Statement I is not correct.}$

A counter example is $a = 1$ and $b = 3$. Thus, ${\rm gcd} (c, 210) = 3 \neq 1$.

$\textbf{Second, we prove that Statement III is correct.}$

First, we prove the ``if part.

Suppose ${\rm gcd}(a , 14) = 1$ and ${\rm gcd}(b, 15) = 1$. However, ${\rm gcd} (c, 210) \neq 1$.

Thus, $c$ must be divisible by at least one factor of 210. W.L.O.G, we assume $c$ is divisible by 2.

Modulo 2 on Equation (1), we get that $2 | a$. This is a contradiction with the condition that ${\rm gcd}(a , 14) = 1$. Therefore, the ``if part in Statement III is correct.

Second, we prove the ``only if part.

Suppose ${\rm gcd} (c, 210) \neq 1$. Because $210 = 14 \cdot 15$, there must be one factor of 14 or 15 that divides $c$. W.L.O.G, we assume there is a factor $q > 1$ of 14 that divides $c$. Because ${\rm gcd} (14, 15) = 1$, we have ${\rm gcd} (q, 15) = 1$. Modulo $q$ on Equation (1), we have $q | a$.

Because $q | 14$, we have ${\rm gcd}(a , 14) \geq q > 1$.

Analogously, we can prove that ${\rm gcd}(b , 15) > 1$.

$\textbf{Third, we prove that Statement II is correct.}$

This is simply a special case of the ``only if part of Statement III. So we omit the proof.

All analyses above imply $\boxed{\textbf{(E) II and III only}}.$

~Steven Chen (Professor Chen Education Palace, www.professorchenedu.com)

Solution 3 (Answer Choices)

It can easily be shown that statement I is false (a counterexample would be $a=1, b=5, c=85$), meaning the only viable answer choices are D and E. Since both of these answer choices include statement III, this means III is true. Since III is true, this actually implies that statement II is true, as III is just a stronger version of statement II (or it's contrapositive, to be precise). Therefore the answer is $\boxed{\textbf{(E) II and III only}}.$

~SpencerD. ~edited by A_MatheMagician


See Also

2023 AMC 10B (Problems • Answer Key • Resources)
Preceded by
Problem 17 		Followed by
Problem 19
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
2023 AMC 12B (Problems • Answer Key • Resources)
Preceded by
Problem 14 		Followed by
Problem 16
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_12B_Problems/Problem_15&oldid=203723"