Difference between revisions of "2005 iTest Problems/Problem 41"
(→Solution 1) |
(→Problems) |
||
Line 9: | Line 9: | ||
1. <math>q</math> is the first prime number resulting from the sum of cubes of distinct fractions, where both the numerator and denominator are primes. | 1. <math>q</math> is the first prime number resulting from the sum of cubes of distinct fractions, where both the numerator and denominator are primes. | ||
+ | |||
2. <math>q</math> is composite. | 2. <math>q</math> is composite. | ||
+ | |||
3. <math>q</math> is composite and is the sum of the first four prime numbers and <math>1</math>. | 3. <math>q</math> is composite and is the sum of the first four prime numbers and <math>1</math>. | ||
+ | |||
4. <math>q</math> is the smallest prime equal to the difference of cubes of two consecutive primes. | 4. <math>q</math> is the smallest prime equal to the difference of cubes of two consecutive primes. | ||
+ | |||
5. <math>q</math> is not the smallest prime equal to the product of twin primes plus their arithmetic mean. | 5. <math>q</math> is not the smallest prime equal to the product of twin primes plus their arithmetic mean. | ||
+ | |||
6. The sum of <math>q</math> consecutive Fibonacci numbers, starting from the <math>q^{th}</math> Fibonacci number, is prime. | 6. The sum of <math>q</math> consecutive Fibonacci numbers, starting from the <math>q^{th}</math> Fibonacci number, is prime. | ||
+ | |||
7. <math>q</math> is the largest prime factor of <math>1bbb</math>. | 7. <math>q</math> is the largest prime factor of <math>1bbb</math>. | ||
+ | |||
8. <math>q</math> is the <math>8^{th}</math> largest prime number. | 8. <math>q</math> is the <math>8^{th}</math> largest prime number. | ||
+ | |||
9. <math>a</math> is composite. | 9. <math>a</math> is composite. | ||
+ | |||
10. <math>a + q + b = q^2</math>. | 10. <math>a + q + b = q^2</math>. | ||
+ | |||
11. The decimal expansion of <math>q^q</math> begins with <math>q</math>. | 11. The decimal expansion of <math>q^q</math> begins with <math>q</math>. | ||
+ | |||
12. <math>q</math> is the smallest prime equal to the sum of three distinct primes. | 12. <math>q</math> is the smallest prime equal to the sum of three distinct primes. | ||
+ | |||
13. <math>q^5 + q^2 + q^1 + q^3 + q^5 + q^6 + q^4 + q^0 = 52135640</math>. | 13. <math>q^5 + q^2 + q^1 + q^3 + q^5 + q^6 + q^4 + q^0 = 52135640</math>. | ||
+ | |||
14. <math>q</math> is not the smallest prime such that <math>q</math> and <math>q^2</math> have the same sum of their digits. | 14. <math>q</math> is not the smallest prime such that <math>q</math> and <math>q^2</math> have the same sum of their digits. | ||
+ | |||
15. <math>q</math> is the smallest prime such that <math>q</math> = (the product of its digits + the sum of its digits). | 15. <math>q</math> is the smallest prime such that <math>q</math> = (the product of its digits + the sum of its digits). | ||
Latest revision as of 09:51, 14 October 2025
This was a problem on the chain reaction round, where later answers in a problem depend on earlier answers.
Problems
1A. The iTest, by virtue of being the first national internet-based high school math competition, saves a lot of paper every year. The quantity of trees saved (“”) is determined by the following formula:
, where
is the number of participating students in the competition. If
is the correct answer from short answer problem 22, then find
. (1 point)
1B. Let be the sum of the digits of
. If
, find
. (2 points)
1C. Find the number of the following statements that are false: (4 points)
1. is the first prime number resulting from the sum of cubes of distinct fractions, where both the numerator and denominator are primes.
2. is composite.
3. is composite and is the sum of the first four prime numbers and
.
4. is the smallest prime equal to the difference of cubes of two consecutive primes.
5. is not the smallest prime equal to the product of twin primes plus their arithmetic mean.
6. The sum of consecutive Fibonacci numbers, starting from the
Fibonacci number, is prime.
7. is the largest prime factor of
.
8. is the
largest prime number.
9. is composite.
10. .
11. The decimal expansion of begins with
.
12. is the smallest prime equal to the sum of three distinct primes.
13. .
14. is not the smallest prime such that
and
have the same sum of their digits.
15. is the smallest prime such that
= (the product of its digits + the sum of its digits).
Solution 1
1A. Since the solution to the short answer problem 22 was (spoiler) , we can plug it in to get that
.
1B. The sum of the digits of is
. Since
is clearly going to be too large for
, as
is equal to 120, we check if
satisfies the equation. Since
, our answer for
is
.
1C.
1. False. is also such a number. It can be represented as
.
2. False. 19 is prime.
3. False. 19 is prime.
4. True, as 19 is the difference of the cubes of the two smallest primes.
5. True. Twin primes are two primes with difference two, and the smallest such pair is . Since
, this is true.
6. False. We consider each Fibonacci number's remainder when divided by 3. It repeats: . We can quickly see that the 19th Fibonacci number has a remainder of 2 when divided by 3. Therefore, the sum of the desired 19 consecutive Fibonacci has the same remainder as
when divided by
,and thus has a remainder of
when divided by 3.
7. True. Since , we are searching for the largest prime factor of
, so 19 is its largest prime factor.
8. True. 19 is the 8th largest prime number.
9. True. 469 is equal to .
10: False. We can plug in our and
values.
11: True. Using the binomial theorem, we can evaluate the first few terms of , which begins
. As the remaining terms are too small to affect the first two digits, this statement is true.
12. True. For a sum of 3 primes to be odd, the 3 primes must be odd. does not work; its sum is
. We can now try increasing any of the primes: the smallest combination that works is
, so this statement is true.
13: True. Plug in 19 for to confirm this.
14. False. Plug in all the smaller prime numbers to show that 19 is the smallest possible.
15. True. Plug in all the smaller prime numbers to prove this.
All in all, we see that exactly statements are false.
See Also
2005 iTest (Problems, Answer Key) | ||
Preceded by: Problem 40 |
Followed by: Problem 42 | |
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 • 26 • 27 • 28 • 29 • 30 • 31 • 32 • 33 • 34 • 35 • 36 • 37 • 38 • 39 • 40 • 41 • 42 • 43 • 44 • 45 • 46 • 47 • 48 • 49 • 50 • 51 • 52 • 53 • 54 • 55 • 56 • 57 • 58 • 59 • 60 • TB1 • TB2 • TB3 • TB4 |