Difference between revisions of "2007 iTest Problems/Problem 30"
(Created page with " == Problem == While working with some data for the Iowa City Hospital, James got up to get a drink of water. When he returned, his computer displayed the “blue screen of deat...") |
Rockmanex3 (talk | contribs) (Solution to Problem 30) |
||
Line 4: | Line 4: | ||
While working with some data for the Iowa City Hospital, James got up to get a drink of water. When he returned, his computer displayed the “blue screen of death” (it had crashed). While rebooting his computer, James remembered that he was nearly done with his calculations since the last time he saved his data. He also kicked himself for not saving before he got up from his desk. He had computed three positive integers <math>a, b</math>, and <math>c</math>, and recalled that their product is <math>24</math>, but he didn’t remember the values of the three integers themselves. What he really needed was their sum. He knows that the sum is an even two-digit integer less than <math>25</math> with fewer than <math>6</math> divisors. Help James by computing <math>a+b+c</math>. | While working with some data for the Iowa City Hospital, James got up to get a drink of water. When he returned, his computer displayed the “blue screen of death” (it had crashed). While rebooting his computer, James remembered that he was nearly done with his calculations since the last time he saved his data. He also kicked himself for not saving before he got up from his desk. He had computed three positive integers <math>a, b</math>, and <math>c</math>, and recalled that their product is <math>24</math>, but he didn’t remember the values of the three integers themselves. What he really needed was their sum. He knows that the sum is an even two-digit integer less than <math>25</math> with fewer than <math>6</math> divisors. Help James by computing <math>a+b+c</math>. | ||
− | == | + | Since the [[prime factorization]] of 24 is <math>2^3 \cdot 3</math>, there are only a few options that need to be tested. [[WLOG]], let <math>a \le b \le c</math>, so the possible options are <math>(1,1,24)</math>, <math>(1,2,12)</math>, <math>(1,3,8)</math>, <math>(1,4,6)</math>, <math>(2,2,6)</math>, and <math>(2,3,4)</math>. |
+ | |||
+ | Two of the conditions are that the sum is a two digit even number and the sum is less than <math>25</math>. The only options left are <math>(1,3,8)</math> with sum as <math>12</math> and <math>(2,2,6)</math> with sum as <math>10</math>. | ||
+ | |||
+ | The last condition is that the number has less than <math>6</math> divisors. Since <math>12</math> has <math>6</math> divisors and <math>10</math> has <math>4</math> divisors, James’s desired sum is <math>\boxed{\textbf{10}}</math>. | ||
+ | |||
+ | ==See Also== | ||
+ | {{iTest box|year=2007|num-b=29|num-a=31}} | ||
+ | |||
+ | [[Category:Introductory Number Theory Problems]] |
Revision as of 18:17, 10 June 2018
Problem
While working with some data for the Iowa City Hospital, James got up to get a drink of water. When he returned, his computer displayed the “blue screen of death” (it had crashed). While rebooting his computer, James remembered that he was nearly done with his calculations since the last time he saved his data. He also kicked himself for not saving before he got up from his desk. He had computed three positive integers , and , and recalled that their product is , but he didn’t remember the values of the three integers themselves. What he really needed was their sum. He knows that the sum is an even two-digit integer less than with fewer than divisors. Help James by computing .
Since the prime factorization of 24 is , there are only a few options that need to be tested. WLOG, let , so the possible options are , , , , , and .
Two of the conditions are that the sum is a two digit even number and the sum is less than . The only options left are with sum as and with sum as .
The last condition is that the number has less than divisors. Since has divisors and has divisors, James’s desired sum is .
See Also
2007 iTest (Problems, Answer Key) | ||
Preceded by: Problem 29 |
Followed by: Problem 31 | |
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 |