Difference between revisions of "1995 AIME Problems/Problem 10"
m (→Second Solution) |
m (→Second Solution) |
||
Line 34: | Line 34: | ||
If <math>b</math> is <math>1\mod{5}</math>, then <math>b + 2 * 42</math> is divisible by 5 and thus <math>a \leq 2</math>. Thus, <math>n \leq 3*42 = 126 < 215</math>. | If <math>b</math> is <math>1\mod{5}</math>, then <math>b + 2 * 42</math> is divisible by 5 and thus <math>a \leq 2</math>. Thus, <math>n \leq 3*42 = 126 < 215</math>. | ||
− | If <math>b</math> is <math>2\mod{5}</math>, then <math>b + 4 * 42</math> is divisible by 5 and thus <math>a \ | + | If <math>b</math> is <math>2\mod{5}</math>, then <math>b + 4 * 42</math> is divisible by 5 and thus <math>a \leq 4</math>. Thus, <math>n \leq 5*42 = 210 < 215</math>. |
If <math>b</math> is <math>3\mod{5}</math>, then <math>b + 1 * 42</math> is divisible by 5 and thus <math>a = 1</math>. Thus, <math>n \leq 2*42 = 84 < 215</math>. | If <math>b</math> is <math>3\mod{5}</math>, then <math>b + 1 * 42</math> is divisible by 5 and thus <math>a = 1</math>. Thus, <math>n \leq 2*42 = 84 < 215</math>. | ||
− | If <math>b</math> is <math>4\mod{5}</math>, then <math>b + 3 * 42</math> is divisible by 5 and thus <math>a \ | + | If <math>b</math> is <math>4\mod{5}</math>, then <math>b + 3 * 42</math> is divisible by 5 and thus <math>a \leq 3</math>. Thus, <math>n \leq 4*42 = 168 < 215</math>. |
Our answer is <math>\boxed{215}</math>. | Our answer is <math>\boxed{215}</math>. |
Revision as of 15:31, 27 February 2018
Contents
Problem
What is the largest positive integer that is not the sum of a positive integral multiple of and a positive composite integer?
Solution
The requested number must be a prime number. Also, every number that is a multiple of greater than that prime number must also be prime, except for the requested number itself. So we make a table, listing all the primes up to and the numbers that are multiples of greater than them, until they reach a composite number.
is the greatest number in the list, so it is the answer. Note that considering would have shortened the search, since , and so within numbers at least one must be divisible by .
Second Solution
Let our answer be . Write , where are positive integers and . Then note that are all primes.
If is , then because 5 is the only prime divisible by 5. We get as our largest possibility in this case.
If is , then is divisible by 5 and thus . Thus, .
If is , then is divisible by 5 and thus . Thus, .
If is , then is divisible by 5 and thus . Thus, .
If is , then is divisible by 5 and thus . Thus, .
Our answer is .
See also
1995 AIME (Problems • Answer Key • Resources) | ||
Preceded by Problem 9 |
Followed by Problem 11 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.