Difference between revisions of "2008 iTest Problems"
(Phew I need to go to bed now...) |
Boppitybobii (talk | contribs) m (→Problem 31) |
||
| (68 intermediate revisions by 17 users not shown) | |||
| Line 1: | Line 1: | ||
==Problem 1== | ==Problem 1== | ||
| + | Jerry and Hannah Kubik live in Jupiter Falls with their five children. Jerry works as a Renewable Energy Engineer for the Southern Company, and Hannah runs a lab at Jupiter Falls University where she researches biomass (renewable fuel) conversion rates. Michael is their oldest child, and Wendy their oldest daughter. Tony is the youngest child. Twins Joshua and Alexis are <math>12</math> years old. | ||
| + | |||
| + | When the Kubiks went on vacation to San Diego last year, they spent a day at the San Diego Zoo. | ||
| + | Single-day passes cost <math>\textdollar{33}</math> for adults (Jerry and Hannah), <math>\textdollar{22}</math> for children | ||
| + | (Michael is still young enough to get the children's rate), and family memberships | ||
| + | (which allow the whole family in at once) cost <math>\textdollar{120}</math>. How many dollars did the family save by buying a family pass over buying single day passes for every member of the family? | ||
| + | |||
| + | [[2008 iTest Problems/Problem 1|Solution]] | ||
==Problem 2== | ==Problem 2== | ||
| + | |||
| + | One day while Tony plays in the back yard of the Kubik's home, he wonders about the width of the back yard, which is in the shape of a rectangle. A row of trees spans the width of the back of the yard by the fence, and Tony realizes that all the trees have almost exactly the same diameter, and the trees look equally spaced. Tony fetches a tape measure from the garage and measures a distance of almost exactly <math>12</math> feet between a consecutive pair of trees. Tony realizes the need to include the width of the trees in his measurements. Unsure as to how to do this, he measures the distance between the centers of the trees, which comes out to be around <math>15</math> feet. He then measures <math>2</math> feet to either side of the first and last trees in the row before the ends of the yard. Tony uses these measurements to estimate the width of the yard. If there are six trees in the row of trees, what is Tony's estimate in feet? | ||
| + | |||
| + | <asy> | ||
| + | size(350); | ||
| + | defaultpen(linewidth(0.8)); | ||
| + | draw((0,-3)--(0,3)); | ||
| + | int d=8; | ||
| + | for(int i=0;i<=5;i=i+1) | ||
| + | { | ||
| + | draw(circle(7/2+d*i,3/2)); | ||
| + | } | ||
| + | draw((5*d+7,-3)--(5*d+7,3)); | ||
| + | draw((0,0)--(2,0),Arrows(size=7)); | ||
| + | draw((5,0)--(2+d,0),Arrows(size=7)); | ||
| + | draw((7/2+d,0)--(7/2+2*d,0),Arrows(size=7)); | ||
| + | label("$2$",(1,0),S); | ||
| + | label("$12$",((7+d)/2,0),S); | ||
| + | label("$15$",((7+3*d)/2,0),S);</asy> | ||
| + | |||
| + | [[2008 iTest Problems/Problem 2|Solution]] | ||
==Problem 3== | ==Problem 3== | ||
| + | Michael plays catcher for his school's baseball team. He has always been a great player behind the plate, but this year as a junior, Michael's offense is really improving. | ||
| + | His batting average is <math>.417</math> after six games, and the team is <math>6-0</math> (six wins and no losses). They are off to their best start in years. | ||
| + | |||
| + | On the way home from their sixth game, Michael notes to his father that the attendance seems to be increasing due to the team's great start, "There were <math>181</math> | ||
| + | people at the first game, then <math>197</math> at the second, <math>203</math> the third, <math>204</math> the fourth, <math>212</math> at the fifth, and there were <math>227</math> at today's game." Just then, Michael's | ||
| + | genius younger brother Tony, just seven-years-old, computes the average attendance of the six games. What is their average? | ||
| + | |||
| + | [[2008 iTest Problems/Problem 3|Solution]] | ||
==Problem 4== | ==Problem 4== | ||
| + | |||
| + | The difference between two prime numbers is <math>11</math>. Find their sum. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 4|Solution]] | ||
==Problem 5== | ==Problem 5== | ||
| + | |||
| + | Jerry recently returned from a trip to South America where he helped two old factories reduce pollution output by installing more modern scrubber equipment. | ||
| + | Factory A previously filtered <math>80</math>% of pollutants and Factory <math>B</math> previously filled <math>72</math>% of pollutants. After installing the new scrubber system, both factories now | ||
| + | filter <math>99.5</math>% of pollutants. | ||
| + | |||
| + | Jerry explains the level of pollution reduction to Michael, "Factory <math>A</math> is the much larger factory. It's four times as large as Factory <math>B</math>. Without any filters at all, | ||
| + | it would pollute four times as much as Factory <math>B</math>. Even with the better pollution filtration system, Factory <math>A</math> was polluting nearly three times as much as Factory B." | ||
| + | |||
| + | Assuming the factories are the same in every way except size and previous percentage of pollution filtered, find <math>a+b</math> where <math>a/b</math> is the ratio in lowest | ||
| + | terms of volume of pollutants unfiltered from both factories <math>\textit{after}</math> installation of the new scrubber system to the volume of pollutants unfiltered | ||
| + | from both factories <math>\textit{before}</math> installation of the new scrubber system. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 5|Solution]] | ||
==Problem 6== | ==Problem 6== | ||
| + | Let <math>L</math> be the length of the altitude to the hypotenuse of a right triangle with legs <math>5</math> and <math>12</math>. Find the least integer greater than <math>L</math>. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 6|Solution]] | ||
==Problem 7== | ==Problem 7== | ||
| + | Find the number of integers <math>n</math> for which <math>n^2 + 10n < 2008</math>. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 7|Solution]] | ||
| + | |||
| + | == Problem 8 == | ||
| − | ==Problem 8 | + | The math team at Jupiter Falls Middle School meets together twice a month during the summer, and the math team coach, Mr. Fischer, prepares some Olympics-themed problems for his students. One of the problems Joshua and Alexis work on boils down to a system of equations: |
| + | |||
| + | <center><math>2x + 3y + 3z = 8</math>, | ||
| + | <math>3x + 2y + 3z = 808</math>, | ||
| + | <math>3x + 3y + 2z = 80808</math>,</center> | ||
| + | find <math>x+y+z</math>. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 8|Solution]] | ||
==Problem 9== | ==Problem 9== | ||
| + | |||
| + | Joshua likes to play with numbers and patterns. Joshua's favorite number is <math>6</math> because it is the units digit of his birth year, <math>1996</math>. | ||
| + | Part of the reason Joshua likes the number 6 so much is that the powers of <math>6</math> all have the same units digit as they grow from <math>6^1</math>: | ||
| + | <cmath>\begin{align*}6^1&=6,\\6^2&=36,\\6^3&=216,\\6^4&=1296,\\6^5&=7776,\\6^6&=46656,\\\vdots\end{align*}</cmath> | ||
| + | However, not all units digits remain constant when exponentiated in this way. One day Joshua asks Michael if there are | ||
| + | simple patterns for the units digits when each one-digit integer is exponentiated in the manner above. Michael responds, | ||
| + | "You tell me!" Joshua gives a disappointed look, but then Michael suggests that Joshua play around with some numbers | ||
| + | and see what he can discover. "See if you can find the units digit of <math>2008^{2008}</math>," Michael challenges. After a little while, | ||
| + | Joshua finds an answer which Michael confirms is correct. What is Joshua's correct answer (the units digit of <math>2008^{2008}</math>)? | ||
| + | |||
| + | |||
| + | [[2008 iTest Problems/Problem 9|Solution]] | ||
==Problem 10== | ==Problem 10== | ||
| + | |||
| + | Tony has an old sticky toy spider that very slowly goes down a wall after being stuck to the wall. In fact, left untouched, the toy spider crawls down at a rate of one inch for every two hours it's left stuck to the wall. One morning, at around <math>9</math> o' clock, Tony sticks the spider to the wall in the living room three feet above the floor. Over the next few mornings, Tony moves the spider up three feet from the point where he finds it. If the wall in the living room is <math>18</math> feet high, after how many days (days after the first day Tony places the spider on the wall) will Tony run out of room to place the spider three feet higher? | ||
| + | |||
| + | [[2008 iTest Problems/Problem 10|Solution]] | ||
==Problem 11== | ==Problem 11== | ||
| + | After moving his sticky toy spider one morning, Tony heads outside to play "pirates" with his pal Nick, who lives a few doors down the street from the Kubiks. Tony and Nick imagine themselves as pirates in a rough skirmish over a chest of gold. Victorious over their foes, Tony and Nick claim the prize. However, they must split some of the gold with their crew, which they imagine consists of eight other bloodthirsty pirates. Each of the pirates receives at least one gold coin, but none receive the same number of coins, then Tony and Nick split the remainder equally. If there are <math>2000</math> gold coins in the chest, what is the greatest number of gold coins Tony could take as his share? (Assume each gold coin is equally valuable.) | ||
| + | |||
| + | [[2008 iTest Problems/Problem 11|Solution]] | ||
==Problem 12== | ==Problem 12== | ||
| + | One day while the Kubik family attends one of Michael's baseball games, Tony gets bored and walks to the creek a few yards behind the baseball field. One of Tony's classmates | ||
| + | Mitchell sees Tony and goes to join him. While playing around the creek, the two boys find an ordinary six-sided die buried in sediment. Mitchell washes it off in the water and | ||
| + | challenges Tony to a contest. Each of the boys rolls the die exactly once. Mitchell's roll is <math>3</math> higher than Tony's. "Let's play once more," says Tony. Let <math>a/b</math> be the probability | ||
| + | that the difference between the outcomes of the two dice is again exactly <math>3</math> (regardless of which of the boys rolls higher), where a and b are relatively prime positive | ||
| + | integers. Find <math>a+b</math>. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 12|Solution]] | ||
==Problem 13== | ==Problem 13== | ||
| + | |||
| + | In preparation for the family's upcoming vacation, Tony puts together five bags of jelly beans, one bag for each day of the trip, with an equal number of jelly beans in each bag. | ||
| + | Tony then pours all the jelly beans out of the five bags and begins making patterns with them. One of the patterns that he makes has one jelly bean in a top row, three jelly | ||
| + | beans in the next row, five jelly beans in the row after that, and so on: | ||
| + | |||
| + | <cmath> \begin{array}{ccccccccc}&&&&*&&&&\\&&&*&*&*&&&\\&&*&*&*&*&*&&\\&*&*&*&*&*&*&*&\\ *&*&*&*&*&*&*&*&*\\&&&&\vdots&&&&\end{array} </cmath> | ||
| + | |||
| + | Continuing in this way, Tony finishes a row with none left over. For instance, if Tony had exactly <math>25</math> jelly beans, he could finish the fifth row above with no jelly beans left over. However, when Tony finishes, there are between <math>10</math> and <math>20</math> rows. Tony then scoops all the jelly beans and puts them all back into the five bags so that each bag once again contains the same number. How many jelly beans are in each bag? (Assume that no jelly bean gets put inside more than one bag.) | ||
| + | |||
| + | [[2008 iTest Problems/Problem 13|Solution]] | ||
==Problem 14== | ==Problem 14== | ||
| + | The sum of the two perfect cubes that are closest to <math>500</math> is <math>343+512 = 855</math>. Find the sum of the two perfect cubes that are closest to <math>2008</math>. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 14|Solution]] | ||
==Problem 15== | ==Problem 15== | ||
| + | How many four-digit multiples of <math>8</math> are greater than <math>2008</math>? | ||
| + | |||
| + | [[2008 iTest Problems/Problem 15|Solution]] | ||
==Problem 16== | ==Problem 16== | ||
| + | |||
| + | In order to encourage the kids to straighten up their closets and the storage shed, Jerry offers his kids some extra spending money for their upcoming vacation. "I don't care what you do, I just want to see everything look clean and organized." | ||
| + | |||
| + | While going through his closet, Joshua finds an old bag of marbles that are either blue or red. The ratio of blue to red marbles in the bag is <math>17:7</math>. Alexis also has some marbles of the same colors, but hasn't used them for anything in years. She decides to give Joshua her marbles to put in his marble bag so that all the marbles are in one place. Alexis has twice as many red marbles as blue marbles, and when the twins get all their marbles in one bag, there are exactly as many red marbles and blue marbles, and the total number of marbles is between <math>200</math> and <math>250</math>. How many total marbles do the twins have together? | ||
| + | |||
| + | [[2008 iTest Problems/Problem 16|Solution]] | ||
| + | |||
| + | <math>Good</math> <math>Luck!</math> | ||
==Problem 17== | ==Problem 17== | ||
| + | |||
| + | One day when Wendy is riding her horse Vanessa, they get to a field where some tourists are following Martin (the tour guide) on some horses. Martin and some of the workers at the stables are each leading extra horses, so there are more horses than people. Martin's dog Berry runs around near the trail as well. Wendy counts a total of <math>28</math> heads belonging to the people, horses, and dog. She counts a total of <math>92</math> legs belonging to everyone, and notes that nobody is missing any legs. | ||
| + | |||
| + | Upon returning home Wendy gives Alexis a little problem solving practice, "I saw <math>28</math> heads and <math>92</math> legs belonging to people, horses, and dogs. Assuming two legs per person and four for the other animals, how many people did I see?" Alexis scribbles out some algebra and answers correctly. What is her answer? | ||
| + | |||
| + | [[2008 iTest Problems/Problem 17|Solution]] | ||
==Problem 18== | ==Problem 18== | ||
| + | Find the number of lattice points that the line <math>19x+20y = 1909</math> passes through in Quadrant I. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 18|Solution]] | ||
==Problem 19== | ==Problem 19== | ||
| + | Let <math>A</math> be the set of positive integers that are the product of two consecutive integers. Let <math>B</math> be the set of positive integers that are the product of three consecutive integers. Find the sum of the two smallest elements of <math>A \cap B</math>. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 19|Solution]] | ||
==Problem 20== | ==Problem 20== | ||
| + | |||
| + | In order to earn a little spending money for the family vacation, Joshua and Wendy offer to clean up the storage shed. After clearing away some trash, Joshua and Wendy set aside give boxes that belong to the two of them that they decide to take up to their bedrooms. Each is in the shape of a cube. The four smaller boxes are all of equal size, and when stacked up, reach the exact height of the large box. If the volume of one of the smaller boxes is <math>216</math> cubic inches, find the sum of the volumes of all five boxes (in cubic inches). | ||
| + | |||
| + | [[2008 iTest Problems/Problem 20|Solution]] | ||
==Problem 21== | ==Problem 21== | ||
| + | |||
| + | One of the boxes that Joshua and Wendy unpack has Joshua's collection of board games. Michael, Wendy, Alexis, and Joshua decide to play one of them, a game called Risk that involves rolling ordinary six-sided dice to determine the outcomes of strategic battles. Wendy has never played before, so early on Michael explains a bit of strategy. | ||
| + | |||
| + | "You have the first move and you occupy three of the four territories in the Australian continent. You'll want to attack Joshua in Indonesia so that you can claim the Australian continent which will give you bonus armies on your next turn." | ||
| + | |||
| + | "Don't tell her that!" complains Joshua. | ||
| + | |||
| + | Wendy and Joshua begin rolling dice to determine the outcome of their struggle over Indonesia. Joshua rolls extremely well, overcoming longshot odds to hold off Wendy's attack. Finally, Wendy is left with one chance. Wendy and Joshua each roll just one six-sided die. Wendy wins if her roll is higher than Joshua's roll. Let a and b be relatively prime positive integers so that <math>a/b</math> is the probability that Wendy rolls higher, giving her control over the continent of Australia. Find the value of <math>a+b</math>. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 21|Solution]] | ||
==Problem 22== | ==Problem 22== | ||
| + | Tony plays a game in which he takes <math>40</math> nickels out of a roll and tosses them one at a time toward his desk where his change jar sits. He awards himself <math>5</math> points for each nickel that lands in the jar, and takes away <math>2</math> points from his score for each nickel that hits the ground. After Tony is done tossing all <math>40</math> nickels, he computes <math>88</math> as his score. Find the greatest number of nickels he could have successfully tossed into the jar. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 22|Solution]] | ||
==Problem 23== | ==Problem 23== | ||
| + | Find the number of positive integers <math>n</math> that are solutions to the simultaneous system of inequalities | ||
| + | |||
| + | <center><math>4n-18 < 2008</math></center> | ||
| + | |||
| + | <center><math>7n + 17 > 2008</math>.</center> | ||
| + | |||
| + | [[2008 iTest Problems/Problem 23|Solution]] | ||
==Problem 24== | ==Problem 24== | ||
| + | |||
| + | In order to earn her vacation spending money, Alexis helped her mother remove weeds from the garden. When she was done, she came into the house to put away her gardening gloves and change into clean clothes. | ||
| + | |||
| + | On her way to her room she notices Joshua with his face to the floor in the family room, looking pretty silly. "Josh, did you know you lose IQ points for sniffing the carpet?" | ||
| + | |||
| + | "Shut up. I'm not sniffing the carpet. I'm doing something." | ||
| + | |||
| + | "Sure, if sniffing the carpet counts as doing something." At this point Alexis stands over her twin brother grinning, trying to see how silly she can make him feel. | ||
| + | |||
| + | Joshua climbs to his feet and stands on his toes to make himself a half inch taller than his sister, who is ordinarily a half inch taller than Joshua. "I'm measuring something. I'm designing something." | ||
| + | |||
| + | Alexis stands on her toes too, reminding her brother that she is still taller than he. "When you're done, can you design me a dress?" | ||
| + | |||
| + | "Very funny." Joshua walks to the table and points to some drawings. "I'm designing the sand castle I want to build at the beach. Everything needs to be measured out so that I can build something awesome." | ||
| + | |||
| + | "And this requires sniffing carpet?" inquires Alexis, who is just a little intrigued by her brother's project. | ||
| + | |||
| + | "I was imagining where to put the base of a spiral staircase. Everything needs to be measured out correctly. See, the castle walls will be in the shape of a rectangle, like this room. The center of the staircase will be <math>9</math> inches from one of the corners, <math>15</math> inches from another, 16 inches from another, and some whole number of inches from the furthest corner." Joshua shoots Alexis a wry smile. The twins liked to challenge each other, and Alexis knew she had to find the distance from the center of the staircase to the fourth corner of the castle on her own, or face Joshua's pestering, which might last for hours or days. | ||
| + | |||
| + | Find the distance from the center of the staircase to the furthest corner of the rectangular castle, assuming all four of the distances to the corners are described as distances on the same plane (the ground). | ||
| + | |||
| + | [[2008 iTest Problems/Problem 24|Solution]] | ||
==Problem 25== | ==Problem 25== | ||
| + | A cube has edges of length <math>120</math> cm. The cube gets chopped up into some number of smaller cubes, all of equal size, such that each edge of one of the smaller cubes has an integer length. One of those smaller cubes is then chopped up into some number of even smaller cubes, all of equal size. If the edge length of one of those even smaller cubes is <math>n</math> cm, where <math>n</math> is an integer, find the number of possible values of <math>n</math>. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 25|Solution]] | ||
==Problem 26== | ==Problem 26== | ||
| + | |||
| + | Done working on his sand castle design, Joshua sits down and starts rolling a <math>12</math>-sided die he found when cleaning the storage shed. He rolls and rolls and rolls, and after <math>17</math> rolls he finally rolls a <math>1</math>. Just <math>3</math> rolls later he rolls the first 2 <math>\textit{ after}</math> that first roll of <math>1</math>. <math>11</math> rolls later, Joshua rolls the first <math>3\textit{ after}</math> the first <math> 2</math> that he rolled <math>\textit{after}</math> the first <math>1</math> that he rolled. His first <math>31</math> rolls make the sequence <math>4,3,11,3,11,8,5,2,12,9,5,7,11,3,6,10,\textbf{1},8,3,\textbf{2},10,4,2,8,1,9,7,12,11,4,\textbf{3}</math>. | ||
| + | Joshua wonders how many times he should expect to roll the <math>12</math>-sided die so that he can remove all but <math>12</math> of the numbers from the entire sequence of rolls and (without changing the order of the sequence), be left with the sequence <math>1,2,3,4,5,6,7,8,9,10,11,12</math>. What is the expected value of the number of times Joshua must roll the die before he has such a sequence? (Assume Joshua starts from the beginning - do <math>\textit{not}</math> assume he starts by rolling the specific sequence of <math>31</math> rolls above.) | ||
| + | |||
| + | [[2008 iTest Problems/Problem 26|Solution]] | ||
==Problem 27== | ==Problem 27== | ||
| + | Hannah Kubik leads a local volunteer group of thirteen adults that takes turns holding classes for patients at the Children’s Hospital. At the end of August, Hannah took a tour of the hospital and talked with some members of the staff. Dr. Yang told Hannah that it looked like there would be more girls than boys in the hospital during September. The next day Hannah brought the volunteers together and it was decided that three women and two men would volunteer to run the September classes at the Children’s Hospital. If there are exactly six women in the volunteer group, how many combinations of three women and two men could Hannah choose from the volunteer group to run the classes? | ||
| + | |||
| + | [[2008 iTest Problems/Problem 27|Solution]] | ||
==Problem 28== | ==Problem 28== | ||
| + | Of the thirteen members of the volunteer group, Hannah selects herself, Tom Morris, Jerry Hsu, Thelma Paterson, and Louise Bueller to teach the September classes. When she is done, she decides that it's not necessary to balance the number of female and male teachers with the proportions of girls and boys at the hospital <math>\textit{every}</math> month, and having half the women work while only <math>2</math> of the <math>7</math> men work on some months means that some of the women risk getting burned out. After all, nearly all the members of the volunteer group have other jobs. | ||
| + | |||
| + | Hannah comes up with a plan that the committee likes. Beginning in October, the committee of five volunteer teachers will consist of any five members of the volunteer group, | ||
| + | so long as there is at least one woman and at least one man teaching each month. Under this new plan, what is the least number of months that <math>\textit{must}</math> go by | ||
| + | (including October when the first set of five teachers is selected, but not September) such that some five-member committee <math>\textit{must have}</math> taught together twice | ||
| + | (all five members are the same during two different months)? | ||
| + | |||
| + | [[2008 iTest Problems/Problem 28|Solution]] | ||
==Problem 29== | ==Problem 29== | ||
| + | Find the number of ordered triplets <math>(a,b,c)</math> of positive integers such that <math>abc=2008</math> (the product of <math>a, b</math>, and <math>c</math> is <math>2008</math>). | ||
| + | |||
| + | [[2008 iTest Problems/Problem 29|Solution]] | ||
==Problem 30== | ==Problem 30== | ||
| + | Find the number of ordered triplets <math>(a,b,c)</math> of positive integers such that <math>a<b<c</math> and <math>abc=2008</math>. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 30|Solution]] | ||
==Problem 31== | ==Problem 31== | ||
| + | |||
| + | The <math>n^\text{th}</math> term of a sequence is <math>a_n=(-1)^n(4n+3)</math>. Compute the sum <math>a_1+a_2+a_3+\cdots+a_{2008}</math>. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 31|Solution]] | ||
==Problem 32== | ==Problem 32== | ||
| + | A right triangle has perimeter <math>2008</math>, and the area of a circle inscribed in the triangle is <math>100\pi^3</math>. Let A be the area of the triangle. Compute <math>\lfloor A\rfloor</math>. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 32|Solution]] | ||
==Problem 33== | ==Problem 33== | ||
| + | |||
| + | One night, over dinner Jerry poses a challenge to his younger children: "Suppose we travel <math>50</math> miles per hour while heading to our final vacation destination..." | ||
| + | Hannah teases her husband, "You <math>\textit{would}</math> drive that <math>\textit{slowly}\text{!}</math>" | ||
| + | |||
| + | Jerry smirks at Hannah, then starts over, "So that we get a good view of all the beautiful landscape your mother likes to photograph from the passenger's seat, we | ||
| + | travel at a constant rate of <math>50</math> miles per hour on the way to the beach. However, on the way back we travel at a faster constant rate along the exact same route. | ||
| + | If our faster return rate is an integer number of miles per hour, and our average speed for the <math>\textit{whole round trip}</math> is <math>\textit{also}</math> an integer number of | ||
| + | miles per hour, what must be our speed during the return trip?" | ||
| + | Michael pipes up, "How about <math>4950</math> miles per hour?!" | ||
| + | Wendy smiles, "For the sake of your <math>\textit{other}</math> children, please don't let <math>\textit{Michael}</math> drive." | ||
| + | Jerry adds, "How about we assume that we never <math>\textit{ever}</math> drive more than <math>100 </math> miles per hour. Michael and Wendy, let Josh and Alexis try this one." | ||
| + | Joshua ignores the problem in favor of the huge pile of mashed potatoes on his plate. | ||
| + | But Alexis scribbles some work on her napkin and declares the correct answer. What answer did Alexis find? | ||
| + | |||
| + | [[2008 iTest Problems/Problem 33|Solution]] | ||
==Problem 34== | ==Problem 34== | ||
| + | While entertaining his younger sister Alexis, Michael drew two different cards from an ordinary deck of playing cards. Let a be the probability that the cards are of different ranks. Compute <math>\lfloor 1000a\rfloor</math>. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 34|Solution]] | ||
==Problem 35== | ==Problem 35== | ||
| + | Let <math>b</math> be the probability that the cards are from different suits. Compute <math>\lfloor1000b\rfloor</math>. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 35|Solution]] | ||
==Problem 36== | ==Problem 36== | ||
| + | Let <math>c</math> be the probability that the cards are neither from the same suit or the same rank. Compute <math>\lfloor 1000c\rfloor</math>. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 36|Solution]] | ||
==Problem 37== | ==Problem 37== | ||
| + | A triangle has sides of length <math>48, 55</math>, and <math>73</math>. Let a and b be relatively prime positive integers such that <math>a/b</math> is the length of the shortest altitude of the triangle. | ||
| + | Find the value of <math>a+b</math>. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 37|Solution]] | ||
==Problem 38== | ==Problem 38== | ||
| + | The volume of a certain rectangular solidis <math>216\text{ cm}^3</math>, its total surface area is <math>288\text{ cm}^2</math>, and its three dimensions are in | ||
| + | geometric progression. Find the sum of the lengths in cm of all the edges of this solid. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 38|Solution]] | ||
==Problem 39== | ==Problem 39== | ||
| + | Let <math>\phi(n)</math> denote <math>\textit{Euler's phi function}</math>, the number of integers <math>1\leq i\leq n</math> that are relatively prime to <math>n</math>. (For example, <math>\phi(6)=2</math> and <math>\phi(10)=4</math>.) | ||
| + | Let <math>S=\sum_{d|2008}\phi(d)</math>, in which <math>d</math> ranges through all positive divisors of <math>2008</math>, including <math>1</math> and <math>2008</math>. Find the remainder when <math>S</math> is divided by <math>1000</math>. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 39|Solution]] | ||
==Problem 40== | ==Problem 40== | ||
| + | Find the number of integers n that satisfy <math>\textit{both}</math> of the following conditions: | ||
| + | <math>208<n<2008</math>, | ||
| + | n has the same remainder when divided by <math>24</math> or by <math>30</math>. | ||
| + | |||
| + | |||
| + | [[2008 iTest Problems/Problem 40|Solution]] | ||
==Problem 41== | ==Problem 41== | ||
| + | |||
| + | Suppose that <math>x_1+1=x_2+2=x_3+3=\cdots=x_{2008}+2008=x_1+x_2+x_3+\cdots+x_{2008}+2009</math>. | ||
| + | Find the value of <math>\left\lfloor|S|\right\rfloor</math>, where <math>S=\sum_{n=1}^{2008}x_n</math>. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 41|Solution]] | ||
==Problem 42== | ==Problem 42== | ||
| + | Joshua's physics teacher, Dr. Lisi, lives next door to the Kubiks and is a long time friend of the family. An unusual fellow, Dr. Lisi spends as much time surfing | ||
| + | and raising chickens as he does trying to map out a <math>\textit{Theory of Everything}</math>. Dr. Lisi often poses problems to the Kubik children to challenge them to | ||
| + | think a little deeper about math and science. One day while discussing sequences with Joshua, Dr. Lisi writes out the first <math>2008</math> terms of an arithmetic | ||
| + | progression that begins <math>-1776,-1765,-1754,\ldots</math>. Joshua then computes the (positive) difference between the <math>1980^\text{th}</math> term in the sequence, | ||
| + | and the <math>1977^\text{th}</math> term in the sequence. What number does Joshua compute? | ||
| + | |||
| + | [[2008 iTest Problems/Problem 42|Solution]] | ||
==Problem 43== | ==Problem 43== | ||
| + | Alexis notices Joshua working with Dr. Lisi and decides to join in on the fun. Dr. Lisi challenges her to compute the sum of all <math>2008</math> terms in the sequence. | ||
| + | Alexis thinks about the problem and remembers a story one of her teachers at school taught her about how a young Karl Gauss quickly computed the sum | ||
| + | <math>1+2+3+\cdots+98+99+100</math> in elementary school. Using Gauss's method, Alexis correctly finds the sum of the <math>2008</math> terms in Dr. Lisi's sequence. What is this sum? | ||
| + | |||
| + | [[2008 iTest Problems/Problem 43|Solution]] | ||
==Problem 44== | ==Problem 44== | ||
| + | Now Wendy wanders over and joins Dr. Lisi and her younger siblings. Thinking she knows everything there is about how to work with arithmetic series, she nearly turns right around to walk back home when Dr. Lisi poses a more challenging problem. "Suppose I select two distinct terms at random from the <math>2008</math> term sequence. What's the probability that their product is positive?" If <math>a</math> and <math>b</math> are relatively prime positive integers such that <math>a/b</math> is the probability that the product of the two terms is positive, find the value of <math>a+b</math>. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 44|Solution]] | ||
==Problem 45== | ==Problem 45== | ||
| + | |||
| + | In order to save money on gas and use up less fuel, Hannah has a special battery installed in the family van. Before the installation, the van averaged <math>18</math> miles per gallon of gas. After the conversion, the van got <math>24</math> miles per gallon of gas. | ||
| + | |||
| + | Michael notes, "The amount of money we will save on gas over any time period is equal to the amount we would save if we were able to convert the van to go from <math>24</math> miles per gallon to m miles per gallon. It is also the same that we would save if we were able to convert the van to go from m miles per gallon to <math>n</math> miles per gallon." | ||
| + | |||
| + | Assuming Michael is correct, compute <math>m+n</math>. In this problem, assume that gas mileage is constant over all speeds and terrain and that the van gets used the same amount regardless of its present state of conversion. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 45|Solution]] | ||
==Problem 46== | ==Problem 46== | ||
| + | |||
| + | Let <math>S</math> be the sum of all <math>x</math> in the interval <math>[0,2\pi)</math> that satisfy <math>\tan^2 x - 2\tan x\sin x=0</math>. Compute <math>\lfloor10S\rfloor</math>. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 46|Solution]] | ||
==Problem 47== | ==Problem 47== | ||
| + | Find <math>a + b + c</math>, where <math>a</math>, <math>b</math>, and <math>c</math> are the hundreds, tens, and units digits of the six-digit integer | ||
| + | <math>123abc</math>, which is a multiple of <math>990</math>. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 47|Solution]] | ||
==Problem 48== | ==Problem 48== | ||
| + | |||
| + | A repunit is a natural number whose digits are all <math>1</math>. For instance, | ||
| + | |||
| + | <cmath>1,11,111,1111, \ldots</cmath> | ||
| + | |||
| + | are the four smallest repunits. How many digits are there in the smallest repunit that is | ||
| + | divisible by <math>97</math>? | ||
| + | |||
| + | [[2008 iTest Problems/Problem 48|Solution]] | ||
==Problem 49== | ==Problem 49== | ||
| + | Wendy takes Honors Biology at school, a smallish class with only fourteen students (including Wendy) who sit around a circular table. Wendy’s friends Lucy, Starling, and Erin are also in that class. Last Monday none of the fourteen students were absent from class. Before the teacher arrived, Lucy and Starling stretched out a blue piece of yarn between them. Then Wendy and Erin stretched out a red piece of yarn between them at about the same height so that the yarns would intersect if possible. If all possible positions of the students around the table are equally likely, let <math>m/n</math> be the probability that the yarns intersect, where <math>m</math> and <math>n</math> are relatively prime positive integers. Compute <math>m + n</math>. | ||
| + | [[2008 iTest Problems/Problem 49|Solution]] | ||
==Problem 50== | ==Problem 50== | ||
| + | |||
| + | As the Kubiks head out of town for vacation, Jerry takes the first driving shift while Hannah and most of the kids settle down to read books they brought along. Tony does not feel like reading, so Alexis gives him one of her math notebooks and Tony gets to work solving some of the problems, and struggling over others. After a while, Tony comes to a problem he likes from an old AMC 10 exam: | ||
| + | |||
| + | ''Four distinct circles are drawn in a plane. What is the maximum number of points where at least two of the circles intersect?'' | ||
| + | |||
| + | Tony realizes that he can draw the four circles such that each pair of circles intersects in two points. After careful doodling, Tony finds the correct answer, and is proud that he can solve a problem from late on an AMC 10 exam. | ||
| + | |||
| + | "Mom, why didn't we all get Tony's brain?" Wendy inquires before turning he head back into her favorite Harry Potter volume (the fifth year). | ||
| + | |||
| + | Joshua leans over to Tony's seat to see his brother's work. Joshua knows that Tony has not yet discovered all the underlying principles behind the problem, so Joshua challenges, "What if there are a dozen circles?" | ||
| + | |||
| + | Tony gets to work on Joshua's problem of finding the maximum number of points of intersections where at least two of the twelve circles in a plane intersect. What is the answer to this problem? | ||
| + | |||
| + | [[2008 iTest Problems/Problem 50|Solution]] | ||
==Problem 51== | ==Problem 51== | ||
| + | |||
| + | Alexis imagines a <math>2008 \times 2008</math> grid of integers arranged sequentially in the following way: | ||
| + | |||
| + | <cmath>\begin{array}{r@{\hspace{20pt}}r@{\hspace{20pt}}r@{\hspace{20pt}}r@{\hspace{20pt}}r}1,&2,&3,&\ldots,&2008\\2009,&2010,&2011,&\ldots,&4026\\4017,&4018,&4019,&\ldots,&6024\\\vdots&&&&\vdots\\2008^2-2008+1,&2008^2-2008+2,&2008^2-2008+3,&\ldots,&2008^2\end{array}</cmath> | ||
| + | |||
| + | She picks one number from each row so that no two numbers she picks are in the same column. She them proceeds to add them together and finds that <math>S</math> is the sum. Next, she picks <math>2008</math> of the numbers that are distinct from the <math>2008</math> she picked the first time. Again she picks exactly one number from each row and column, and again the sum of all <math>2008</math> numbers is <math>S</math>. Find the remainder when <math>S</math> is divided by <math>2008</math>. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 51|Solution]] | ||
==Problem 52== | ==Problem 52== | ||
| + | A triangle has sides of length <math>48, 55</math>, and <math>73</math>. A square is inscribed in the triangle such that one side of the square lies on the longest side of the triangle, and the two vertices not on that side of the square touch the other two sides of the triangle. If <math>c</math> and <math>d</math> are relatively prime positive integers such that <math>c/d</math> is the length of a side of the square, find the value of <math>c + d</math>. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 52|Solution]] | ||
==Problem 53== | ==Problem 53== | ||
| + | |||
| + | Find the sum of the <math>2007</math> roots of <math>(x-1)^{2007}+2(x-2)^{2006}+3(x-3)^{2005}+\cdots+2006(x-2006)^2+2007(x-2007)</math>. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 53|Solution]] | ||
==Problem 54== | ==Problem 54== | ||
| + | One of Michael’s responsibilities in organizing the family vacation is to call around and find room rates for hotels along the route the Kubik family plans to drive. While calling hotels near the Grand Canyon, a phone number catches Michael’s eye. Michael notices that the first four digits of <math>987-1234 </math> descend <math>(9-8-7-1)</math> and that the last four ascend in order <math>(1-2-3-4)</math>. This fact along with the fact that the digits are split into consecutive groups makes that number easier to remember. Looking back at the list of numbers that Michael called already, he notices that several of the phone numbers have the same property: their first four digits are in descending order while the last four are in ascending order. Suddenly, Michael realizes that he can remember all those numbers without looking back at his list of hotel phone numbers. “Wow,” he thinks, “that’s good marketing strategy.” Michael then wonders to himself how many businesses in a single area code could have such phone numbers. How many <math>7</math>-digit telephone numbers are there such that all seven digits are distinct, the first four digits are in descending order, and the last four digits are in ascending order? | ||
| + | |||
| + | [[2008 iTest Problems/Problem 54|Solution]] | ||
==Problem 55== | ==Problem 55== | ||
| + | Let <math>\triangle XOY</math> be a right-angled triangle with <math>\angle XOY=90^\circ</math>. Let <math>M</math> and <math>N</math> be the midpoints of legs <math>OX</math> and <math>OY</math>, respectively. Find the length <math>XY</math> given that | ||
| + | <math>XN=22</math> and <math>YM=31</math>. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 55|Solution]] | ||
==Problem 56== | ==Problem 56== | ||
| + | |||
| + | During the van ride from the Grand Canyon to the beach, Michael asks his dad about the costs of renewable energy resources. "How much more does it really cost for a family like ours to switch entirely to renewable energy?" | ||
| + | |||
| + | Jerry explains, "Part of that depends on where the family lives. In the Western states, solar energy pays off more than it does where we live in the Southeast. But as technology gets better, costs of producing more photovoltaic power go down, so in just a few years more people will have reasonably inexpensive options for switching to cleaner power sources. Even now most families could switch to biomass for between <math>\textdollar{200}</math> and <math>\textdollar{1000}</math> per year. The energy comes from sawdust, switch-grass, and even landfill gas. We pay that premium ourselves, but some families operate on a tighter budget, or don't understand the alternatives yet." | ||
| + | |||
| + | "Ew, landfill gas!" Alexis complains mockingly. | ||
| + | |||
| + | Wanting to save her own energy, Alexis decides to take a nap. She falls asleep and dreams of walking around a <math>2-\text{D}</math> coordinate grid, looking for a wormhole that she believes will transport her to the beach (bypassing the time spent in the family van). In her dream, Alexis finds herself holding a device that she recognizes as a <math>\textit{tricorder}</math> from one of the old <math>\textit{Star Trek} </math> TV series. The tricorder has a button labeled "wormhole" and when Alexis presses the button, a computerized voice from the tricorder announces, "You are at the origin. Distance to the wormhole is 2400 units. Your wormhole distance allotment is <math>\textit{two}</math>."' | ||
| + | |||
| + | Unsure as to how to reach, Alexis begins walking forward. As she walks, the tricorder displays at all times her distance from her starting point at the origin. When Alexis is <math>2400</math> units from the origin, she again presses the "wormhole" button. The same computerized voice as before begins, "Distance to the origin is <math>2400</math> units. Distance to the wormhole is <math>3840</math> units. Your wormhole distance allotment is <math>\textit{two}</math>." | ||
| + | |||
| + | Alexis begins to feel disoriented. She wonders what is means that her <math>\textit{wormhole distance allotment is two}</math>, and why that number didn't change as she pushed the button. She puts her hat down to mark her position, then wanders around a bit. The tricorder shows her two readings as she walks. The first she recognizes as her distance to the origin. The second reading clearly indicates her distance from the point where her hat lies - where she last pressed the button that gave her distance to the wormhole. | ||
| + | |||
| + | Alexis picks up her hat and begins walking around. Eventually Alexis finds herself at a spot <math>2400</math> units from the origin and <math>3840</math> units from where she last pressed the button. Feeling hopeful, Alexis presses the tricorder's wormhole button again. Nothing happens. She presses it again, and again nothing happens. "Oh," she thinks, "my wormhole allotment was <math>\textit{two}</math>, and I used it up already!" | ||
| + | |||
| + | Despair fills poor Alexis who isn't sure what a wormhole looks like or how she's supposed to find it. Then she takes matters into her own hands. Alexis sits down and scribbles some notes and realizes where the wormhole must be. Alexis gets up and runs straight from her "third position" to the wormhole. As she gets closer, she sees the wormhole, which looks oddly like a huge scoop of ice cream. Alexis runs into the wormhole, then wakes up. | ||
| + | |||
| + | How many units did Alexis run from her third position to the wormhole? | ||
| + | |||
| + | [[2008 iTest Problems/Problem 56|Solution]] | ||
==Problem 57== | ==Problem 57== | ||
| + | Let a and b be the two possible values of <math>\tan\theta</math> given that <math>\sin\theta + \cos\theta = \dfrac{193}{137}</math>. If <math>a+b=m/n</math>, where <math>m</math> and <math>n</math> are relatively prime positive integers, compute <math>m+n</math>. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 57|Solution]] | ||
==Problem 58== | ==Problem 58== | ||
| + | |||
| + | Finished with rereading Isaac Asimov's <math>\textit{Foundation}</math> series, Joshua asks his father, "Do you think somebody will build small devices that run on nuclear energy while I'm alive?" | ||
| + | |||
| + | "Honestly, Josh, I don't know. There are a lot of very different engineering problems involved in designing such devices. But technology moves forward at an amazing pace, so I won't tell you we can't get there in time for you to see it. I <math>\textit{did}</math> go to a graduate school with a lady who now works on <math>\textit{portable}</math> nuclear reactors. They're not small exactly, but they aren't nearly as large as most reactors. That might be the first step toward a nuclear-powered pocket-sized video game. | ||
| + | |||
| + | Hannah adds, "There are already companies designing batteries that are nuclear in the sense that they release energy from uranium hydride through controlled exo-energetic processes. This process is not the same as the nuclear fission going on in today's reactors, but we can certainly call it <math>\textit{nuclear energy}</math>." | ||
| + | |||
| + | "Cool!" Joshua's interest is piqued. | ||
| + | |||
| + | Hannah continues, "Suppose that right now in the year <math>2008</math> we can make one of these nuclear batteries in a battery shape that is <math>2</math> meters <math>\textit{across}</math>. Let's say you need that size to be reduced to <math>2</math> centimeters <math>\textit{across}</math>, in the same proportions, in order to use it to run your little video game machine. If every year we reduce the necessary volume of such a battery by <math>1/3</math>, in what year will the batteries first get small enough?" | ||
| + | |||
| + | Joshua asks, "The battery shapes never change? Each year the new batteries are similar in shape - in all dimensions - to the batteries from previous years?" | ||
| + | |||
| + | "That's correct," confirms Joshua's mother. "Also, the base <math>10</math> logarithm of <math>5</math> is about <math>0.69897</math> and the base <math>10</math> logarithm of <math>3</math> is around <math>0.47712</math>." This makes Joshua blink. He's not sure he knows how to use logarithms, but he does think he can compute the answer. He correctly notes that after <math>13</math> years, the batteries will already be barely more than a sixth of their original width. | ||
| + | |||
| + | Assuming Hannah's prediction of volume reduction is correct and effects are compounded continuously, compute the first year that the nuclear batteries get small enough for pocket video game machines. Assume also that the year <math>2008</math> is <math>7/10</math> complete. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 58|Solution]] | ||
==Problem 59== | ==Problem 59== | ||
| + | |||
| + | Let <math>a</math> and <math>b</math> be relatively prime positive integers such that <math>\dfrac ab=\dfrac1{2^1}+\dfrac2{3^2}+\dfrac3{2^3}+\dfrac4{3^4}+\dfrac5{2^5}+\dfrac6{3^6}+\cdots</math>, where the numerators always increase by <math>1</math>, and the denominators alternate between powers of <math>2</math> and <math>3</math>, with exponents also increasing by <math>1</math> for each subsequent term. Compute <math>a+b</math>. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 59|Solution]] | ||
==Problem 60== | ==Problem 60== | ||
| + | |||
| + | Consider the Harmonic Table | ||
| + | <cmath> \begin{array}{c@{\hspace{15pt}}c@{\hspace{15pt}}c@{\hspace{15pt}}c@{\hspace{15pt}}c@{\hspace{15pt}}c@{\hspace{15pt}}c}&&&1&&&\\&&\tfrac12&&\tfrac12&&\\&\tfrac13&&\tfrac16&&\tfrac13&\\\tfrac14&&\tfrac1{12}&&\tfrac1{12}&&\tfrac14\\&&&\vdots&&&\end{array}</cmath> | ||
| + | |||
| + | where <math>a_{n,1}=1/n</math> and <math>a_{n,k+1}=a_{n-1,k}-a_{n,k}</math>. | ||
| + | |||
| + | Find the remainder when the sum of the reciprocals of the <math>2007</math> terms on the <math>2007^\text{th}</math> row gets divided by <math>2008</math>. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 60|Solution]] | ||
==Problem 61== | ==Problem 61== | ||
| + | |||
| + | Find the units digits in the decimal expansion of <math>\left(2008+\sqrt{4032000}\right)^{2000}+\left(2008+\sqrt{4032000}\right)^{2001}+\left(2008+\sqrt{4032000}\right)^{2002}+\cdots</math> | ||
| + | <math>+\left(2008+\sqrt{4032000}\right)^{2007}+\left(2008+\sqrt{4032000}\right)^{2008}</math> | ||
| + | |||
| + | [[2008 iTest Problems/Problem 61|Solution]] | ||
==Problem 62== | ==Problem 62== | ||
| + | Find the number of values of <math>x</math> such that the number of square units in the area of the isosceles triangle with sides <math>x</math>, <math>65</math>, and <math>65</math> is a positive integer. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 62|Solution]] | ||
==Problem 63== | ==Problem 63== | ||
| + | Looking for a little time alone, Michael takes a jog along the beach. The crashing of waves reminds him of the hydroelectric plant his father helped maintain before the family moved to Jupiter Falls. Michael was in elementary school at the time. He thinks for a moment about how much his life has changed in just a few years. Michael looks forward to finishing high school, but isn’t sure what he wants to do next. He thinks about whether he wants to study engineering in college, like both his parents did, or pursue an education in business. His aunt Jessica studied business and appraises budding technology companies for a venture capital firm. Other possibilities also tug a little at Michael for different reasons. | ||
| + | |||
| + | <br> | ||
| + | Michael stops and watches a group of girls who seem to be around Tony’s age play a game around an ellipse drawn in the sand. There are two softball bats stuck in the sand. Michael recognizes these as the foci of the ellipse. The bats are <math>24</math> feet apart. Two children stand on opposite ends of the ellipse where the ellipse intersects the line on which the bats lie. These two children are <math>40</math> feet apart. Five other children stand on different points on the ellipse. One of them blows a whistle and all seven children run screaming toward one bat or the other. Each child runs as fast as she can, touching one bat, then the next, and finally returning to the spot on which she started. When the first girl gets back to her place, she declares, “I win this time! I win!” Another of the girls pats her on the back, and the winning girl speaks again, “This time I found the place where I’d have to run the shortest distance.” Michael thinks for a moment, draws some notes in the sand, then compute the shortest possible distance one of the girls could run from her starting point on the ellipse, to one of the bats, to the other bat, then back to her starting point. He smiles for a moment, then keeps jogging. If Michael’s work is correct, what distance did he compute as the shortest possible distance one of the girls could run during the game? | ||
| + | |||
| + | [[2008 iTest Problems/Problem 63|Solution]] | ||
==Problem 64== | ==Problem 64== | ||
| + | |||
| + | Alexis and Joshua are walking along the beach when they decide to draw symbols in the sand. Alex draws only stars and only draws them in pairs while Joshua draws only squares in trios. "Let's see how many rows of <math>15</math> adjacent symbols we can make this way," suggests Josh. Alexis is game for the task and the two get busy drawing. Some of their rows look like | ||
| + | |||
| + | <cmath>\begin{array}{ccccccccccccccc}\vspace{10pt}*&*&*&*&*&*&*&*&*&*&*&*&\blacksquare&\blacksquare&\blacksquare\\\vspace{10pt}\blacksquare&\blacksquare&\blacksquare&*&*&*&*&*&*&*&*&*&*&*&*\\\vspace{10pt}\blacksquare&\blacksquare&\blacksquare&\blacksquare&\blacksquare&\blacksquare&*&*&*&*&*&*&\blacksquare&\blacksquare&\blacksquare\\\vspace{10pt}\blacksquare&\blacksquare&\blacksquare&\blacksquare&\blacksquare&\blacksquare&\blacksquare&\blacksquare&\blacksquare&\blacksquare&\blacksquare&\blacksquare&\blacksquare&\blacksquare&\blacksquare\\\vspace{10pt}*&*&*&*&*&*&\blacksquare&\blacksquare&\blacksquare&*&*&*&*&*&*\end{array} </cmath> | ||
| + | |||
| + | The twins decide to count each of the first two rows above as distinct rows, even though one is the mirror image of the other. But the last of the rows above is its own mirror image, so they count it only once. Around an hour later, the twins realized that they had drawn every possible row exactly once using their rules of stars in pairs and squares in trips. How many rows did they draw in the sand? | ||
| + | |||
| + | [[2008 iTest Problems/Problem 64|Solution]] | ||
==Problem 65== | ==Problem 65== | ||
| + | |||
| + | Just as the twins finish their masterpiece of symbol art, Wendy comes along. Wendy is impressed by the explanation Alexis and Joshua give her as to how they knew they drew every row exactly once. Wendy puts them both to the test. "Suppose the two of you draw symbols as you have before, stars in pairs and boxes in threes." Wendy continues, "Now, suppose that I draw circles with <math>X</math>'s in the middle." Wendy shows them examples of such rows: | ||
| + | |||
| + | <cmath>\begin{array}{ccccccccccccccc}\vspace{10pt}*&*&*&*&\otimes&*&*&\otimes&*&*&*&*&\blacksquare&\blacksquare&\blacksquare\\\vspace{10pt}\blacksquare&\blacksquare&\blacksquare&*&*&*&*&\otimes&*&*&\otimes&*&*&*&*\\\vspace{10pt}\otimes&\blacksquare&\blacksquare&\blacksquare&\otimes&\otimes&*&*&\otimes&*&*&\otimes&\blacksquare&\blacksquare&\blacksquare\end{array} </cmath> | ||
| + | |||
| + | How many rows are drawn? | ||
| + | |||
| + | [[2008 iTest Problems/Problem 65|Solution]] | ||
==Problem 66== | ==Problem 66== | ||
| + | |||
| + | Michael draws <math>\triangle ABC</math> in the sand such that <math>\angle ACB=90^\circ</math> and <math>\angle CBA=15^\circ</math>. He then picks a point at random from within the triangle and labels it point <math>M</math>. Next, he draws a segment from <math>A</math> to <math>BC</math> that passes through <math>M</math>, hitting <math>BC</math> at a point he labels <math>D</math>. Just then, a wave washes over his work, so Michael redraws the exact same diagram farther from the water, labeling all the points the same way as before. If hypotenuse <math>AB</math> is <math>4</math> feet in length, let <math>p</math> be the probability that the number of feet in the length of <math>AD</math> is less than <math>2\sqrt3-2</math>. Compute <math>\lfloor1000p\rfloor</math>. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 66|Solution]] | ||
==Problem 67== | ==Problem 67== | ||
| + | At lunch, the seven members of the Kubik family sits down to eat lunch together at a round table. In how many distinct ways can the family sit at the table if Alexis refuses to sit next to Joshua? (Two arrangements are not considered distinct if one is a rotation of the other.) | ||
| + | |||
| + | [[2008 iTest Problems/Problem 67|Solution]] | ||
==Problem 68== | ==Problem 68== | ||
| + | |||
| + | Let <math>u_n</math> be the <math>n^\text{th}</math> term of the sequence | ||
| + | |||
| + | <cmath> 1,\,\,\,\,\,\,2,\,\,\,\,\,\,5,\,\,\,\,\,\,6,\,\,\,\,\,\,9,\,\,\,\,\,\,12,\,\,\,\,\,\,13,\,\,\,\,\,\,16,\,\,\,\,\,\,19,\,\,\,\,\,\,22,\,\,\,\,\,\,23,\ldots, </cmath> | ||
| + | |||
| + | where the first term is the smallest positive integer that is <math>1</math> more than a multiple of <math>3</math>, the next two terms are the next two smallest positive integers that are each | ||
| + | two more than a multiple of <math>3</math>, the next three terms are the next three smallest positive integers that are each three more than a multiple of <math>3</math>, the next four terms | ||
| + | are the next four smallest positive integers that are each four more than a multiple of <math>3</math>, and so on: | ||
| + | |||
| + | <cmath>\underbrace{1}_{1\text{ term}},\,\,\,\,\,\,\underbrace{2,\,\,\,\,\,\,5}_{2\text{ terms}},\,\,\,\,\,\,\underbrace{6,\,\,\,\,\,\,9,\,\,\,\,\,\,12}_{3\text{ terms}},\,\,\,\,\,\,\underbrace{13,\,\,\,\,\,\,16,\,\,\,\,\,\,19,\,\,\,\,\,\,22}_{4\text{ terms}},\,\,\,\,\,\,\underbrace{23,\ldots}_{5\text{ terms}},\,\,\,\,\,\,\ldots. </cmath> | ||
| + | |||
| + | Determine <math>u_{2008}</math>. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 68|Solution]] | ||
==Problem 69== | ==Problem 69== | ||
| + | |||
| + | In the sequence in the previous problem, how many of <math>u_1,u_2,u_3,\ldots, u_{2008}</math> are pentagonal numbers? | ||
| + | |||
| + | [[2008 iTest Problems/Problem 69|Solution]] | ||
==Problem 70== | ==Problem 70== | ||
| + | |||
| + | After swimming around the ocean with some snorkling gear, Joshua walks back to the beach where Alexis works on a mural in the sand beside where they drew out symbol lists. Joshua walks directly over the mural without paying any attention. | ||
| + | |||
| + | "You're a square, Josh." | ||
| + | |||
| + | "No, <math>\textit{you're}</math> a square," retorts Joshua. "In fact, you're a <math>\textit{cube}</math>, which is 50% freakier than a square by dimension. And before you tell me I'm a hypercube, I'll remind you that mom and dad confirmed that they could not have given birth to a four dimension being." | ||
| + | |||
| + | "Okay, you're a cubist caricature of male immaturity," asserts Alexis. | ||
| + | |||
| + | Knowing nothing about cubism, Joshua decides to ignore Alexis and walk to where he stashed his belongings by a beach umbrella. He starts thinking about cubes and computes some sums of cubes, and some cubes of sums: | ||
| + | |||
| + | <cmath> \begin{align*}1^3+1^3+1^3&=3,\\1^3+1^3+2^3&=10,\\1^3+2^3+2^3&=17,\\2^3+2^3+2^3&=24,\\1^3+1^3+3^3&=29,\\1^3+2^3+3^3&=36,\\(1+1+1)^3&=27,\\(1+1+2)^3&=64,\\(1+2+2)^3&=125,\\(2+2+2)^3&=216,\\(1+1+3)^3&=125,\\(1+2+3)^3&=216.\end{align*} </cmath> | ||
| + | |||
| + | Josh recognizes that the cubes of the sums are always larger than the sum of cubes of positive integers. For instance, | ||
| + | |||
| + | <cmath>\begin{align*}(1+2+4)^3&=1^3+2^3+4^3+3(1^2\cdot 2+1^2\cdot 4+2^2\cdot 1+2^2\cdot 4+4^2\cdot 1+4^2\cdot 2)+6(1\cdot 2\cdot 4)\\&>1^3+2^3+4^3.\end{align*} </cmath> | ||
| + | |||
| + | Josh begins to wonder if there is a smallest value of n such that <math>(a+b+c)^3\leq n(a^3+b^3+c^3)</math> for all natural numbers <math>a, b</math>, and <math>c</math>. | ||
| + | Joshua thinks he has an answer, but doesn't know how to prove it, so he takes it to Michael who confirms Joshua's answer with a proof. | ||
| + | What is the correct value of n that Joshua found? | ||
| + | |||
| + | [[2008 iTest Problems/Problem 70|Solution]] | ||
==Problem 71== | ==Problem 71== | ||
| + | |||
| + | One day Joshua and Alexis find their sister Wendy's copy of the 2007 iTest. They decide to see if they can work any of the problems and are proud to find that indeed they are able to work some of them, but their middle school math team experience is still not enough to help with the harder problems. | ||
| + | |||
| + | Alexis comes across a problem she really likes, partly because she has never worked one like it before: | ||
| + | |||
| + | ''What is the smallest positive integer <math>k</math> such that the number <math>\binom{2k}k</math> ends in two zeroes?'' | ||
| + | |||
| + | Joshua is the kind of mathematical explorer who likes to alter problems, make them harder, or generalize them. So, he proposes the following problem to his sister Alexis: | ||
| + | |||
| + | ''What is the smallest positive integer <math>k</math> such that the number <math>\binom{2k}k</math> ends in two zeroes when expressed in base 12?'' | ||
| + | |||
| + | Alexis solves the problem correctly. What is her answer (expressed in base <math>10</math>)? | ||
| + | |||
| + | [[2008 iTest Problems/Problem 71|Solution]] | ||
==Problem 72== | ==Problem 72== | ||
| + | |||
| + | On the last afternoon of the Kubik family vacation, Michael puts down a copy of <math>\textit{Mathematical Olympiad Challenges}</math> and goes out to play tennis. Wendy notices the book and decides to see if there are a few problems in it that she can solve. She decides to focus her energy on one problem in particular: | ||
| + | |||
| + | ''Given 69 distinct positive integers not exceeding 100, prove that one can choose four of them <math>a,b,c,d</math> such that <math>a<b<c</math> and <math>a+b+c=d</math>. Is this statement true for 68 numbers?'' | ||
| + | |||
| + | After some time working on the problem, Wendy finally feels like she has a grip on the solution. When Michael returns, she explains her solutions to him. "Well done!" he tells her. "Now, see if you can solve this generalization. Consider the set <math>S=\{1,2,3,\ldots,2007,2008\}</math>. Find the smallest value of <math>t</math> such that given any subset <math>T</math> of <math>S</math> where <math>|T|=t</math>, then there are necessarily distinct <math>a,b,c,d\in T</math> for which <math>a+b+c=d</math>." Find the answer to Michael's generalization. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 72|Solution]] | ||
==Problem 73== | ==Problem 73== | ||
| + | |||
| + | As the Kubiks head homeward, away from the beach in the family van, Jerry decides to take a different route away from the beach than the one they took to get there. The route involves lots of twists and turns, prompting Hannah to wonder aloud if Jerry's "shortcut" will save any time at all. | ||
| + | |||
| + | Michael offers up a problem as an analogy to his father's meandering: "Suppose dad drives around, making right-angled turns after <math>\textit{every}</math> mile. What is the farthest he could get us from our starting point after driving us <math>500</math> miles assuming that he makes exactly <math>300</math> right turns?" | ||
| + | |||
| + | "Sounds almost like an energy efficiency problem," notes Hannah only half jokingly. Hannah is always encouraging her children to think along these lines. | ||
| + | |||
| + | Let <math>d</math> be the answer to Michael's problem. Compute <math>\lfloor d\rfloor</math>. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 73|Solution]] | ||
==Problem 74== | ==Problem 74== | ||
| + | |||
| + | Points <math>C</math> and <math>D</math> lie on opposite sides of line <math>\overline{AB}</math>. Let <math>M</math> and <math>N</math> be the centroids of <math>\triangle ABC</math> and <math>\triangle ABD</math> respectively. | ||
| + | If <math>AB=841, BC=840, AC=41, AD=609</math>, and <math>BD=580</math>, find the sum of the numerator and denominator of the value of <math>MN</math> when expressed as a fraction in lowest terms. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 74|Solution]] | ||
==Problem 75== | ==Problem 75== | ||
| + | |||
| + | Let <math>S=\sqrt{1+\dfrac1{1^2}+\dfrac1{2^2}}+\sqrt{1+\dfrac1{2^2}+\dfrac1{3^2}}+\cdots+\sqrt{1+\dfrac1{2007^2}+\dfrac1{2008^2}}</math>. Compute <math>\lfloor S^2\rfloor</math>. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 75|Solution]] | ||
==Problem 76== | ==Problem 76== | ||
| + | |||
| + | During the car ride home, Michael looks back at his recent math exams. A problem on Michael's calculus mid-term gets him starting thinking about a particular quadratic, <math>x^2-sx+p</math>, with roots <math>r_1</math> and <math> r_2</math>. He notices that <math>r_1+r_2=r_1^2+r_2^2=r_1^3+r_2^3=\cdots=r_1^{2007}+r_2^{2007}</math>. He wonders how often this is the case, and begins exploring other quantities associated with the roots of such a quadratic. He sets out to compute the greatest possible value of <math>\dfrac1{r_1^{2008}}+\dfrac1{r_2^{2008}}</math>. Help Michael by computing this maximum. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 76|Solution]] | ||
==Problem 77== | ==Problem 77== | ||
| + | With about six hours left on the van ride home from vacation, Wendy looks for something to do. She starts working on a project for the math team. | ||
| + | |||
| + | There are sixteen students, including Wendy, who are about to be sophomores on the math team. Elected as a math team officer, one of Wendy's jobs is to schedule groups of the sophomores to tutor geometry students after school on Tuesdays. The way things have been done in the past, the same number of sophomores tutor every week, but the same group of students never works together. Wendy notices that there are even numbers of groups she could select whether she chooses <math>4</math> or <math>5</math> students at a time to tutor geometry each week: | ||
| + | |||
| + | <cmath> \begin{align*}\dbinom{16}4&=1820,\\\dbinom{16}5&=4368.\end{align*} </cmath> | ||
| + | |||
| + | Playing around a bit more, Wendy realizes that unless she chooses all or none of the students on the math team to tutor each week that the number of possible combinations of the sophomore math teamers is always even. This gives her an idea for a problem for the <math>2008</math> Jupiter Falls High School Math Meet team test: | ||
| + | |||
| + | ''How many of the 2009 numbers on Row 2008 of Pascal's Triangle are even?'' | ||
| + | |||
| + | Wendy works the solution out correctly. What is her answer? | ||
| + | |||
| + | [[2008 iTest Problems/Problem 77|Solution]] | ||
==Problem 78== | ==Problem 78== | ||
| + | Feeling excited over her successful explorations into Pascal's Triangle, Wendy formulates a second problem to use during a future Jupiter Falls High School Math Meet: | ||
| + | |||
| + | ''How many of the first 2010 rows of Pascal's Triangle (Rows 0 through 2009) have exactly 256 odd entries?'' | ||
| + | |||
| + | What is the solution to Wendy's second problem? | ||
| + | |||
| + | [[2008 iTest Problems/Problem 78|Solution]] | ||
==Problem 79== | ==Problem 79== | ||
| + | |||
| + | Done with her new problems, Wendy takes a break from math. Still without any fresh reading material, she feels a bit antsy. She starts to feel annoyed that Michael's loose papers clutter the family van. Several of them are ripped, and bits of paper litter the floor. Tired of trying to get Michael to clean up after himself, Wendy spends a couple of minutes putting Michael's loose papers in the trash. "That seems fair to me," confirms Hannah encouragingly. | ||
| + | |||
| + | While collecting Michael's scraps, Wendy comes across a corner of a piece of paper with part of a math problem written on it. There is a monic polynomial of degree <math>n</math>, with real coefficients. The first two terms after <math>x^n</math> are <math>a_{n-1}x^{n-1}</math> and <math>a_{n-2}x^{n-2}</math>, but the rest of the polynomial is cut off where Michael's page is ripped. Wendy barely makes out a little of Michael's scribbling, showing that <math>a_{n-1}=-a_{n-2}</math>. Wendy deciphers the goal of the problem, which is to find the sum of the squares of the roots of the polynomial. Wendy knows neither the value of <math>n</math>, nor the value of <math>a_{n-1}</math>, but still she finds a [greatest] lower bound for the answer to the problem. Find the absolute value of that lower bound. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 79|Solution]] | ||
==Problem 80== | ==Problem 80== | ||
| + | Let | ||
| + | <center><math>p(x) = x^{2008} + x^{2007} + x^{2006} + \cdots + x + 1,</math></center> | ||
| + | and let <math>r(x)</math> be the polynomial remainder when <math>p(x)</math> is divided by <math>x^4+x^3+2x^2+x+1</math>. Find | ||
| + | the remainder when <math>|r(2008)|</math> is divided by <math>1000</math>. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 80|Solution]] | ||
==Problem 81== | ==Problem 81== | ||
| + | |||
| + | Compute the number of <math>7</math>-digit positive integers that start <math>\textit{or}</math> end (or both) with a digit that is a (nonzero) composite number. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 81|Solution]] | ||
==Problem 82== | ==Problem 82== | ||
| + | Tony’s favorite “sport” is a spectator event known as the Super Mega Ultra Galactic Thumbwrestling Championship (SMUG TWC). During the 2008 SMUG TWC, 2008 professional thumbwrestlers who have dedicated their lives to earning lithe, powerful thumbs, compete to earn the highest title of Thumbzilla. The SMUG TWC is designed so that, in the end, any set of three participants can share a banana split while telling <math>\text{FOX}^\text{TM}</math> television reporters about a bout between some pair of the three contestants. Given that there are exactly two contestants in each bout, let <math>m</math> be the minimum number of bouts necessary to complete the SMUG TWC (so that the contestants can enjoy their banana splits and chat with reporters). Compute <math>m</math>. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 82|Solution]] | ||
==Problem 83== | ==Problem 83== | ||
| + | |||
| + | Find the greatest natural number <math>n</math> such that <math>n\leq 2008</math> and <math>(1^2+2^2+3^2+\cdots + n^2)\left[(n+1)^2+(n+2)^2+(n+3)^2+\cdots + (2n)^2\right]</math> is a perfect square. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 83|Solution]] | ||
==Problem 84== | ==Problem 84== | ||
| + | |||
| + | Let <math>S</math> be the sum of all integers <math>b</math> for which the polynomial <math>x^2+bx+2008b</math> can be factored over the integers. Compute <math>|S|</math>. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 84|Solution]] | ||
==Problem 85== | ==Problem 85== | ||
| + | |||
| + | Let <math>(a,b,c,d)</math> be a solution to the system | ||
| + | <cmath>\begin{align*}a+b&=15,\\ab+c+d&=78,\\ad+bc&=160,\\cd&=96.\end{align*} </cmath> | ||
| + | Find the greatest possible value of <math>a^2+b^2+c^2+d^2</math>. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 85|Solution]] | ||
==Problem 86== | ==Problem 86== | ||
| + | Let <math>a, b, c</math>, and <math>d</math> be positive real numbers such that | ||
| + | |||
| + | <cmath> \begin{array}{c@{\hspace{3pt}}c@{\hspace{3pt}}c@{\hspace{3pt}}c@{\hspace{3pt}}c}a^2+b^2&=&c^2+d^2&=&2008,\\ ac&=&bd&=&1000.\end{array} </cmath> | ||
| + | |||
| + | If <math>S=a+b+c+d</math>, compute the value of <math>\lfloor S\rfloor</math>. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 86|Solution]] | ||
==Problem 87== | ==Problem 87== | ||
| + | Find the number of <math>12</math>-digit "words" that can be formed from the alphabet <math>\{0,1,2,3,4,5,6\}</math> if neighboring digits must differ by exactly <math>2</math>. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 87|Solution]] | ||
==Problem 88== | ==Problem 88== | ||
| + | |||
| + | A six dimensional "cube" (a <math>6</math>-cube) has <math>64</math> vertices at the points <math>(\pm 3,\pm 3,\pm 3,\pm 3,\pm 3,\pm 3)</math>. This <math>6</math>-cube has <math>192\text{ 1-D}</math> edges and <math>240\text{ 2-D}</math> edges. This <math>6</math>-cube gets cut into <math>6^6=46656</math> smaller congruent "unit" <math>6</math>-cubes that are kept together in the tightly packaged form of the original <math>6</math>-cube so that the <math>46656</math> smaller <math>6</math>-cubes share <math>2-D</math> square faces with neighbors (<math>\textit{one}</math> <math>2</math>-D square face shared by <math>\textit{several}</math> unit <math>6</math>-cube neighbors). How many <math>2</math>-D squares are faces of one or more of the unit <math>6</math>-cubes? | ||
| + | |||
| + | [[2008 iTest Problems/Problem 88|Solution]] | ||
==Problem 89== | ==Problem 89== | ||
| + | |||
| + | Two perpendicular planes intersect a sphere in two circles. These circles intersect in two points, <math>A</math> and <math> B</math>, such that <math>AB=42</math>. If the radii of the two circles are <math>54</math> and <math>66</math>, find <math>R^2</math>, where <math>R</math> is the radius of the sphere. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 89|Solution]] | ||
==Problem 90== | ==Problem 90== | ||
| + | |||
| + | For <math>a,b,c</math> positive reals, let <math>N=\dfrac{a^2+b^2}{c^2+ab}+\dfrac{b^2+c^2}{a^2+bc}+\dfrac{c^2+a^2}{b^2+ca}</math>. Find the minimum value of <math>\lfloor 2008N\rfloor</math>. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 90|Solution]] | ||
==Problem 91== | ==Problem 91== | ||
| + | |||
| + | Find the sum of all positive integers <math>n</math> such that <math>x^3+y^3+z^3=nx^2y^2z^2</math> is satisfied by at least one ordered triplet of positive integers <math>(x,y,z)</math>. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 91|Solution]] | ||
==Problem 92== | ==Problem 92== | ||
| + | |||
| + | Find [decimal form of] the largest prime divisor of <math>100111011_6</math>. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 92|Solution]] | ||
==Problem 93== | ==Problem 93== | ||
| + | For how many positive integers <math>n</math>, <math>1 \le n \le 2008</math>, can the set | ||
| + | <center><math>{1, 2, 3, . . . , 4n}</math></center> | ||
| + | be divided into <math>n</math> [[disjoint]] <math>4</math>-element [[subset]]s such that every one of the <math>n</math> subsets contains the | ||
| + | element which is the [[arithmetic mean]] of all the elements in that subset? | ||
| + | |||
| + | [[2008 iTest Problems/Problem 93|Solution]] | ||
==Problem 94== | ==Problem 94== | ||
| + | Find the largest [[prime]] number less than <math>2008</math> that is a divisor of some integer in the infinite | ||
| + | sequence | ||
| + | |||
| + | <cmath>\left\lfloor \frac{2008}{1} \right\rfloor, \left\lfloor \frac{2008^2}{2} \right\rfloor, \left\lfloor \frac{2008^3}{3}\right\rfloor, \left\lfloor \frac{2008^4}{4} \right\rfloor, \cdots</cmath> | ||
| + | |||
| + | [[2008 iTest Problems/Problem 94|Solution]] | ||
==Problem 95== | ==Problem 95== | ||
| + | Bored on their trip home, Joshua and Alexis decide to keep a tally of license plates they see in the other lanes: Joshua watches cars going the other way, and Alexis watches cars in the next lane. | ||
| + | |||
| + | After a few minutes, Wendy counts up the tallies and declares, "Joshua has counted <math>2008</math> license plates, and there are <math>17</math> license plate designs he's seen exactly <math>17</math> times, but of Alexis's <math>2009</math> license plates, there's non she's seen exactly <math>18</math> times. Clearly, <math>17</math> is the specialist number." | ||
| + | |||
| + | Michael, suspicious, pulls out the <math>\textit{Almanac of American License Plates}</math> and notes, "According to confirmed demographic statistics, you'd only expect those numbers to be <math>5.4</math> and <math>5.9</math>, respectively. But the <math>17^\text{th}</math> state is weird: Joshua saw exactly <math>17</math> of its license plates, which isn't what we'd expect." | ||
| + | |||
| + | Alexis asks, "How many Ohioan license plates did we expect to see?" and reaches for the <math>\textit{Almanac}</math> to find out, but Michael snatches it away and says, "I'm not telling." | ||
| + | |||
| + | Alexis, disappointed, says, "I suppose that <math>17</math> is my best guess," feeling that the answer must be pretty close to <math>17</math>. | ||
| + | |||
| + | Wendy smiles. "You can do better than that, actually. Given what Michael said and that we saw <math>17</math> Ohioan license plates, we'd actually expect there to have been <math>\tfrac ab</math> less than <math>17</math>." | ||
| + | |||
| + | Help Alexis. If <math>\tfrac ab</math> is in lowest terms, find the product <math>ab</math>. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 95|Solution]] | ||
==Problem 96== | ==Problem 96== | ||
| + | |||
| + | Triangle <math>ABC</math> has <math>\angle A=90^\circ, \angle B=60^\circ</math>, and <math>AB=8</math>, and a point <math>P</math> is chosen inside the triangle. The interior angle bisectors <math>\ell_A, \ell_B</math>, and <math>\ell_C</math> of respective angles <math>PAB, PBC</math>, and <math>PCA</math> intersect pairwise at <math>X=\ell_A\cap\ell_C, Y=\ell_A\cap\ell_B</math>, and <math>Z=\ell_B\cap\ell_C</math>. If triangles <math> ABC</math> and <math>XYZ</math> are directly similar, then the area of <math>\triangle XYZ</math> may be written in the form <math>\tfrac{p\sqrt q-r\sqrt s}t</math>, where<math> p,q,r,s,t</math> are positive integers, <math>q</math> and <math>s</math> are not divisible by the square of any prime, and <math>\gcd(t,r,p)=1</math>. Compute <math>p+q+r+s+t</math>. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 96|Solution]] | ||
==Problem 97== | ==Problem 97== | ||
| + | |||
| + | During the first week of the <math>2008-2009</math> school year at Jupiter Falls High School, the school holds a fire drill. The <math>2008</math> students in attendance all leave the school and head for the football field. Wendy and several of her friends sit down in a circle on the ground and begin to chat. | ||
| + | |||
| + | Wendy and her friend Lilly sit side-by-side, and after a little while decide to swap spots in order to make it easier to talk with different friends. This leads Lilly's boyfriend Nori to offer up a problem, "Suppose we all stood up and took the space that one of our neighbors had been sitting in. In how many ways could we do that?" | ||
| + | |||
| + | "I think just four, " offers Wendy, oblivious that Nori is subtly voicing a complaint over Lilly's absence at his side. "We all either move one spot clockwise, or one spot counterclockwise. Unless we can sit on each other." | ||
| + | |||
| + | Nori replies, "Oh, right. That's not really what I meant. What I meant was that we can also stay in our own spot, like Beth, Regan, Tom, Burt, and I just did. So, in how many ways can that happen? Assume no two people wind up in the same spot." | ||
| + | |||
| + | Wendy pulls out a calculator and writes a program that cycles through all the possibilities. After a couple of minutes she announces, "There are <math>31</math>. <math>\textit{That's}</math> a weird number." | ||
| + | |||
| + | "Can you solve it generally?" asks Lilly. | ||
| + | |||
| + | "Honestly, I'm not sure. I'd need to work on it a bit to know if I could," admits Wendy. | ||
| + | |||
| + | Nori adds more complexity to the problem, "How about this: Let k be the number of students in a circle. Then let m be the number of ways we can rearrange ourselves so that each of us is in the same spot or within one spot of where we started, and no two people are ever in the same spot. If <math>m</math> leaves a remainder of <math>1</math> when divided by <math>5</math>, how many possible values are there of k, where <math>k</math> is at least <math>3</math> and at most <math>2008</math>?" | ||
| + | |||
| + | Find the answer to Nori's problem. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 97|Solution]] | ||
==Problem 98== | ==Problem 98== | ||
| + | |||
| + | Convex quadrilateral <math>ABCD</math> has side-lengths <math>AB=7, BC=9, CD=15</math>, and there exists a circle, lying inside the quadrilateral and having center I, that is tangent to all four sides of the quadrilateral. Points <math>M</math> and <math>N</math> are on the midpoints of <math>AC</math> and <math>BD</math> respectively. It can be proven that point I always lies on segment <math>MN</math>. Supposing further that I is the midpoint of <math>MN</math>, the area of quadrilateral <math>ABCD</math> may be expressed as <math>p\sqrt q</math>, where <math>p</math> and <math>q</math> are positive integers and <math>q</math> is not divisible by the square of any prime. Compute <math>p\cdot q</math>. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 98|Solution]] | ||
==Problem 99== | ==Problem 99== | ||
| + | |||
| + | Given a convex, <math>n</math>-sided polygon <math>P</math>, form a <math>2n</math>-sided polygon <math>\text{clip}(P)</math> by cutting off each corner of <math>P</math> at the edges’ trisection points. In other words, <math>\text{clip}(P)</math> is the polygon whose vertices are the <math>2n</math> edge trisection points of <math>P</math>, connected in order around the boundary of <math>P</math>. Let <math>P_1</math> be an isosceles trapezoid with side lengths <math>13, 13, 13</math>, and <math>3</math>, and for each <math>i \geq 2</math>, let <math>P_i = \text{clip}(P_{i-1})</math>. This iterative clipping process approaches a limiting shape <math>P_\infty = \lim_{i \rightarrow \infty} P_i</math>. If the difference of the areas of <math>P_{10}</math> and <math>P_{\infty}</math> is written as a fraction <math>\frac{x}{y}</math> in lowest terms, calculate the number of positive integer factors of <math>x \cdot y</math>. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 99|Solution]] | ||
==Problem 100== | ==Problem 100== | ||
| + | |||
| + | Let <math>\alpha</math> be a root of <math> x^6-x-1</math>, and call two polynomials <math>p</math> and <math>q</math> with integer coefficients <math>\textit{equivalent}</math> if <math>p(\alpha)\equiv q(\alpha)\pmod3</math>. It is known that every such polynomial is equivalent to exactly one of <math>0,1,x,x^2,\ldots,x^{727}</math>. Find the largest integer <math>n<728</math> for which there exists a polynomial <math>p</math> such that <math>p^3-p-x^n</math> is equivalent to <math>0</math>. | ||
| + | |||
| + | [[2008 iTest Problems/Problem 100|Solution]] | ||
| + | |||
| + | ==See Also== | ||
| + | * [[iTest Problems and Solutions]] | ||
| + | |||
| + | {{2008 iTest box|before=[[2007 iTest]]|after=Last iTest}} | ||
Latest revision as of 11:39, 20 November 2024
Contents
- 1 Problem 1
- 2 Problem 2
- 3 Problem 3
- 4 Problem 4
- 5 Problem 5
- 6 Problem 6
- 7 Problem 7
- 8 Problem 8
- 9 Problem 9
- 10 Problem 10
- 11 Problem 11
- 12 Problem 12
- 13 Problem 13
- 14 Problem 14
- 15 Problem 15
- 16 Problem 16
- 17 Problem 17
- 18 Problem 18
- 19 Problem 19
- 20 Problem 20
- 21 Problem 21
- 22 Problem 22
- 23 Problem 23
- 24 Problem 24
- 25 Problem 25
- 26 Problem 26
- 27 Problem 27
- 28 Problem 28
- 29 Problem 29
- 30 Problem 30
- 31 Problem 31
- 32 Problem 32
- 33 Problem 33
- 34 Problem 34
- 35 Problem 35
- 36 Problem 36
- 37 Problem 37
- 38 Problem 38
- 39 Problem 39
- 40 Problem 40
- 41 Problem 41
- 42 Problem 42
- 43 Problem 43
- 44 Problem 44
- 45 Problem 45
- 46 Problem 46
- 47 Problem 47
- 48 Problem 48
- 49 Problem 49
- 50 Problem 50
- 51 Problem 51
- 52 Problem 52
- 53 Problem 53
- 54 Problem 54
- 55 Problem 55
- 56 Problem 56
- 57 Problem 57
- 58 Problem 58
- 59 Problem 59
- 60 Problem 60
- 61 Problem 61
- 62 Problem 62
- 63 Problem 63
- 64 Problem 64
- 65 Problem 65
- 66 Problem 66
- 67 Problem 67
- 68 Problem 68
- 69 Problem 69
- 70 Problem 70
- 71 Problem 71
- 72 Problem 72
- 73 Problem 73
- 74 Problem 74
- 75 Problem 75
- 76 Problem 76
- 77 Problem 77
- 78 Problem 78
- 79 Problem 79
- 80 Problem 80
- 81 Problem 81
- 82 Problem 82
- 83 Problem 83
- 84 Problem 84
- 85 Problem 85
- 86 Problem 86
- 87 Problem 87
- 88 Problem 88
- 89 Problem 89
- 90 Problem 90
- 91 Problem 91
- 92 Problem 92
- 93 Problem 93
- 94 Problem 94
- 95 Problem 95
- 96 Problem 96
- 97 Problem 97
- 98 Problem 98
- 99 Problem 99
- 100 Problem 100
- 101 See Also
Problem 1
Jerry and Hannah Kubik live in Jupiter Falls with their five children. Jerry works as a Renewable Energy Engineer for the Southern Company, and Hannah runs a lab at Jupiter Falls University where she researches biomass (renewable fuel) conversion rates. Michael is their oldest child, and Wendy their oldest daughter. Tony is the youngest child. Twins Joshua and Alexis are 
years old.
When the Kubiks went on vacation to San Diego last year, they spent a day at the San Diego Zoo.
Single-day passes cost 
for adults (Jerry and Hannah), 
for children
(Michael is still young enough to get the children's rate), and family memberships
(which allow the whole family in at once) cost 
. How many dollars did the family save by buying a family pass over buying single day passes for every member of the family?
Problem 2
One day while Tony plays in the back yard of the Kubik's home, he wonders about the width of the back yard, which is in the shape of a rectangle. A row of trees spans the width of the back of the yard by the fence, and Tony realizes that all the trees have almost exactly the same diameter, and the trees look equally spaced. Tony fetches a tape measure from the garage and measures a distance of almost exactly feet between a consecutive pair of trees. Tony realizes the need to include the width of the trees in his measurements. Unsure as to how to do this, he measures the distance between the centers of the trees, which comes out to be around 
feet. He then measures 
feet to either side of the first and last trees in the row before the ends of the yard. Tony uses these measurements to estimate the width of the yard. If there are six trees in the row of trees, what is Tony's estimate in feet?
![[asy] size(350); defaultpen(linewidth(0.8)); draw((0,-3)--(0,3)); int d=8; for(int i=0;i<=5;i=i+1) { draw(circle(7/2+d*i,3/2)); } draw((5*d+7,-3)--(5*d+7,3)); draw((0,0)--(2,0),Arrows(size=7)); draw((5,0)--(2+d,0),Arrows(size=7)); draw((7/2+d,0)--(7/2+2*d,0),Arrows(size=7)); label("$2$",(1,0),S); label("$12$",((7+d)/2,0),S); label("$15$",((7+3*d)/2,0),S);[/asy]](http://latex.artofproblemsolving.com/3/a/8/3a80e4a8e4694d25af2cb8cc10d3330b872419c3.png)
Problem 3
Michael plays catcher for his school's baseball team. He has always been a great player behind the plate, but this year as a junior, Michael's offense is really improving.
His batting average is 
after six games, and the team is 
(six wins and no losses). They are off to their best start in years.
On the way home from their sixth game, Michael notes to his father that the attendance seems to be increasing due to the team's great start, "There were 
people at the first game, then 
at the second, 
the third, 
the fourth, 
at the fifth, and there were 
at today's game." Just then, Michael's
genius younger brother Tony, just seven-years-old, computes the average attendance of the six games. What is their average?
Problem 4
The difference between two prime numbers is 
. Find their sum.
Problem 5
Jerry recently returned from a trip to South America where he helped two old factories reduce pollution output by installing more modern scrubber equipment.
Factory A previously filtered 
% of pollutants and Factory 
previously filled 
% of pollutants. After installing the new scrubber system, both factories now
filter 
% of pollutants.
Jerry explains the level of pollution reduction to Michael, "Factory 
is the much larger factory. It's four times as large as Factory . Without any filters at all,
it would pollute four times as much as Factory . Even with the better pollution filtration system, Factory was polluting nearly three times as much as Factory B."
Assuming the factories are the same in every way except size and previous percentage of pollution filtered, find 
where 
is the ratio in lowest
terms of volume of pollutants unfiltered from both factories 
installation of the new scrubber system to the volume of pollutants unfiltered
from both factories 
installation of the new scrubber system.
Problem 6
Let 
be the length of the altitude to the hypotenuse of a right triangle with legs 
and . Find the least integer greater than .
Problem 7
Find the number of integers 
for which 
.
Problem 8
The math team at Jupiter Falls Middle School meets together twice a month during the summer, and the math team coach, Mr. Fischer, prepares some Olympics-themed problems for his students. One of the problems Joshua and Alexis work on boils down to a system of equations:
,
,
,find 
.
Problem 9
Joshua likes to play with numbers and patterns. Joshua's favorite number is 
because it is the units digit of his birth year, 
.
Part of the reason Joshua likes the number 6 so much is that the powers of all have the same units digit as they grow from 
:
However, not all units digits remain constant when exponentiated in this way. One day Joshua asks Michael if there are
simple patterns for the units digits when each one-digit integer is exponentiated in the manner above. Michael responds,
"You tell me!" Joshua gives a disappointed look, but then Michael suggests that Joshua play around with some numbers
and see what he can discover. "See if you can find the units digit of 
," Michael challenges. After a little while,
Joshua finds an answer which Michael confirms is correct. What is Joshua's correct answer (the units digit of )?
Problem 10
Tony has an old sticky toy spider that very slowly goes down a wall after being stuck to the wall. In fact, left untouched, the toy spider crawls down at a rate of one inch for every two hours it's left stuck to the wall. One morning, at around 
o' clock, Tony sticks the spider to the wall in the living room three feet above the floor. Over the next few mornings, Tony moves the spider up three feet from the point where he finds it. If the wall in the living room is 
feet high, after how many days (days after the first day Tony places the spider on the wall) will Tony run out of room to place the spider three feet higher?
Problem 11
After moving his sticky toy spider one morning, Tony heads outside to play "pirates" with his pal Nick, who lives a few doors down the street from the Kubiks. Tony and Nick imagine themselves as pirates in a rough skirmish over a chest of gold. Victorious over their foes, Tony and Nick claim the prize. However, they must split some of the gold with their crew, which they imagine consists of eight other bloodthirsty pirates. Each of the pirates receives at least one gold coin, but none receive the same number of coins, then Tony and Nick split the remainder equally. If there are 
gold coins in the chest, what is the greatest number of gold coins Tony could take as his share? (Assume each gold coin is equally valuable.)
Problem 12
One day while the Kubik family attends one of Michael's baseball games, Tony gets bored and walks to the creek a few yards behind the baseball field. One of Tony's classmates
Mitchell sees Tony and goes to join him. While playing around the creek, the two boys find an ordinary six-sided die buried in sediment. Mitchell washes it off in the water and
challenges Tony to a contest. Each of the boys rolls the die exactly once. Mitchell's roll is 
higher than Tony's. "Let's play once more," says Tony. Let be the probability
that the difference between the outcomes of the two dice is again exactly (regardless of which of the boys rolls higher), where a and b are relatively prime positive
integers. Find .
Problem 13
In preparation for the family's upcoming vacation, Tony puts together five bags of jelly beans, one bag for each day of the trip, with an equal number of jelly beans in each bag. Tony then pours all the jelly beans out of the five bags and begins making patterns with them. One of the patterns that he makes has one jelly bean in a top row, three jelly beans in the next row, five jelly beans in the row after that, and so on:
![\[\begin{array}{ccccccccc}&&&&*&&&&\\&&&*&*&*&&&\\&&*&*&*&*&*&&\\&*&*&*&*&*&*&*&\\ *&*&*&*&*&*&*&*&*\\&&&&\vdots&&&&\end{array}\]](http://latex.artofproblemsolving.com/5/d/8/5d8d992aae06c76627660a94e84799339d0031fc.png)
Continuing in this way, Tony finishes a row with none left over. For instance, if Tony had exactly 
jelly beans, he could finish the fifth row above with no jelly beans left over. However, when Tony finishes, there are between 
and 
rows. Tony then scoops all the jelly beans and puts them all back into the five bags so that each bag once again contains the same number. How many jelly beans are in each bag? (Assume that no jelly bean gets put inside more than one bag.)
Problem 14
The sum of the two perfect cubes that are closest to 
is 
. Find the sum of the two perfect cubes that are closest to 
.
Problem 15
How many four-digit multiples of 
are greater than ?
Problem 16
In order to encourage the kids to straighten up their closets and the storage shed, Jerry offers his kids some extra spending money for their upcoming vacation. "I don't care what you do, I just want to see everything look clean and organized."
While going through his closet, Joshua finds an old bag of marbles that are either blue or red. The ratio of blue to red marbles in the bag is 
. Alexis also has some marbles of the same colors, but hasn't used them for anything in years. She decides to give Joshua her marbles to put in his marble bag so that all the marbles are in one place. Alexis has twice as many red marbles as blue marbles, and when the twins get all their marbles in one bag, there are exactly as many red marbles and blue marbles, and the total number of marbles is between 
and 
. How many total marbles do the twins have together?
Problem 17
One day when Wendy is riding her horse Vanessa, they get to a field where some tourists are following Martin (the tour guide) on some horses. Martin and some of the workers at the stables are each leading extra horses, so there are more horses than people. Martin's dog Berry runs around near the trail as well. Wendy counts a total of 
heads belonging to the people, horses, and dog. She counts a total of 
legs belonging to everyone, and notes that nobody is missing any legs.
Upon returning home Wendy gives Alexis a little problem solving practice, "I saw heads and legs belonging to people, horses, and dogs. Assuming two legs per person and four for the other animals, how many people did I see?" Alexis scribbles out some algebra and answers correctly. What is her answer?
Problem 18
Find the number of lattice points that the line 
passes through in Quadrant I.
Problem 19
Let be the set of positive integers that are the product of two consecutive integers. Let be the set of positive integers that are the product of three consecutive integers. Find the sum of the two smallest elements of 
.
Problem 20
In order to earn a little spending money for the family vacation, Joshua and Wendy offer to clean up the storage shed. After clearing away some trash, Joshua and Wendy set aside give boxes that belong to the two of them that they decide to take up to their bedrooms. Each is in the shape of a cube. The four smaller boxes are all of equal size, and when stacked up, reach the exact height of the large box. If the volume of one of the smaller boxes is 
cubic inches, find the sum of the volumes of all five boxes (in cubic inches).
Problem 21
One of the boxes that Joshua and Wendy unpack has Joshua's collection of board games. Michael, Wendy, Alexis, and Joshua decide to play one of them, a game called Risk that involves rolling ordinary six-sided dice to determine the outcomes of strategic battles. Wendy has never played before, so early on Michael explains a bit of strategy.
"You have the first move and you occupy three of the four territories in the Australian continent. You'll want to attack Joshua in Indonesia so that you can claim the Australian continent which will give you bonus armies on your next turn."
"Don't tell her that!" complains Joshua.
Wendy and Joshua begin rolling dice to determine the outcome of their struggle over Indonesia. Joshua rolls extremely well, overcoming longshot odds to hold off Wendy's attack. Finally, Wendy is left with one chance. Wendy and Joshua each roll just one six-sided die. Wendy wins if her roll is higher than Joshua's roll. Let a and b be relatively prime positive integers so that is the probability that Wendy rolls higher, giving her control over the continent of Australia. Find the value of .
Problem 22
Tony plays a game in which he takes 
nickels out of a roll and tosses them one at a time toward his desk where his change jar sits. He awards himself points for each nickel that lands in the jar, and takes away points from his score for each nickel that hits the ground. After Tony is done tossing all nickels, he computes 
as his score. Find the greatest number of nickels he could have successfully tossed into the jar.
Problem 23
Find the number of positive integers that are solutions to the simultaneous system of inequalities
.Problem 24
In order to earn her vacation spending money, Alexis helped her mother remove weeds from the garden. When she was done, she came into the house to put away her gardening gloves and change into clean clothes.
On her way to her room she notices Joshua with his face to the floor in the family room, looking pretty silly. "Josh, did you know you lose IQ points for sniffing the carpet?"
"Shut up. I'm not sniffing the carpet. I'm doing something."
"Sure, if sniffing the carpet counts as doing something." At this point Alexis stands over her twin brother grinning, trying to see how silly she can make him feel.
Joshua climbs to his feet and stands on his toes to make himself a half inch taller than his sister, who is ordinarily a half inch taller than Joshua. "I'm measuring something. I'm designing something."
Alexis stands on her toes too, reminding her brother that she is still taller than he. "When you're done, can you design me a dress?"
"Very funny." Joshua walks to the table and points to some drawings. "I'm designing the sand castle I want to build at the beach. Everything needs to be measured out so that I can build something awesome."
"And this requires sniffing carpet?" inquires Alexis, who is just a little intrigued by her brother's project.
"I was imagining where to put the base of a spiral staircase. Everything needs to be measured out correctly. See, the castle walls will be in the shape of a rectangle, like this room. The center of the staircase will be inches from one of the corners, inches from another, 16 inches from another, and some whole number of inches from the furthest corner." Joshua shoots Alexis a wry smile. The twins liked to challenge each other, and Alexis knew she had to find the distance from the center of the staircase to the fourth corner of the castle on her own, or face Joshua's pestering, which might last for hours or days.
Find the distance from the center of the staircase to the furthest corner of the rectangular castle, assuming all four of the distances to the corners are described as distances on the same plane (the ground).
Problem 25
A cube has edges of length 
cm. The cube gets chopped up into some number of smaller cubes, all of equal size, such that each edge of one of the smaller cubes has an integer length. One of those smaller cubes is then chopped up into some number of even smaller cubes, all of equal size. If the edge length of one of those even smaller cubes is cm, where is an integer, find the number of possible values of .
Problem 26
Done working on his sand castle design, Joshua sits down and starts rolling a -sided die he found when cleaning the storage shed. He rolls and rolls and rolls, and after 
rolls he finally rolls a 
. Just rolls later he rolls the first 2 
that first roll of . rolls later, Joshua rolls the first 
the first that he rolled the first that he rolled. His first 
rolls make the sequence 
.
Joshua wonders how many times he should expect to roll the -sided die so that he can remove all but of the numbers from the entire sequence of rolls and (without changing the order of the sequence), be left with the sequence 
. What is the expected value of the number of times Joshua must roll the die before he has such a sequence? (Assume Joshua starts from the beginning - do 
assume he starts by rolling the specific sequence of rolls above.)
Problem 27
Hannah Kubik leads a local volunteer group of thirteen adults that takes turns holding classes for patients at the Children’s Hospital. At the end of August, Hannah took a tour of the hospital and talked with some members of the staff. Dr. Yang told Hannah that it looked like there would be more girls than boys in the hospital during September. The next day Hannah brought the volunteers together and it was decided that three women and two men would volunteer to run the September classes at the Children’s Hospital. If there are exactly six women in the volunteer group, how many combinations of three women and two men could Hannah choose from the volunteer group to run the classes?
Problem 28
Of the thirteen members of the volunteer group, Hannah selects herself, Tom Morris, Jerry Hsu, Thelma Paterson, and Louise Bueller to teach the September classes. When she is done, she decides that it's not necessary to balance the number of female and male teachers with the proportions of girls and boys at the hospital 
month, and having half the women work while only of the 
men work on some months means that some of the women risk getting burned out. After all, nearly all the members of the volunteer group have other jobs.
Hannah comes up with a plan that the committee likes. Beginning in October, the committee of five volunteer teachers will consist of any five members of the volunteer group,
so long as there is at least one woman and at least one man teaching each month. Under this new plan, what is the least number of months that 
go by
(including October when the first set of five teachers is selected, but not September) such that some five-member committee 
taught together twice
(all five members are the same during two different months)?
Problem 29
Find the number of ordered triplets 
of positive integers such that 
(the product of 
, and 
is ).
Problem 30
Find the number of ordered triplets of positive integers such that 
and .
Problem 31
The 
term of a sequence is 
. Compute the sum 
.
Problem 32
A right triangle has perimeter , and the area of a circle inscribed in the triangle is 
. Let A be the area of the triangle. Compute 
.
Problem 33
One night, over dinner Jerry poses a challenge to his younger children: "Suppose we travel 
miles per hour while heading to our final vacation destination..."
Hannah teases her husband, "You 
drive that 
"
Jerry smirks at Hannah, then starts over, "So that we get a good view of all the beautiful landscape your mother likes to photograph from the passenger's seat, we
travel at a constant rate of miles per hour on the way to the beach. However, on the way back we travel at a faster constant rate along the exact same route.
If our faster return rate is an integer number of miles per hour, and our average speed for the 
is 
an integer number of
miles per hour, what must be our speed during the return trip?"
Michael pipes up, "How about 
miles per hour?!"
Wendy smiles, "For the sake of your 
children, please don't let 
drive."
Jerry adds, "How about we assume that we never 
drive more than 
miles per hour. Michael and Wendy, let Josh and Alexis try this one."
Joshua ignores the problem in favor of the huge pile of mashed potatoes on his plate.
But Alexis scribbles some work on her napkin and declares the correct answer. What answer did Alexis find?
Problem 34
While entertaining his younger sister Alexis, Michael drew two different cards from an ordinary deck of playing cards. Let a be the probability that the cards are of different ranks. Compute 
.
Problem 35
Let 
be the probability that the cards are from different suits. Compute 
.
Problem 36
Let be the probability that the cards are neither from the same suit or the same rank. Compute 
.
Problem 37
A triangle has sides of length 
, and 
. Let a and b be relatively prime positive integers such that is the length of the shortest altitude of the triangle.
Find the value of .
Problem 38
The volume of a certain rectangular solidis 
, its total surface area is 
, and its three dimensions are in
geometric progression. Find the sum of the lengths in cm of all the edges of this solid.
Problem 39
Let 
denote 
, the number of integers 
that are relatively prime to . (For example, 
and 
.)
Let 
, in which 
ranges through all positive divisors of , including and . Find the remainder when 
is divided by 
.
Problem 40
Find the number of integers n that satisfy 
of the following conditions:
,
n has the same remainder when divided by 
or by 
.
Problem 41
Suppose that 
.
Find the value of 
, where 
.
Problem 42
Joshua's physics teacher, Dr. Lisi, lives next door to the Kubiks and is a long time friend of the family. An unusual fellow, Dr. Lisi spends as much time surfing
and raising chickens as he does trying to map out a 
. Dr. Lisi often poses problems to the Kubik children to challenge them to
think a little deeper about math and science. One day while discussing sequences with Joshua, Dr. Lisi writes out the first terms of an arithmetic
progression that begins 
. Joshua then computes the (positive) difference between the 
term in the sequence,
and the 
term in the sequence. What number does Joshua compute?
Problem 43
Alexis notices Joshua working with Dr. Lisi and decides to join in on the fun. Dr. Lisi challenges her to compute the sum of all terms in the sequence.
Alexis thinks about the problem and remembers a story one of her teachers at school taught her about how a young Karl Gauss quickly computed the sum
in elementary school. Using Gauss's method, Alexis correctly finds the sum of the terms in Dr. Lisi's sequence. What is this sum?
Problem 44
Now Wendy wanders over and joins Dr. Lisi and her younger siblings. Thinking she knows everything there is about how to work with arithmetic series, she nearly turns right around to walk back home when Dr. Lisi poses a more challenging problem. "Suppose I select two distinct terms at random from the term sequence. What's the probability that their product is positive?" If 
and are relatively prime positive integers such that is the probability that the product of the two terms is positive, find the value of .
Problem 45
In order to save money on gas and use up less fuel, Hannah has a special battery installed in the family van. Before the installation, the van averaged miles per gallon of gas. After the conversion, the van got miles per gallon of gas.
Michael notes, "The amount of money we will save on gas over any time period is equal to the amount we would save if we were able to convert the van to go from miles per gallon to m miles per gallon. It is also the same that we would save if we were able to convert the van to go from m miles per gallon to miles per gallon."
Assuming Michael is correct, compute 
. In this problem, assume that gas mileage is constant over all speeds and terrain and that the van gets used the same amount regardless of its present state of conversion.
Problem 46
Let be the sum of all 
in the interval 
that satisfy 
. Compute 
.
Problem 47
Find 
, where , , and are the hundreds, tens, and units digits of the six-digit integer
, which is a multiple of 
.
Problem 48
A repunit is a natural number whose digits are all . For instance,
![\[1,11,111,1111, \ldots\]](http://latex.artofproblemsolving.com/6/3/8/6386858630e6455adad0971f9ba1465e78468343.png)
are the four smallest repunits. How many digits are there in the smallest repunit that is
divisible by 
?
Problem 49
Wendy takes Honors Biology at school, a smallish class with only fourteen students (including Wendy) who sit around a circular table. Wendy’s friends Lucy, Starling, and Erin are also in that class. Last Monday none of the fourteen students were absent from class. Before the teacher arrived, Lucy and Starling stretched out a blue piece of yarn between them. Then Wendy and Erin stretched out a red piece of yarn between them at about the same height so that the yarns would intersect if possible. If all possible positions of the students around the table are equally likely, let 
be the probability that the yarns intersect, where 
and are relatively prime positive integers. Compute 
.
Problem 50
As the Kubiks head out of town for vacation, Jerry takes the first driving shift while Hannah and most of the kids settle down to read books they brought along. Tony does not feel like reading, so Alexis gives him one of her math notebooks and Tony gets to work solving some of the problems, and struggling over others. After a while, Tony comes to a problem he likes from an old AMC 10 exam:
Four distinct circles are drawn in a plane. What is the maximum number of points where at least two of the circles intersect?
Tony realizes that he can draw the four circles such that each pair of circles intersects in two points. After careful doodling, Tony finds the correct answer, and is proud that he can solve a problem from late on an AMC 10 exam.
"Mom, why didn't we all get Tony's brain?" Wendy inquires before turning he head back into her favorite Harry Potter volume (the fifth year).
Joshua leans over to Tony's seat to see his brother's work. Joshua knows that Tony has not yet discovered all the underlying principles behind the problem, so Joshua challenges, "What if there are a dozen circles?"
Tony gets to work on Joshua's problem of finding the maximum number of points of intersections where at least two of the twelve circles in a plane intersect. What is the answer to this problem?
Problem 51
Alexis imagines a 
grid of integers arranged sequentially in the following way:
![\[\begin{array}{r@{\hspace{20pt}}r@{\hspace{20pt}}r@{\hspace{20pt}}r@{\hspace{20pt}}r}1,&2,&3,&\ldots,&2008\\2009,&2010,&2011,&\ldots,&4026\\4017,&4018,&4019,&\ldots,&6024\\\vdots&&&&\vdots\\2008^2-2008+1,&2008^2-2008+2,&2008^2-2008+3,&\ldots,&2008^2\end{array}\]](http://latex.artofproblemsolving.com/6/3/b/63b8bf5ad2e21e2d241f19c234c084abc05df458.png)
She picks one number from each row so that no two numbers she picks are in the same column. She them proceeds to add them together and finds that is the sum. Next, she picks of the numbers that are distinct from the she picked the first time. Again she picks exactly one number from each row and column, and again the sum of all numbers is . Find the remainder when is divided by .
Problem 52
A triangle has sides of length , and . A square is inscribed in the triangle such that one side of the square lies on the longest side of the triangle, and the two vertices not on that side of the square touch the other two sides of the triangle. If and are relatively prime positive integers such that 
is the length of a side of the square, find the value of 
.
Problem 53
Find the sum of the 
roots of 
.
Problem 54
One of Michael’s responsibilities in organizing the family vacation is to call around and find room rates for hotels along the route the Kubik family plans to drive. While calling hotels near the Grand Canyon, a phone number catches Michael’s eye. Michael notices that the first four digits of 
descend 
and that the last four ascend in order 
. This fact along with the fact that the digits are split into consecutive groups makes that number easier to remember. Looking back at the list of numbers that Michael called already, he notices that several of the phone numbers have the same property: their first four digits are in descending order while the last four are in ascending order. Suddenly, Michael realizes that he can remember all those numbers without looking back at his list of hotel phone numbers. “Wow,” he thinks, “that’s good marketing strategy.” Michael then wonders to himself how many businesses in a single area code could have such phone numbers. How many -digit telephone numbers are there such that all seven digits are distinct, the first four digits are in descending order, and the last four digits are in ascending order?
Problem 55
Let 
be a right-angled triangle with 
. Let 
and 
be the midpoints of legs 
and 
, respectively. Find the length 
given that
and 
.
Problem 56
During the van ride from the Grand Canyon to the beach, Michael asks his dad about the costs of renewable energy resources. "How much more does it really cost for a family like ours to switch entirely to renewable energy?"
Jerry explains, "Part of that depends on where the family lives. In the Western states, solar energy pays off more than it does where we live in the Southeast. But as technology gets better, costs of producing more photovoltaic power go down, so in just a few years more people will have reasonably inexpensive options for switching to cleaner power sources. Even now most families could switch to biomass for between 
and 
per year. The energy comes from sawdust, switch-grass, and even landfill gas. We pay that premium ourselves, but some families operate on a tighter budget, or don't understand the alternatives yet."
"Ew, landfill gas!" Alexis complains mockingly.
Wanting to save her own energy, Alexis decides to take a nap. She falls asleep and dreams of walking around a 
coordinate grid, looking for a wormhole that she believes will transport her to the beach (bypassing the time spent in the family van). In her dream, Alexis finds herself holding a device that she recognizes as a 
from one of the old 
TV series. The tricorder has a button labeled "wormhole" and when Alexis presses the button, a computerized voice from the tricorder announces, "You are at the origin. Distance to the wormhole is 2400 units. Your wormhole distance allotment is 
."'
Unsure as to how to reach, Alexis begins walking forward. As she walks, the tricorder displays at all times her distance from her starting point at the origin. When Alexis is 
units from the origin, she again presses the "wormhole" button. The same computerized voice as before begins, "Distance to the origin is units. Distance to the wormhole is 
units. Your wormhole distance allotment is ."
Alexis begins to feel disoriented. She wonders what is means that her 
, and why that number didn't change as she pushed the button. She puts her hat down to mark her position, then wanders around a bit. The tricorder shows her two readings as she walks. The first she recognizes as her distance to the origin. The second reading clearly indicates her distance from the point where her hat lies - where she last pressed the button that gave her distance to the wormhole.
Alexis picks up her hat and begins walking around. Eventually Alexis finds herself at a spot units from the origin and units from where she last pressed the button. Feeling hopeful, Alexis presses the tricorder's wormhole button again. Nothing happens. She presses it again, and again nothing happens. "Oh," she thinks, "my wormhole allotment was , and I used it up already!"
Despair fills poor Alexis who isn't sure what a wormhole looks like or how she's supposed to find it. Then she takes matters into her own hands. Alexis sits down and scribbles some notes and realizes where the wormhole must be. Alexis gets up and runs straight from her "third position" to the wormhole. As she gets closer, she sees the wormhole, which looks oddly like a huge scoop of ice cream. Alexis runs into the wormhole, then wakes up.
How many units did Alexis run from her third position to the wormhole?
Problem 57
Let a and b be the two possible values of 
given that 
. If 
, where and are relatively prime positive integers, compute .
Problem 58
Finished with rereading Isaac Asimov's 
series, Joshua asks his father, "Do you think somebody will build small devices that run on nuclear energy while I'm alive?"
"Honestly, Josh, I don't know. There are a lot of very different engineering problems involved in designing such devices. But technology moves forward at an amazing pace, so I won't tell you we can't get there in time for you to see it. I 
go to a graduate school with a lady who now works on 
nuclear reactors. They're not small exactly, but they aren't nearly as large as most reactors. That might be the first step toward a nuclear-powered pocket-sized video game.
Hannah adds, "There are already companies designing batteries that are nuclear in the sense that they release energy from uranium hydride through controlled exo-energetic processes. This process is not the same as the nuclear fission going on in today's reactors, but we can certainly call it 
."
"Cool!" Joshua's interest is piqued.
Hannah continues, "Suppose that right now in the year we can make one of these nuclear batteries in a battery shape that is meters 
. Let's say you need that size to be reduced to centimeters , in the same proportions, in order to use it to run your little video game machine. If every year we reduce the necessary volume of such a battery by 
, in what year will the batteries first get small enough?"
Joshua asks, "The battery shapes never change? Each year the new batteries are similar in shape - in all dimensions - to the batteries from previous years?"
"That's correct," confirms Joshua's mother. "Also, the base logarithm of is about 
and the base logarithm of is around 
." This makes Joshua blink. He's not sure he knows how to use logarithms, but he does think he can compute the answer. He correctly notes that after 
years, the batteries will already be barely more than a sixth of their original width.
Assuming Hannah's prediction of volume reduction is correct and effects are compounded continuously, compute the first year that the nuclear batteries get small enough for pocket video game machines. Assume also that the year is 
complete.
Problem 59
Let and be relatively prime positive integers such that 
, where the numerators always increase by , and the denominators alternate between powers of and , with exponents also increasing by for each subsequent term. Compute .
Problem 60
Consider the Harmonic Table
![\[\begin{array}{c@{\hspace{15pt}}c@{\hspace{15pt}}c@{\hspace{15pt}}c@{\hspace{15pt}}c@{\hspace{15pt}}c@{\hspace{15pt}}c}&&&1&&&\\&&\tfrac12&&\tfrac12&&\\&\tfrac13&&\tfrac16&&\tfrac13&\\\tfrac14&&\tfrac1{12}&&\tfrac1{12}&&\tfrac14\\&&&\vdots&&&\end{array}\]](http://latex.artofproblemsolving.com/c/6/b/c6bd588e9bcc7fc2b8889a821e22758e548e585c.png)
where 
and 
.
Find the remainder when the sum of the reciprocals of the terms on the 
row gets divided by .
Problem 61
Find the units digits in the decimal expansion of 
Problem 62
Find the number of values of such that the number of square units in the area of the isosceles triangle with sides , 
, and is a positive integer.
Problem 63
Looking for a little time alone, Michael takes a jog along the beach. The crashing of waves reminds him of the hydroelectric plant his father helped maintain before the family moved to Jupiter Falls. Michael was in elementary school at the time. He thinks for a moment about how much his life has changed in just a few years. Michael looks forward to finishing high school, but isn’t sure what he wants to do next. He thinks about whether he wants to study engineering in college, like both his parents did, or pursue an education in business. His aunt Jessica studied business and appraises budding technology companies for a venture capital firm. Other possibilities also tug a little at Michael for different reasons.
Michael stops and watches a group of girls who seem to be around Tony’s age play a game around an ellipse drawn in the sand. There are two softball bats stuck in the sand. Michael recognizes these as the foci of the ellipse. The bats are feet apart. Two children stand on opposite ends of the ellipse where the ellipse intersects the line on which the bats lie. These two children are feet apart. Five other children stand on different points on the ellipse. One of them blows a whistle and all seven children run screaming toward one bat or the other. Each child runs as fast as she can, touching one bat, then the next, and finally returning to the spot on which she started. When the first girl gets back to her place, she declares, “I win this time! I win!” Another of the girls pats her on the back, and the winning girl speaks again, “This time I found the place where I’d have to run the shortest distance.” Michael thinks for a moment, draws some notes in the sand, then compute the shortest possible distance one of the girls could run from her starting point on the ellipse, to one of the bats, to the other bat, then back to her starting point. He smiles for a moment, then keeps jogging. If Michael’s work is correct, what distance did he compute as the shortest possible distance one of the girls could run during the game?
Problem 64
Alexis and Joshua are walking along the beach when they decide to draw symbols in the sand. Alex draws only stars and only draws them in pairs while Joshua draws only squares in trios. "Let's see how many rows of adjacent symbols we can make this way," suggests Josh. Alexis is game for the task and the two get busy drawing. Some of their rows look like
![\[\begin{array}{ccccccccccccccc}\vspace{10pt}*&*&*&*&*&*&*&*&*&*&*&*&\blacksquare&\blacksquare&\blacksquare\\\vspace{10pt}\blacksquare&\blacksquare&\blacksquare&*&*&*&*&*&*&*&*&*&*&*&*\\\vspace{10pt}\blacksquare&\blacksquare&\blacksquare&\blacksquare&\blacksquare&\blacksquare&*&*&*&*&*&*&\blacksquare&\blacksquare&\blacksquare\\\vspace{10pt}\blacksquare&\blacksquare&\blacksquare&\blacksquare&\blacksquare&\blacksquare&\blacksquare&\blacksquare&\blacksquare&\blacksquare&\blacksquare&\blacksquare&\blacksquare&\blacksquare&\blacksquare\\\vspace{10pt}*&*&*&*&*&*&\blacksquare&\blacksquare&\blacksquare&*&*&*&*&*&*\end{array}\]](http://latex.artofproblemsolving.com/9/2/e/92e9e43bb103c5309a950410b052102742be8339.png)
The twins decide to count each of the first two rows above as distinct rows, even though one is the mirror image of the other. But the last of the rows above is its own mirror image, so they count it only once. Around an hour later, the twins realized that they had drawn every possible row exactly once using their rules of stars in pairs and squares in trips. How many rows did they draw in the sand?
Problem 65
Just as the twins finish their masterpiece of symbol art, Wendy comes along. Wendy is impressed by the explanation Alexis and Joshua give her as to how they knew they drew every row exactly once. Wendy puts them both to the test. "Suppose the two of you draw symbols as you have before, stars in pairs and boxes in threes." Wendy continues, "Now, suppose that I draw circles with 
's in the middle." Wendy shows them examples of such rows:
![\[\begin{array}{ccccccccccccccc}\vspace{10pt}*&*&*&*&\otimes&*&*&\otimes&*&*&*&*&\blacksquare&\blacksquare&\blacksquare\\\vspace{10pt}\blacksquare&\blacksquare&\blacksquare&*&*&*&*&\otimes&*&*&\otimes&*&*&*&*\\\vspace{10pt}\otimes&\blacksquare&\blacksquare&\blacksquare&\otimes&\otimes&*&*&\otimes&*&*&\otimes&\blacksquare&\blacksquare&\blacksquare\end{array}\]](http://latex.artofproblemsolving.com/5/b/9/5b9abd785c6472ad2645a892669263a46ee53845.png)
How many rows are drawn?
Problem 66
Michael draws 
in the sand such that 
and 
. He then picks a point at random from within the triangle and labels it point . Next, he draws a segment from to 
that passes through , hitting at a point he labels 
. Just then, a wave washes over his work, so Michael redraws the exact same diagram farther from the water, labeling all the points the same way as before. If hypotenuse 
is 
feet in length, let 
be the probability that the number of feet in the length of 
is less than 
. Compute 
.
Problem 67
At lunch, the seven members of the Kubik family sits down to eat lunch together at a round table. In how many distinct ways can the family sit at the table if Alexis refuses to sit next to Joshua? (Two arrangements are not considered distinct if one is a rotation of the other.)
Problem 68
Let 
be the term of the sequence
![\[1,\,\,\,\,\,\,2,\,\,\,\,\,\,5,\,\,\,\,\,\,6,\,\,\,\,\,\,9,\,\,\,\,\,\,12,\,\,\,\,\,\,13,\,\,\,\,\,\,16,\,\,\,\,\,\,19,\,\,\,\,\,\,22,\,\,\,\,\,\,23,\ldots,\]](http://latex.artofproblemsolving.com/a/5/5/a55e4cdce8d6dbd9a6797b613f6b645124867c9e.png)
where the first term is the smallest positive integer that is more than a multiple of , the next two terms are the next two smallest positive integers that are each
two more than a multiple of , the next three terms are the next three smallest positive integers that are each three more than a multiple of , the next four terms
are the next four smallest positive integers that are each four more than a multiple of , and so on:
![\[\underbrace{1}_{1\text{ term}},\,\,\,\,\,\,\underbrace{2,\,\,\,\,\,\,5}_{2\text{ terms}},\,\,\,\,\,\,\underbrace{6,\,\,\,\,\,\,9,\,\,\,\,\,\,12}_{3\text{ terms}},\,\,\,\,\,\,\underbrace{13,\,\,\,\,\,\,16,\,\,\,\,\,\,19,\,\,\,\,\,\,22}_{4\text{ terms}},\,\,\,\,\,\,\underbrace{23,\ldots}_{5\text{ terms}},\,\,\,\,\,\,\ldots.\]](http://latex.artofproblemsolving.com/7/f/c/7fc5e1d1c944c786dc23d0f9689ddbf00f03abab.png)
Determine 
.
Problem 69
In the sequence in the previous problem, how many of 
are pentagonal numbers?
Problem 70
After swimming around the ocean with some snorkling gear, Joshua walks back to the beach where Alexis works on a mural in the sand beside where they drew out symbol lists. Joshua walks directly over the mural without paying any attention.
"You're a square, Josh."
"No, 
a square," retorts Joshua. "In fact, you're a 
, which is 50% freakier than a square by dimension. And before you tell me I'm a hypercube, I'll remind you that mom and dad confirmed that they could not have given birth to a four dimension being."
"Okay, you're a cubist caricature of male immaturity," asserts Alexis.
Knowing nothing about cubism, Joshua decides to ignore Alexis and walk to where he stashed his belongings by a beach umbrella. He starts thinking about cubes and computes some sums of cubes, and some cubes of sums:
Josh recognizes that the cubes of the sums are always larger than the sum of cubes of positive integers. For instance,
Josh begins to wonder if there is a smallest value of n such that 
for all natural numbers , and .
Joshua thinks he has an answer, but doesn't know how to prove it, so he takes it to Michael who confirms Joshua's answer with a proof.
What is the correct value of n that Joshua found?
Problem 71
One day Joshua and Alexis find their sister Wendy's copy of the 2007 iTest. They decide to see if they can work any of the problems and are proud to find that indeed they are able to work some of them, but their middle school math team experience is still not enough to help with the harder problems.
Alexis comes across a problem she really likes, partly because she has never worked one like it before:
What is the smallest positive integer 
such that the number 
ends in two zeroes?
Joshua is the kind of mathematical explorer who likes to alter problems, make them harder, or generalize them. So, he proposes the following problem to his sister Alexis:
What is the smallest positive integer such that the number ends in two zeroes when expressed in base 12?
Alexis solves the problem correctly. What is her answer (expressed in base )?
Problem 72
On the last afternoon of the Kubik family vacation, Michael puts down a copy of 
and goes out to play tennis. Wendy notices the book and decides to see if there are a few problems in it that she can solve. She decides to focus her energy on one problem in particular:
Given 69 distinct positive integers not exceeding 100, prove that one can choose four of them 
such that and 
. Is this statement true for 68 numbers?
After some time working on the problem, Wendy finally feels like she has a grip on the solution. When Michael returns, she explains her solutions to him. "Well done!" he tells her. "Now, see if you can solve this generalization. Consider the set 
. Find the smallest value of 
such that given any subset 
of where 
, then there are necessarily distinct 
for which ." Find the answer to Michael's generalization.
Problem 73
As the Kubiks head homeward, away from the beach in the family van, Jerry decides to take a different route away from the beach than the one they took to get there. The route involves lots of twists and turns, prompting Hannah to wonder aloud if Jerry's "shortcut" will save any time at all.
Michael offers up a problem as an analogy to his father's meandering: "Suppose dad drives around, making right-angled turns after mile. What is the farthest he could get us from our starting point after driving us miles assuming that he makes exactly 
right turns?"
"Sounds almost like an energy efficiency problem," notes Hannah only half jokingly. Hannah is always encouraging her children to think along these lines.
Let be the answer to Michael's problem. Compute 
.
Problem 74
Points 
and lie on opposite sides of line 
. Let and be the centroids of and 
respectively.
If 
, and 
, find the sum of the numerator and denominator of the value of 
when expressed as a fraction in lowest terms.
Problem 75
Let 
. Compute 
.
Problem 76
During the car ride home, Michael looks back at his recent math exams. A problem on Michael's calculus mid-term gets him starting thinking about a particular quadratic, 
, with roots 
and 
. He notices that 
. He wonders how often this is the case, and begins exploring other quantities associated with the roots of such a quadratic. He sets out to compute the greatest possible value of 
. Help Michael by computing this maximum.
Problem 77
With about six hours left on the van ride home from vacation, Wendy looks for something to do. She starts working on a project for the math team.
There are sixteen students, including Wendy, who are about to be sophomores on the math team. Elected as a math team officer, one of Wendy's jobs is to schedule groups of the sophomores to tutor geometry students after school on Tuesdays. The way things have been done in the past, the same number of sophomores tutor every week, but the same group of students never works together. Wendy notices that there are even numbers of groups she could select whether she chooses or students at a time to tutor geometry each week:
Playing around a bit more, Wendy realizes that unless she chooses all or none of the students on the math team to tutor each week that the number of possible combinations of the sophomore math teamers is always even. This gives her an idea for a problem for the Jupiter Falls High School Math Meet team test:
How many of the 2009 numbers on Row 2008 of Pascal's Triangle are even?
Wendy works the solution out correctly. What is her answer?
Problem 78
Feeling excited over her successful explorations into Pascal's Triangle, Wendy formulates a second problem to use during a future Jupiter Falls High School Math Meet:
How many of the first 2010 rows of Pascal's Triangle (Rows 0 through 2009) have exactly 256 odd entries?
What is the solution to Wendy's second problem?
Problem 79
Done with her new problems, Wendy takes a break from math. Still without any fresh reading material, she feels a bit antsy. She starts to feel annoyed that Michael's loose papers clutter the family van. Several of them are ripped, and bits of paper litter the floor. Tired of trying to get Michael to clean up after himself, Wendy spends a couple of minutes putting Michael's loose papers in the trash. "That seems fair to me," confirms Hannah encouragingly.
While collecting Michael's scraps, Wendy comes across a corner of a piece of paper with part of a math problem written on it. There is a monic polynomial of degree , with real coefficients. The first two terms after 
are 
and 
, but the rest of the polynomial is cut off where Michael's page is ripped. Wendy barely makes out a little of Michael's scribbling, showing that 
. Wendy deciphers the goal of the problem, which is to find the sum of the squares of the roots of the polynomial. Wendy knows neither the value of , nor the value of 
, but still she finds a [greatest] lower bound for the answer to the problem. Find the absolute value of that lower bound.
Problem 80
Let
and let 
be the polynomial remainder when 
is divided by 
. Find
the remainder when 
is divided by .
Problem 81
Compute the number of -digit positive integers that start 
end (or both) with a digit that is a (nonzero) composite number.
Problem 82
Tony’s favorite “sport” is a spectator event known as the Super Mega Ultra Galactic Thumbwrestling Championship (SMUG TWC). During the 2008 SMUG TWC, 2008 professional thumbwrestlers who have dedicated their lives to earning lithe, powerful thumbs, compete to earn the highest title of Thumbzilla. The SMUG TWC is designed so that, in the end, any set of three participants can share a banana split while telling 
television reporters about a bout between some pair of the three contestants. Given that there are exactly two contestants in each bout, let be the minimum number of bouts necessary to complete the SMUG TWC (so that the contestants can enjoy their banana splits and chat with reporters). Compute .
Problem 83
Find the greatest natural number such that 
and ![$(1^2+2^2+3^2+\cdots + n^2)\left[(n+1)^2+(n+2)^2+(n+3)^2+\cdots + (2n)^2\right]$](http://latex.artofproblemsolving.com/5/a/5/5a5f4cdb58ea8e0270799c461bf0a83179d74c78.png)
is a perfect square.
Problem 84
Let be the sum of all integers for which the polynomial 
can be factored over the integers. Compute 
.
Problem 85
Let 
be a solution to the system
Find the greatest possible value of 
.
Problem 86
Let 
, and be positive real numbers such that
![\[\begin{array}{c@{\hspace{3pt}}c@{\hspace{3pt}}c@{\hspace{3pt}}c@{\hspace{3pt}}c}a^2+b^2&=&c^2+d^2&=&2008,\\ ac&=&bd&=&1000.\end{array}\]](http://latex.artofproblemsolving.com/6/2/6/6261896ca8bda4b7cd9f07447991fe1a9e5e037a.png)
If 
, compute the value of 
.
Problem 87
Find the number of -digit "words" that can be formed from the alphabet 
if neighboring digits must differ by exactly .
Problem 88
A six dimensional "cube" (a -cube) has 
vertices at the points 
. This -cube has 
edges and 
edges. This -cube gets cut into 
smaller congruent "unit" -cubes that are kept together in the tightly packaged form of the original -cube so that the 
smaller -cubes share 
square faces with neighbors (
-D square face shared by 
unit -cube neighbors). How many -D squares are faces of one or more of the unit -cubes?
Problem 89
Two perpendicular planes intersect a sphere in two circles. These circles intersect in two points, and , such that 
. If the radii of the two circles are 
and 
, find 
, where 
is the radius of the sphere.
Problem 90
For 
positive reals, let 
. Find the minimum value of 
.
Problem 91
Find the sum of all positive integers such that 
is satisfied by at least one ordered triplet of positive integers 
.
Problem 92
Find [decimal form of] the largest prime divisor of 
.
Problem 93
For how many positive integers , 
, can the set
be divided into disjoint -element subsets such that every one of the subsets contains the
element which is the arithmetic mean of all the elements in that subset?
Problem 94
Find the largest prime number less than that is a divisor of some integer in the infinite
sequence
![\[\left\lfloor \frac{2008}{1} \right\rfloor, \left\lfloor \frac{2008^2}{2} \right\rfloor, \left\lfloor \frac{2008^3}{3}\right\rfloor, \left\lfloor \frac{2008^4}{4} \right\rfloor, \cdots\]](http://latex.artofproblemsolving.com/4/8/5/485ca5f877833b37c70714f06e8f8e023756244a.png)
Problem 95
Bored on their trip home, Joshua and Alexis decide to keep a tally of license plates they see in the other lanes: Joshua watches cars going the other way, and Alexis watches cars in the next lane.
After a few minutes, Wendy counts up the tallies and declares, "Joshua has counted license plates, and there are license plate designs he's seen exactly times, but of Alexis's 
license plates, there's non she's seen exactly times. Clearly, is the specialist number."
Michael, suspicious, pulls out the 
and notes, "According to confirmed demographic statistics, you'd only expect those numbers to be 
and 
, respectively. But the 
state is weird: Joshua saw exactly of its license plates, which isn't what we'd expect."
Alexis asks, "How many Ohioan license plates did we expect to see?" and reaches for the 
to find out, but Michael snatches it away and says, "I'm not telling."
Alexis, disappointed, says, "I suppose that is my best guess," feeling that the answer must be pretty close to .
Wendy smiles. "You can do better than that, actually. Given what Michael said and that we saw Ohioan license plates, we'd actually expect there to have been 
less than ."
Help Alexis. If is in lowest terms, find the product 
.
Problem 96
Triangle 
has 
, and 
, and a point 
is chosen inside the triangle. The interior angle bisectors 
, and 
of respective angles 
, and 
intersect pairwise at 
, and 
. If triangles and 
are directly similar, then the area of 
may be written in the form 
, where
are positive integers, 
and 
are not divisible by the square of any prime, and 
. Compute 
.
Problem 97
During the first week of the 
school year at Jupiter Falls High School, the school holds a fire drill. The students in attendance all leave the school and head for the football field. Wendy and several of her friends sit down in a circle on the ground and begin to chat.
Wendy and her friend Lilly sit side-by-side, and after a little while decide to swap spots in order to make it easier to talk with different friends. This leads Lilly's boyfriend Nori to offer up a problem, "Suppose we all stood up and took the space that one of our neighbors had been sitting in. In how many ways could we do that?"
"I think just four, " offers Wendy, oblivious that Nori is subtly voicing a complaint over Lilly's absence at his side. "We all either move one spot clockwise, or one spot counterclockwise. Unless we can sit on each other."
Nori replies, "Oh, right. That's not really what I meant. What I meant was that we can also stay in our own spot, like Beth, Regan, Tom, Burt, and I just did. So, in how many ways can that happen? Assume no two people wind up in the same spot."
Wendy pulls out a calculator and writes a program that cycles through all the possibilities. After a couple of minutes she announces, "There are . 
a weird number."
"Can you solve it generally?" asks Lilly.
"Honestly, I'm not sure. I'd need to work on it a bit to know if I could," admits Wendy.
Nori adds more complexity to the problem, "How about this: Let k be the number of students in a circle. Then let m be the number of ways we can rearrange ourselves so that each of us is in the same spot or within one spot of where we started, and no two people are ever in the same spot. If leaves a remainder of when divided by , how many possible values are there of k, where is at least and at most ?"
Find the answer to Nori's problem.
Problem 98
Convex quadrilateral 
has side-lengths 
, and there exists a circle, lying inside the quadrilateral and having center I, that is tangent to all four sides of the quadrilateral. Points and are on the midpoints of 
and 
respectively. It can be proven that point I always lies on segment . Supposing further that I is the midpoint of , the area of quadrilateral may be expressed as 
, where and are positive integers and is not divisible by the square of any prime. Compute 
.
Problem 99
Given a convex, -sided polygon , form a 
-sided polygon 
by cutting off each corner of at the edges’ trisection points. In other words, is the polygon whose vertices are the edge trisection points of , connected in order around the boundary of . Let 
be an isosceles trapezoid with side lengths 
, and , and for each 
, let 
. This iterative clipping process approaches a limiting shape 
. If the difference of the areas of 
and 
is written as a fraction 
in lowest terms, calculate the number of positive integer factors of 
.
Problem 100
Let 
be a root of 
, and call two polynomials and with integer coefficients 
if 
. It is known that every such polynomial is equivalent to exactly one of 
. Find the largest integer 
for which there exists a polynomial such that 
is equivalent to 
.
See Also
| 2008 iTest (Problems) | ||
| Preceded by: 2007 iTest |
Followed by: Last iTest | |
| 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 • 61 • 62 • 63 • 64 • 65 • 66 • 67 • 68 • 69 • 70 • 71 • 72 • 73 • 74 • 75 • 76 • 77 • 78 • 79 • 80 • 81 • 82 • 83 • 84 • 85 • 86 • 87 • 88 • 89 • 90 • 91 • 92 • 93 • 94 • 95 • 96 • 97 • 98 • 99 • 100 | ||
