Difference between revisions of "2023 AMC 12B Problems/Problem 15"
(→Solution 1 (Guess and check + Contrapositive)) |
(→Solution 1 (Guess and check + Contrapositive)) |
||
Line 15: | Line 15: | ||
We examine each of the conditions. | We examine each of the conditions. | ||
− | The first condition is false. A simple counterexample is <math>a=3</math> and <math>b=5</math>. The corresponding value of <math>c</math> is <math>115</math>. Since <math>\gcd(3,14)=1</math>, condition <math>I</math> would imply that <math>\gcd(c,210)=1.</math> However, <math>\gcd(115,210)</math> is clearly not <math>1</math> (they share a common factor of <math>5</math>). Condition <math>I</math> is false | + | The first condition is false. A simple counterexample is <math>a=3</math> and <math>b=5</math>. The corresponding value of <math>c</math> is <math>115</math>. Since <math>\gcd(3,14)=1</math>, condition <math>I</math> would imply that <math>\gcd(c,210)=1.</math> However, <math>\gcd(115,210)</math> is clearly not <math>1</math> (they share a common factor of <math>5</math>). Condition <math>I</math> is false so that we can rule out choices <math>A,B,</math> and <math>C</math>. |
− | We | + | We now decide between the two answer choices <math>D</math> and <math>E</math>. What differs between them is the validity of condition <math>II</math>, so it suffices to check <math>II</math> simply. |
We look at statement <math>II</math>'s contrapositive to prove it. The contrapositive states that if <math>\gcd(a,14)\neq1</math> and <math>\gcd(b,15)\neq1</math>, then <math>\gcd(c,210)\neq1.</math> In other words, if <math>a</math> shares some common factor that is not <math>1</math> with <math>14</math> and <math>b</math> shares some common factor that is not <math>1</math> with <math>15</math>, then <math>c</math> also shares a common factor that is not <math>1</math> with <math>210</math>. Let's say that <math>a=a'\cdot n</math>, where <math>a'</math> is a factor of <math>14</math> not equal to <math>1</math>. (So <math>a'</math> is the common factor.) | We look at statement <math>II</math>'s contrapositive to prove it. The contrapositive states that if <math>\gcd(a,14)\neq1</math> and <math>\gcd(b,15)\neq1</math>, then <math>\gcd(c,210)\neq1.</math> In other words, if <math>a</math> shares some common factor that is not <math>1</math> with <math>14</math> and <math>b</math> shares some common factor that is not <math>1</math> with <math>15</math>, then <math>c</math> also shares a common factor that is not <math>1</math> with <math>210</math>. Let's say that <math>a=a'\cdot n</math>, where <math>a'</math> is a factor of <math>14</math> not equal to <math>1</math>. (So <math>a'</math> is the common factor.) | ||
Line 23: | Line 23: | ||
We can rewrite the given equation as <math>15a+14b=c\implies15(a'n)+14b=c.</math> We can express <math>14</math> as <math>a'\cdot n'</math>, for some positive integer <math>n'</math> (this <math>n'</math> can be <math>1</math>). We can factor <math>a'</math> out to get <math>a'(15n+14n')=c.</math> | We can rewrite the given equation as <math>15a+14b=c\implies15(a'n)+14b=c.</math> We can express <math>14</math> as <math>a'\cdot n'</math>, for some positive integer <math>n'</math> (this <math>n'</math> can be <math>1</math>). We can factor <math>a'</math> out to get <math>a'(15n+14n')=c.</math> | ||
− | + | Since all values in this equation are integers, <math>c</math> must be divisible by <math>a'</math>. Since <math>a'</math> is a factor of <math>14</math>, <math>a'</math> must also be a factor of <math>210</math>, a multiple of <math>14</math>. Therefore, we know that <math>c</math> shares a common factor with <math>210</math> (which is <math>a'</math>), so <math>\gcd(c,210)\neq1</math>. This is what <math>II</math> states, so therefore <math>II</math> is true. | |
Thus, our answer is <math>\boxed{\textbf{(E) }\text{II and III only}}.</math> | Thus, our answer is <math>\boxed{\textbf{(E) }\text{II and III only}}.</math> | ||
~Technodoggo | ~Technodoggo | ||
− | ~AVM2023 (Minor Edits) | + | ~AVM2023 (Minor Edits - Fixes in the first paragraph and grammar edits) |
==Solution 2== | ==Solution 2== |
Revision as of 10:43, 5 October 2024
- The following problem is from both the 2023 AMC 10B #18 and 2023 AMC 12B #15, so both problems redirect to this page.
Contents
Problem
Suppose , , and are positive integers such thatWhich of the following statements are necessarily true?
I. If or or both, then .
II. If , then or or both.
III. if and only if .
Solution 1 (Guess and check + Contrapositive)
We examine each of the conditions.
The first condition is false. A simple counterexample is and . The corresponding value of is . Since , condition would imply that However, is clearly not (they share a common factor of ). Condition is false so that we can rule out choices and .
We now decide between the two answer choices and . What differs between them is the validity of condition , so it suffices to check simply.
We look at statement 's contrapositive to prove it. The contrapositive states that if and , then In other words, if shares some common factor that is not with and shares some common factor that is not with , then also shares a common factor that is not with . Let's say that , where is a factor of not equal to . (So is the common factor.)
We can rewrite the given equation as We can express as , for some positive integer (this can be ). We can factor out to get
Since all values in this equation are integers, must be divisible by . Since is a factor of , must also be a factor of , a multiple of . Therefore, we know that shares a common factor with (which is ), so . This is what states, so therefore is true.
Thus, our answer is ~Technodoggo ~AVM2023 (Minor Edits - Fixes in the first paragraph and grammar edits)
Solution 2
The equation given in the problem can be written as
A counter example is and . Thus, .
First, we prove the ``if part.
Suppose and . However, .
Thus, must be divisible by at least one factor of 210. W.L.O.G, we assume is divisible by 2.
Modulo 2 on Equation (1), we get that . This is a contradiction with the condition that . Therefore, the ``if part in Statement III is correct.
Second, we prove the ``only if part.
Suppose . Because , there must be one factor of 14 or 15 that divides . W.L.O.G, we assume there is a factor of 14 that divides . Because , we have . Modulo on Equation (1), we have .
Because , we have .
Analogously, we can prove that .
This is simply a special case of the ``only if part of Statement III. So we omit the proof.
All analyses above imply
~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 ), 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 its contrapositive, to be precise). Therefore the answer is
~SpencerD. ~edited by A_MatheMagician
Solution 4
First, we will show that statement I is false. A simple counterexample is and . Then, is even, and it is not relatively prime with .
Now, we will focus on statement III. It's pretty easy to realize that if either isn't relatively prime to or isn't relatively prime to , it will always share factors with because (think ). Therefore, statement III must be true.
Since statement III is a stricter case of statement II, the last two statements are true, hence choose
~xHypotenuse
Video Solution
https://youtu.be/pg1pyRa6C24?si=bOM1mQkWzkYZzfv_
~MathProblemSolvingSkills.com
Video Solution 2 by OmegaLearn
Video Solution
~Steven Chen (Professor Chen Education Palace, www.professorchenedu.com)
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.