Difference between revisions of "2007 iTest Problems"
(→Problem 13) |
Skatingkitty (talk | contribs) (→Problem 21) |
||
(71 intermediate revisions by 16 users not shown) | |||
Line 37: | Line 37: | ||
[[2007 iTest Problems/Problem 5|Solution]] | [[2007 iTest Problems/Problem 5|Solution]] | ||
+ | |||
===Problem 6=== | ===Problem 6=== | ||
Find the units digit of the sum | Find the units digit of the sum | ||
Line 72: | Line 73: | ||
[[2007 iTest Problems/Problem 10|Solution]] | [[2007 iTest Problems/Problem 10|Solution]] | ||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
===Problem 12=== | ===Problem 12=== | ||
Line 94: | Line 78: | ||
My Frisbee group often calls "best of five" to finish our games when it's getting dark, since we don't keep score. | My Frisbee group often calls "best of five" to finish our games when it's getting dark, since we don't keep score. | ||
The game ends after one of the two teams scores three points (total, not necessarily consecutive). | The game ends after one of the two teams scores three points (total, not necessarily consecutive). | ||
− | If every possible sequence of scores is equally likely, what is the expected score of the losing team | + | If every possible sequence of scores is equally likely, what is the expected score of the losing team? |
<math>\text{(A) }\frac{2}{3}\qquad | <math>\text{(A) }\frac{2}{3}\qquad | ||
Line 132: | Line 116: | ||
===Problem 14=== | ===Problem 14=== | ||
+ | |||
+ | Let <math>\phi(n)</math> be the number of positive integers <math>k< n</math> which are relatively prime to <math>n</math>. For how many distinct values of <math>n</math> is <math>\phi(n)=12</math>? | ||
+ | |||
+ | <math>\text{(A) } 0 \quad | ||
+ | \text{(B) } 1 \quad | ||
+ | \text{(C) } 2 \quad | ||
+ | \text{(D) } 3 \quad | ||
+ | \text{(E) } 4 \quad | ||
+ | \text{(F) } 5 \quad | ||
+ | \text{(G) } 6 \quad | ||
+ | \text{(H) } 7 \quad | ||
+ | \text{(I) } 8 \quad | ||
+ | \text{(J) } 9 \quad | ||
+ | \text{(K) } 10 \quad | ||
+ | \text{(L) } 11 \quad | ||
+ | \text{(M) } 12\quad | ||
+ | \text{(N) } 13\quad </math> | ||
+ | |||
+ | [[2007 iTest Problems/Problem 14|Solution]] | ||
===Problem 15=== | ===Problem 15=== | ||
+ | |||
+ | Form a pentagon by taking a square of side length 1 and an equilateral triangle of side length 1, and | ||
+ | placing the triangle so that one of its sides coincides with a side of the square. Then "circumscribe" a circle around the | ||
+ | pentagon, passing through three of its vertices, so that the circle passes through exactly one of the vertices of the | ||
+ | equilateral triangle, and through exactly two vertices of the square. What is the radius of the circle? | ||
+ | |||
+ | <math>\text{(A) }\frac{2}{3}\qquad | ||
+ | \text{(B) }\frac{3}{4}\qquad | ||
+ | \text{(C) }1\qquad | ||
+ | \text{(D) }\frac{5}{4}\qquad | ||
+ | \text{(E) }\frac{4}{3}\qquad | ||
+ | \text{(F) }\frac{\sqrt{2}}{2}\qquad | ||
+ | \text{(G) }\frac{\sqrt{3}}{2}\qquad | ||
+ | \text{(H) }\sqrt{2}\qquad</math> | ||
+ | |||
+ | <math>\text{(I) }\sqrt{3}\qquad | ||
+ | \text{(J) }\frac{1+\sqrt{3}}{2}\qquad | ||
+ | \text{(K) }\frac{2+\sqrt{6}}{2}\qquad | ||
+ | \text{(L) }\frac{7}{6}\qquad | ||
+ | \text{(M) }\frac{2+\sqrt{6}}{4}\qquad | ||
+ | \text{(N) }\frac{4}{5}\qquad | ||
+ | \text{(O) }2007\qquad</math> | ||
+ | |||
+ | |||
+ | [[2007 iTest Problems/Problem 15|Solution]] | ||
===Problem 16=== | ===Problem 16=== | ||
+ | How many lattice points lie within or on the border of the circle in the <math>xy</math>-plane defined by the equation | ||
+ | <cmath>x^2+y^2=100</cmath> | ||
+ | |||
+ | <math>\text{(A) }1\qquad | ||
+ | \text{(B) }2\qquad | ||
+ | \text{(C) }4\qquad | ||
+ | \text{(D) }5\qquad | ||
+ | \text{(E) }41\qquad | ||
+ | \text{(F) }42\qquad | ||
+ | \text{(G) }69\qquad | ||
+ | \text{(H) }76\qquad | ||
+ | \text{(I) }130\qquad \\ | ||
+ | \text{(J) }133\qquad | ||
+ | \text{(K) }233\qquad | ||
+ | \text{(L) }311\qquad | ||
+ | \text{(M) }317\qquad | ||
+ | \text{(N) }420\qquad | ||
+ | \text{(O) }520\qquad | ||
+ | \text{(P) }2007</math> | ||
+ | |||
+ | |||
+ | [[2007 iTest Problems/Problem 16|Solution]] | ||
===Problem 17=== | ===Problem 17=== | ||
+ | If <math>x</math> and <math>y</math> are acute angles such that <math>x+y=\frac{\pi}{4}</math> and <math>\tan{y}=\frac{1}{6}</math>, find the value of <math>\tan{x}</math>. | ||
+ | |||
+ | <math>\text{(A) }\frac{37\sqrt{2}-18}{71}\qquad | ||
+ | \text{(B) }\frac{35\sqrt{2}-6}{71}\qquad | ||
+ | \text{(C) }\frac{35\sqrt{3}+12}{33}\qquad | ||
+ | \text{(D) }\frac{37\sqrt{3}+24}{33}\qquad | ||
+ | \text{(E) }1\qquad</math> | ||
+ | |||
+ | <math>\text{(F) }\frac{5}{7}\qquad | ||
+ | \text{(G) }\frac{3}{7}\qquad | ||
+ | \text{(H) }6\qquad | ||
+ | \text{(I) }\frac{1}{6}\qquad | ||
+ | \text{(J) }\frac{1}{2}\qquad | ||
+ | \text{(K) }\frac{6}{7}\qquad | ||
+ | \text{(L) }\frac{4}{7}\qquad</math> | ||
+ | <math>\text{(M) }\sqrt{3}\qquad | ||
+ | \text{(N) }\frac{\sqrt{3}}{3}\qquad | ||
+ | \text{(O) }\frac{5}{6}\qquad | ||
+ | \text{(P) }\frac{2}{3}\qquad | ||
+ | \text{(Q) }\frac{1}{2007}\qquad</math> | ||
+ | |||
+ | |||
+ | [[2007 iTest Problems/Problem 17|Solution]] | ||
===Problem 18=== | ===Problem 18=== | ||
+ | Suppose that <math>x^3+px^2+qx+r</math> is a cubic with a double root at <math>a</math> and another root at b, where <math>a</math> and <math>b</math> are real numbers. | ||
+ | If <math>p=-6</math> and <math>q=9</math>, what is <math>r</math>? | ||
+ | |||
+ | <math>\text{(A) }0\qquad | ||
+ | \text{(B) }4\qquad | ||
+ | \text{(C) }108\qquad | ||
+ | \text{(D) It could be }0 \text{ or } 4\qquad | ||
+ | \text{(E) It could be }0 \text{ or } 108</math> | ||
+ | |||
+ | <math>\text{(F) }18\qquad | ||
+ | \text{(G) }-4\qquad | ||
+ | \text{(H) }-108\qquad | ||
+ | \text{(I) It could be } 0 \text{ or } -4</math> | ||
+ | |||
+ | <math>\text{(J) It could be } 0 \text{ or } {-108} \qquad | ||
+ | \text{(K) It could be } 4 \text{ or } {-4}\qquad | ||
+ | \text{(L) There is no such value of } r\qquad</math> | ||
+ | |||
+ | <math>\text{(M) } 1 \qquad | ||
+ | \text{(N) } {-2} \qquad | ||
+ | \text{(O) It could be } 4 \text{ or } -4 \qquad | ||
+ | \text{(P) It could be } 0 \text{ or } -2 \qquad</math> | ||
+ | |||
+ | <math>\text{(Q) It could be } 2007 \text{ or a yippy dog} \qquad | ||
+ | \text{(R) } 2007</math> | ||
− | + | ||
+ | [[2007 iTest Problems/Problem 18|Solution]] | ||
+ | |||
+ | |||
+ | |||
+ | <math>\textbf{(A) }0\qquad | ||
+ | \textbf{(B) }\dfrac1{10}\qquad | ||
+ | \textbf{(C) }\dfrac18\qquad | ||
+ | \textbf{(D) }\dfrac15\qquad | ||
+ | \textbf{(E) }\dfrac14\qquad | ||
+ | \textbf{(F) }\dfrac13\qquad | ||
+ | \textbf{(G) }\dfrac25\qquad</math> | ||
+ | <math>\textbf{(H) }\dfrac12\qquad | ||
+ | \textbf{(I) }\dfrac35\qquad | ||
+ | \textbf{(J) }\dfrac23\qquad | ||
+ | \textbf{(K) }\dfrac45\qquad | ||
+ | \textbf{(L) }1\qquad | ||
+ | \textbf{(M) }\dfrac54\qquad</math> | ||
+ | <math>\textbf{(N) }\dfrac43\qquad | ||
+ | \textbf{(O) }\dfrac32\qquad | ||
+ | \textbf{(P) }2\qquad | ||
+ | \textbf{(Q) }3\qquad | ||
+ | \textbf{(R) }4\qquad | ||
+ | \textbf{(S) }2007</math> | ||
+ | |||
+ | |||
+ | [[2007 iTest Problems/Problem 19|Solution]] | ||
===Problem 20=== | ===Problem 20=== | ||
− | + | Find the largest integer <math>n</math> such that <math>2007^{1024}-1</math> is divisible by <math>2^n</math> | |
+ | |||
+ | <math>\text{(A) } 1\qquad | ||
+ | \text{(B) } 2\qquad | ||
+ | \text{(C) } 3\qquad | ||
+ | \text{(D) } 4\qquad | ||
+ | \text{(E) } 5\qquad | ||
+ | \text{(F) } 6\qquad | ||
+ | \text{(G) } 7\qquad | ||
+ | \text{(H) } 8\qquad</math> | ||
+ | <math>\text{(I) } 9\qquad | ||
+ | \text{(J) } 10\qquad | ||
+ | \text{(K) } 11\qquad | ||
+ | \text{(L) } 12\qquad | ||
+ | \text{(M) } 13\qquad | ||
+ | \text{(N) } 14\qquad | ||
+ | \text{(O) } 15\qquad | ||
+ | \text{(P) } 16\qquad</math> | ||
+ | <math>\text{(Q) } 55\qquad | ||
+ | \text{(R) } 63\qquad | ||
+ | \text{(S) } 64\qquad | ||
+ | \text{(T) } 2007\qquad</math> | ||
+ | |||
+ | |||
+ | [[2007 iTest Problems/Problem 20|Solution]] | ||
+ | |||
+ | NO SOLUTION HERE! PLEASE TRY AGAIN NEXT TIME | ||
===Problem 22=== | ===Problem 22=== | ||
+ | Find the value of <math>c</math> such that the system of equations | ||
+ | <cmath> |x+y|=2007</cmath> | ||
+ | <cmath>|x-y|=c</cmath> | ||
+ | has exactly two solutions <math>(x,y)</math> in real numbers. | ||
+ | |||
+ | |||
+ | <math>\text{(A) } 0 \quad | ||
+ | \text{(B) } 1 \quad | ||
+ | \text{(C) } 2 \quad | ||
+ | \text{(D) } 3 \quad | ||
+ | \text{(E) } 4 \quad | ||
+ | \text{(F) } 5 \quad | ||
+ | \text{(G) } 6 \quad | ||
+ | \text{(H) } 7 \quad | ||
+ | \text{(I) } 8 \quad | ||
+ | \text{(J) } 9 \quad | ||
+ | \text{(K) } 10 \quad | ||
+ | \text{(L) } 11 \quad | ||
+ | \text{(M) } 12 \quad</math> | ||
+ | |||
+ | <math>\text{(N) } 13 \quad | ||
+ | \text{(O) } 14 \quad | ||
+ | \text{(P) } 15 \quad | ||
+ | \text{(Q) } 16 \quad | ||
+ | \text{(R) } 17 \quad | ||
+ | \text{(S) } 18 \quad | ||
+ | \text{(T) } 223 \quad | ||
+ | \text{(U) } 678 \quad | ||
+ | \text{(V) } 2007 \quad </math> | ||
+ | |||
+ | |||
+ | [[2007 iTest Problems/Problem 22|Solution]] | ||
===Problem 23=== | ===Problem 23=== | ||
+ | Find the product of the non-real roots of the equation | ||
+ | <cmath>(x^2-3x)^2+5(x^2-3x)+6=0</cmath> | ||
+ | |||
+ | <math>\text{(A) } 0\quad | ||
+ | \text{(B) } 1\quad | ||
+ | \text{(C) } -1\quad | ||
+ | \text{(D) } 2\quad | ||
+ | \text{(E) } -2\quad | ||
+ | \text{(F) } 3\quad | ||
+ | \text{(G) } -3\quad | ||
+ | \text{(H) } 4\quad | ||
+ | \text{(I) } -4\quad</math> | ||
+ | |||
+ | <math>\text{(J) } 5\quad | ||
+ | \text{(K) } -5\quad | ||
+ | \text{(L) } 6\quad | ||
+ | \text{(M) } -6\quad | ||
+ | \text{(N) } 3+2i\quad | ||
+ | \text{(O) } 3-2i\quad</math> | ||
+ | |||
+ | <math>\text{(P) } \frac{-3+i\sqrt{3}}{2}\quad | ||
+ | \text{(Q) } 8\quad | ||
+ | \text{(R) } -8\qquad | ||
+ | \text{(S) } 12\quad | ||
+ | \text{(T) } -12\quad | ||
+ | \text{(U) } 42\quad</math> | ||
+ | |||
+ | <math>\text{(V) Ying} \quad | ||
+ | \text{(W) } 207</math> | ||
+ | |||
+ | |||
+ | [[2007 iTest Problems/Problem 23|Solution]] | ||
===Problem 24=== | ===Problem 24=== | ||
+ | Let <math>N</math> be the smallest positive integer such that <math>2008N</math> is a perfect square and <math>2007N</math> is a perfect cube. | ||
+ | Find the remainder when <math>N</math> is divided by <math>25</math>. | ||
+ | |||
+ | <math>\text{(A) }0 \quad | ||
+ | \text{(B) }1 \quad | ||
+ | \text{(C) }2 \quad | ||
+ | \text{(D) }3 \quad | ||
+ | \text{(E) }4 \quad | ||
+ | \text{(F) }5 \quad | ||
+ | \text{(G) }6 \quad | ||
+ | \text{(H) }7 \quad | ||
+ | \text{(I) } 8\quad</math> | ||
+ | |||
+ | <math>\text{(J) }9 \quad | ||
+ | \text{(K) }10 \quad | ||
+ | \text{(L) }11 \quad | ||
+ | \text{(M) }12 \quad | ||
+ | \text{(N) }13 \quad | ||
+ | \text{(O) }14 \quad | ||
+ | \text{(P) }15 \quad | ||
+ | \text{(Q) }16 \quad</math> | ||
+ | |||
+ | <math>\text{(R) }17 \quad | ||
+ | \text{(S) }18 \quad | ||
+ | \text{(T) }19 \quad | ||
+ | \text{(U) }20 \quad | ||
+ | \text{(V) }21 \quad | ||
+ | \text{(W) }22 \quad | ||
+ | \text{(X) }23 </math> | ||
+ | |||
+ | |||
+ | [[2007 iTest Problems/Problem 24|Solution]] | ||
===Problem 25=== | ===Problem 25=== | ||
+ | Ted's favorite number is equal to | ||
+ | <cmath>1\cdot{2007\choose 1}+2\cdot {2007\choose 2}+3\cdot {2007\choose 3} + \cdots + 2007\cdot {2007 \choose 2007}</cmath> | ||
+ | |||
+ | Find the remainder when Ted's favorite number is divided by 25. | ||
+ | |||
+ | <math>\text{(A) } 0\qquad | ||
+ | \text{(B) } 1\qquad | ||
+ | \text{(C) } 2\qquad | ||
+ | \text{(D) } 3\qquad | ||
+ | \text{(E) } 4\qquad | ||
+ | \text{(F) } 5\qquad | ||
+ | \text{(G) } 6\qquad | ||
+ | \text{(H) } 7\qquad | ||
+ | \text{(I) } 8\qquad</math> | ||
+ | |||
+ | <math>\text{(J) } 9\qquad | ||
+ | \text{(K) } 10\qquad | ||
+ | \text{(L) } 11\qquad | ||
+ | \text{(M) } 12\qquad | ||
+ | \text{(N) } 13\qquad | ||
+ | \text{(O) } 14\qquad | ||
+ | \text{(P) } 15\qquad | ||
+ | \text{(Q) } 16\qquad</math> | ||
+ | |||
+ | <math>\text{(R) } 17\qquad | ||
+ | \text{(S) } 18\qquad | ||
+ | \text{(T) } 19\qquad | ||
+ | \text{(U) } 20\qquad | ||
+ | \text{(V) } 21\qquad | ||
+ | \text{(W) } 22\qquad | ||
+ | \text{(X) } 23\qquad | ||
+ | \text{(Y) } 24</math> | ||
+ | |||
+ | |||
+ | [[2007 iTest Problems/Problem 25|Solution]] | ||
==Short Answer Section== | ==Short Answer Section== | ||
===Problem 26=== | ===Problem 26=== | ||
+ | |||
+ | Julie runs a website where she sells university themed clothing. On Monday, she sells thirteen Stanford sweatshirts and nine Harvard sweatshirts for a total of \$370. On Tuesday, she sells nine Stanford sweatshirts and two Harvard sweatshirts for a total of \$180. On Wednesday, she sells twelve Stanford sweatshirts and six Harvard sweatshirts. If Julie didn't change the prices of any items all week, how much money did she take in (total number of dollars) from the sale of Stanford and Harvard sweatshirts on Wednesday? | ||
+ | |||
+ | |||
+ | [[2007 iTest Problems/Problem 26|Solution]] | ||
===Problem 27=== | ===Problem 27=== | ||
+ | |||
+ | The face diagonal of a cube has length <math>4</math>. Find the value of n given that <math>n\sqrt2</math> is the <math>\textit{volume}</math> of the cube. | ||
+ | |||
+ | |||
+ | [[2007 iTest Problems/Problem 27|Solution]] | ||
===Problem 28=== | ===Problem 28=== | ||
+ | |||
+ | The space diagonal (interior diagonal) of a cube has length 6. Find the <math>\textit{surface area}</math> of the cube. | ||
+ | |||
+ | |||
+ | [[2007 iTest Problems/Problem 28|Solution]] | ||
===Problem 29=== | ===Problem 29=== | ||
+ | |||
+ | Let <math>S</math> be equal to the sum <math>1+2+3+\cdots+2007</math>. Find the remainder when <math>S</math> is divided by <math>1000</math>. | ||
+ | |||
+ | |||
+ | [[2007 iTest Problems/Problem 29|Solution]] | ||
===Problem 30=== | ===Problem 30=== | ||
+ | |||
+ | While working with some data for the Iowa City Hospital, James got up to get a drink of water. When he returned, his computer displayed the “blue screen of death” (it had crashed). While rebooting his computer, James remembered that he was nearly done with his calculations since the last time he saved his data. He also kicked himself for not saving before he got up from his desk. He had computed three positive integers <math>a, b</math>, and <math>c</math>, and recalled that their product is <math>24</math>, but he didn’t remember the values of the three integers themselves. What he really needed was their sum. He knows that the sum is an even two-digit integer less than <math>25</math> with fewer than <math>6</math> divisors. Help James by computing <math>a+b+c</math>. | ||
+ | |||
+ | |||
+ | [[2007 iTest Problems/Problem 30|Solution]] | ||
===Problem 31=== | ===Problem 31=== | ||
+ | |||
+ | Let <math>x</math> be the length of one side of a triangle and let y be the height to that side. If <math>x+y=418</math>, find the maximum possible <math>\textit{integral value}</math> of the area of the triangle. | ||
+ | |||
+ | |||
+ | [[2007 iTest Problems/Problem 31|Solution]] | ||
===Problem 32=== | ===Problem 32=== | ||
+ | |||
+ | When a rectangle frames a parabola such that a side of the rectangle is parallel to the parabola's axis of symmetry, the parabola divides the rectangle into regions whose areas are in the ratio <math>2</math> to <math>1</math>. How many integer values of k are there such that <math>0<k\leq 2007</math> and the area between the parabola <math>y=k-x^2</math> and the <math>x</math>-axis is an integer? | ||
+ | |||
+ | <asy> | ||
+ | import graph; | ||
+ | size(300); | ||
+ | defaultpen(linewidth(0.8)+fontsize(10)); | ||
+ | real k=1.5; | ||
+ | real endp=sqrt(k); | ||
+ | real f(real x) { | ||
+ | return k-x^2; | ||
+ | } | ||
+ | path parabola=graph(f,-endp,endp)--cycle; | ||
+ | filldraw(parabola, lightgray); | ||
+ | draw((endp,0)--(endp,k)--(-endp,k)--(-endp,0)); | ||
+ | label("Region I", (0,2*k/5)); | ||
+ | label("Box II", (51/64*endp,13/16*k)); | ||
+ | label("area(I) = $\frac23$\,area(II)",(5/3*endp,k/2));</asy> | ||
+ | |||
+ | |||
+ | [[2007 iTest Problems/Problem 32|Solution]] | ||
===Problem 33=== | ===Problem 33=== | ||
+ | |||
+ | How many <math>\textit{odd}</math> four-digit integers have the property that their digits, read left to right, are in strictly decreasing order? | ||
+ | |||
+ | |||
+ | [[2007 iTest Problems/Problem 33|Solution]] | ||
===Problem 34=== | ===Problem 34=== | ||
+ | |||
+ | Let <math>a/b</math> be the probability that a randomly selected divisor of <math>2007</math> is a multiple of <math>3</math>. If <math>a</math> and <math>b</math> are relatively prime positive integers, find <math>a+b</math>. | ||
+ | |||
+ | |||
+ | [[2007 iTest Problems/Problem 34|Solution]] | ||
===Problem 35=== | ===Problem 35=== | ||
+ | |||
+ | Find the greatest natural number possessing the property that each of its digits except the first and last one is less than the arithmetic mean of the two neighboring digits. | ||
+ | |||
+ | |||
+ | [[2007 iTest Problems/Problem 35|Solution]] | ||
===Problem 36=== | ===Problem 36=== | ||
+ | |||
+ | Let b be a real number randomly selected from the interval <math>[-17,17]</math>. Then, m and n are two relatively prime positive integers such that m/n is the probability that the equation <math>x^4+25b^2=(4b^2-10b)x^2</math> has <math>\textit{at least}</math> two distinct real solutions. Find the value of <math>m+n</math>. | ||
+ | |||
+ | |||
+ | [[2007 iTest Problems/Problem 36|Solution]] | ||
===Problem 37=== | ===Problem 37=== | ||
+ | |||
+ | Rob is helping to build the set for a school play. For one scene, he needs to build a multi-colored tetrahedron out of cloth and bamboo. He begins by fitting three lengths of bamboo together, such that they meet at the same point, and each pair of bamboo rods meet at a right angle. Three more lengths of bamboo are then cut to connect the other ends of the first three rods. Rob then cuts out four triangular pieces of fabric: a blue piece, a red piece, a green piece, and a yellow piece. These triangular pieces of fabric just fill in the triangular spaces between the bamboo, making up the four faces of the tetrahedron. The areas in square feet of the red, yellow, and green pieces are <math>60, 20</math>, and <math>15</math> respectively. If the blue piece is the largest of the four sides, find the number of square feet in its area. | ||
+ | |||
+ | |||
+ | [[2007 iTest Problems/Problem 37|Solution]] | ||
===Problem 38=== | ===Problem 38=== | ||
+ | |||
+ | Find the largest positive integer that is equal to the cube of the sum of its digits. | ||
+ | |||
+ | |||
+ | [[2007 iTest Problems/Problem 38|Solution]] | ||
===Problem 39=== | ===Problem 39=== | ||
+ | |||
+ | Let a and b be relatively prime positive integers such that a/b is the sum of the real solutions to the equation <math>\sqrt[3]{3x-4}+\sqrt[3]{5x-6}=\sqrt[3]{x-2}+\sqrt[3]{7x-8}</math>. Find <math>a+b</math>. | ||
+ | |||
+ | |||
+ | [[2007 iTest Problems/Problem 39|Solution]] | ||
===Problem 40=== | ===Problem 40=== | ||
+ | |||
+ | Let <math>S</math> be the sum of all <math>x</math> such that <math>1\leq x\leq 99</math> and <math>\{x^2\}=\{x\}^2</math>. Compute <math>\lfloor S\rfloor</math>. | ||
+ | |||
+ | |||
+ | [[2007 iTest Problems/Problem 40|Solution]] | ||
===Problem 41=== | ===Problem 41=== | ||
+ | |||
+ | The sequence of digits <math>123456789101112131415161718192021\ldots</math> is obtained by writing the positive integers in order. If the <math>10^{nth}</math> digit in this sequence occurs in the part of the sequence in which the m-digit numbers are placed, define <math>f(n)</math> to be <math>m</math>. For example, <math>f(2) = 2</math> because the <math>100^{\text{th}}</math> digit enters the sequence in the placement of the two-digit integer <math>55</math>. Find the value of <math>f(2007)</math>. | ||
+ | |||
+ | [[2007 iTest Problems/Problem 41|Solution]] | ||
===Problem 42=== | ===Problem 42=== | ||
+ | |||
+ | During a movie shoot, a stuntman jumps out of a plane and parachutes to safety within a <math>100</math> foot by <math>100</math> foot square field, which is entirely surrounded by a wooden fence. There is a flag pole in the middle of the square field. Assuming the stuntman is equally likely to land on any point in the field, the probability that he lands closer to the fence than to the flag pole can be written in simplest terms as <math>\dfrac{a-b\sqrt c}d</math>, where all four variables are positive integers, <math>c</math> is a multple of no perfect square greater than <math>1</math>, a is coprime with <math>d</math>, and <math>b</math> is coprime with <math>d</math>. Find the value of <math>a+b+c+d</math>. | ||
+ | |||
+ | |||
+ | [[2007 iTest Problems/Problem 42|Solution]] | ||
===Problem 43=== | ===Problem 43=== | ||
+ | |||
+ | Bored of working on her computational linguistics thesis, Erin enters some three-digit integers into a spreadsheet, then manipulates the cells a bit until her spreadsheet calculates each of the following <math>100</math> <math>9</math>-digit integers: | ||
+ | |||
+ | <cmath>\begin{align*}700\cdot 712\,\cdot\, &718+320,\\701\cdot 713\,\cdot\, &719+320,\\ 702\cdot 714\,\cdot\, &720+320,\\&\vdots\\798\cdot 810\,\cdot\, &816+320,\\799\cdot 811\,\cdot\, &817+320.\end{align*} </cmath> | ||
+ | |||
+ | She notes that two of them have exactly <math>8</math> positive divisors each. Find the common prime divisor of those two integers. | ||
+ | |||
+ | [[2007 iTest Problems/Problem 43|Solution]] | ||
===Problem 44=== | ===Problem 44=== | ||
+ | |||
+ | A positive integer <math>n</math> between <math>1</math> and <math>N=2007^{2007}</math> inclusive is selected at random. If <math>a</math> and <math>b</math> are natural numbers such that <math>a/b</math> is the probability that <math>N</math> and <math>n^3-36n</math> are relatively prime, find the value of <math>a+b</math>. | ||
+ | |||
+ | [[2007 iTest Problems/Problem 44|Solution]] | ||
===Problem 45=== | ===Problem 45=== | ||
+ | |||
+ | Find the sum of all positive integers <math>B</math> such that <math>(111)_B=(aabbcc)_6</math>, where <math>a,b,c</math> represent distinct base <math>6</math> digits, <math>a\neq 0</math>. | ||
+ | |||
+ | [[2007 iTest Problems/Problem 45|Solution]] | ||
===Problem 46=== | ===Problem 46=== | ||
+ | |||
+ | Let <math>(x,y,z)</math> be an ordered triplet of real numbers that satisfies the following system of equations: | ||
+ | <cmath>\begin{align*}x+y^2+z^4&=0,\\y+z^2+x^4&=0,\\z+x^2+y^4&=0.\end{align*}</cmath> | ||
+ | If <math>m</math> is the minimum possible value of <math>\lfloor x^3+y^3+z^3\rfloor</math>, find the modulo <math>2007</math> residue of <math>m</math>. | ||
+ | |||
+ | [[2007 iTest Problems/Problem 46|Solution]] | ||
===Problem 47=== | ===Problem 47=== | ||
+ | |||
+ | Let <math>\{X_n\}</math> and <math>\{Y_n\}</math> be sequences defined as follows: <math>X_0=Y_0=X_1=Y_1=1</math>, | ||
+ | |||
+ | <cmath>\begin{align*}X_{n+1}&=X_n+2X_{n-1}\qquad(n=1,2,3\ldots),\\ | ||
+ | Y_{n+1}&=3Y_n+4Y_{n-1}\qquad(n=1,2,3\ldots).\end{align*}</cmath> | ||
+ | |||
+ | Let <math>k</math> be the largest integer that satisfies all of the following conditions: <math>|X_i-k|\leq 2007</math>, for some positive integer <math>i</math>; | ||
+ | <math>|Y_j-k|\leq 2007</math>, for some positive integer <math>j</math>; and | ||
+ | <math>k<10^{2007}</math>. | ||
+ | Find the remainder when <math>k</math> is divided by <math>2007</math>. | ||
+ | |||
+ | [[2007 iTest Problems/Problem 47|Solution]] | ||
===Problem 48=== | ===Problem 48=== | ||
+ | |||
+ | Let a and b be relatively prime positive integers such that <math>a/b</math> is the maximum possible value of <math>\sin^2x_1+\sin^2x_2+\sin^2x_3+\cdots+\sin^2x_{2007}</math>, where, for <math>1\leq i\leq 2007, x_i</math> is a nonnegative real number, and <math>x_1+x_2+x_3+\cdots+x_{2007}=\pi</math>. Find the value of <math>a+b</math>. | ||
+ | |||
+ | [[2007 iTest Problems/Problem 48|Solution]] | ||
===Problem 49=== | ===Problem 49=== | ||
+ | |||
+ | How many <math>7</math>-element subsets of <math>\{1, 2, 3,\ldots , 14\}</math> are there, the sum of whose elements is divisible by <math>14</math>? | ||
+ | |||
+ | [[2007 iTest Problems/Problem 49|Solution]] | ||
===Problem 50=== | ===Problem 50=== | ||
− | ==Ultimate | + | A block <math>Z</math> is formed by gluing one face of a solid cube with side length <math>6</math> onto one of the circular faces of a right circular cylinder with radius <math>10</math> and height <math>3</math> so that the centers of the square and circle coincide. If <math>V</math> is the smallest convex region that contains <math>Z</math>, calculate <math>\lfloor\operatorname{vol}V\rfloor</math> (the greatest integer less than or equal to the volume of <math>V</math>). |
+ | |||
+ | [[2007 iTest Problems/Problem 50|Solution]] | ||
+ | |||
+ | ==Ultimate Questions== | ||
+ | In the next 10 problems, the problem after will require the answer of the current problem. TNFTPP stands for the number from the previous problem. | ||
+ | |||
+ | For those who want to try these problems without having to find the T-values of the previous problem, a link will be [[2007 iTest Problems/Ultimate Question|here]]. Also, all solutions will have the T-values substituted. | ||
===Problem 51=== | ===Problem 51=== | ||
+ | Find the highest point (largest possible <math>y</math>-coordinate) on the parabola | ||
+ | <cmath>y=-2x^2+ 28x+ 418</cmath> | ||
+ | |||
+ | [[2007 iTest Problems/Problem 51|Solution]] | ||
===Problem 52=== | ===Problem 52=== | ||
+ | Let <math>T=TNFTPP</math>. Let <math>R</math> be the region consisting of points <math>(x,y)</math> of the Cartesian plane satisfying both | ||
+ | <math>|x|-|y|\le T-500</math> and <math>|y|\le T-500</math>. Find the area of region <math>R</math>. | ||
+ | |||
+ | [[2007 iTest Problems/Problem 52|Solution]] | ||
===Problem 53=== | ===Problem 53=== | ||
+ | Let <math>T=\text{TNFTPP}</math>. Three distinct positive Fibonacci numbers, all greater than <math>T</math>, are in arithmetic progression. Let <math>N</math> be the smallest possible value of their sum. Find the remainder when <math>N</math> is divided by <math>2007</math>. | ||
+ | |||
+ | [[2007 iTest Problems/Problem 53|Solution]] | ||
===Problem 54=== | ===Problem 54=== | ||
+ | Let <math>T=\text{TNFTPP}</math>. Consider the sequence <math>(1, 2007)</math>. Inserting the difference between <math>1</math> and <math>2007</math> between them, we get the sequence <math>(1, 2006, 2007)</math>. Repeating the process of inserting differences between numbers, we get the sequence <math>(1, 2005, 2006, 1, 2007)</math>. A third iteration of this process results in <math>(1, 2004, 2005, 1, 2006, 2005, 1, 2006, 2007)</math>. A total of <math>2007</math> iterations produces a sequence with <math>2^{2007}+1</math> terms. If the integer <math>4T</math> (that is, <math>4</math> times the integer <math>T</math>) appears a total of <math>N</math> times among these <math>2^{2007}+1</math> terms, find the remainder when <math>N</math> gets divided by <math>2007</math>. | ||
+ | |||
+ | [[2007 iTest Problems/Problem 54|Solution]] | ||
===Problem 55=== | ===Problem 55=== | ||
+ | Let <math>T=\text{TNFTPP}</math>, and let <math>R=T-914</math>. Let <math>x</math> be the smallest real solution of <math>3x^2+Rx+R=90x\sqrt{x+1}</math>. Find the value of <math>\lfloor x\rfloor</math>. | ||
+ | |||
+ | [[2007 iTest Problems/Problem 55|Solution]] | ||
===Problem 56=== | ===Problem 56=== | ||
+ | Let <math>T=\text{TNFTPP}</math>. In the binary expansion of <math>\dfrac{2^{2007}-1}{2^T-1}</math>, how many of the first <math>10,000</math> digits to the right of the radix point are <math>0</math>'s? | ||
+ | |||
+ | [[2007 iTest Problems/Problem 56|Solution]] | ||
===Problem 57=== | ===Problem 57=== | ||
+ | Let <math>T=\text{TNFTPP}</math>. How many positive integers are within <math>T</math> of exactly <math>\lfloor \sqrt T\rfloor</math> perfect squares? (Note: <math>0^2=0</math> is considered a perfect square.) | ||
+ | |||
+ | [[2007 iTest Problems/Problem 57|Solution]] | ||
===Problem 58=== | ===Problem 58=== | ||
+ | Let <math>T=\text{TNFTPP}</math>. For natural numbers <math>k,n\geq 2</math>, we define | ||
+ | <cmath>S(k,n)=\left\lfloor\frac{2^{n+1}+1}{2^{n-1}+1}\right\rfloor+\left\lfloor\frac{3^{n+1}+1}{3^{n-1}+1}\right\rfloor+\cdots+\left\lfloor\frac{k^{n+1}+1}{k^{n-1}+1}\right\rfloor</cmath> | ||
+ | Compute the value of <math>S(10,T+55)-S(10,55)+S(10,T-55)</math>. | ||
+ | |||
+ | [[2007 iTest Problems/Problem 58|Solution]] | ||
===Problem 59=== | ===Problem 59=== | ||
+ | Let <math>T=\text{TNFTPP}</math>. Fermi and Feynman play the game <math>\textit{Probabicloneme}</math> in which Fermi wins with probability <math>a/b</math>, where <math>a</math> and <math>b</math> are relatively prime positive integers such that <math>a/b<1/2</math>. The rest of the time Feynman wins (there are no ties or incomplete games). It takes a negligible amount of time for the two geniuses to play <math>\textit{Probabicloneme}</math> so they play many many times. Assuming they can play infinitely many games (eh, they're in Physicist Heaven, we can bend the rules), the probability that they are ever tied in total wins after they start (they have the same positive win totals) is <math>(T-332)/(2T-601)</math>. Find the value of <math>a</math>. | ||
+ | |||
+ | [[2007 iTest Problems/Problem 59|Solution]] | ||
===Problem 60=== | ===Problem 60=== | ||
+ | Let <math>T=\text{TNFTPP}</math>. Triangle <math>ABC</math> has <math>AB=6T-3</math> and <math>AC=7T+1</math>. Point <math>D</math> is on <math>BC</math> so that <math>AD</math> bisects angle <math>BAC</math>. The circle through <math>A, B</math>, and <math>D</math> has center <math>O_1</math> and intersects line <math>AC</math> again at <math>B'</math>, and likewise the circle through <math>A, C</math>, and <math>D</math> has center <math>O_2</math> and intersects line <math>AB</math> again at <math>C'</math>. If the four points <math>B', C', O_1</math>, and <math>O_2</math> lie on a circle, find the length of <math>BC</math>. | ||
+ | |||
+ | [[2007 iTest Problems/Problem 60|Solution]] | ||
== Tiebreaker Questions == | == Tiebreaker Questions == | ||
Line 252: | Line 716: | ||
[[2007 iTest Problems/Problem TB4|Solution]] | [[2007 iTest Problems/Problem TB4|Solution]] | ||
+ | ==See Also== | ||
+ | * [[iTest Problems and Solutions]] | ||
− | {{ | + | {{iTest box|year=2007|before=[[2006 iTest]]|after=[[2008 iTest]]}} |
Latest revision as of 22:00, 8 May 2024
Contents
- 1 Multiple Choice Section
- 1.1 Problem 1
- 1.2 Problem 2
- 1.3 Problem 3
- 1.4 Problem 4
- 1.5 Problem 5
- 1.6 Problem 6
- 1.7 Problem 7
- 1.8 Problem 8
- 1.9 Problem 9
- 1.10 Problem 10
- 1.11 Problem 12
- 1.12 Problem 13
- 1.13 Problem 14
- 1.14 Problem 15
- 1.15 Problem 16
- 1.16 Problem 17
- 1.17 Problem 18
- 1.18 Problem 20
- 1.19 Problem 22
- 1.20 Problem 23
- 1.21 Problem 24
- 1.22 Problem 25
- 2 Short Answer Section
- 2.1 Problem 26
- 2.2 Problem 27
- 2.3 Problem 28
- 2.4 Problem 29
- 2.5 Problem 30
- 2.6 Problem 31
- 2.7 Problem 32
- 2.8 Problem 33
- 2.9 Problem 34
- 2.10 Problem 35
- 2.11 Problem 36
- 2.12 Problem 37
- 2.13 Problem 38
- 2.14 Problem 39
- 2.15 Problem 40
- 2.16 Problem 41
- 2.17 Problem 42
- 2.18 Problem 43
- 2.19 Problem 44
- 2.20 Problem 45
- 2.21 Problem 46
- 2.22 Problem 47
- 2.23 Problem 48
- 2.24 Problem 49
- 2.25 Problem 50
- 3 Ultimate Questions
- 4 Tiebreaker Questions
- 5 See Also
Multiple Choice Section
Problem 1
A twin prime pair is a set of two primes such that is greater than . What is the arithmetic mean of the two primes in the smallest twin prime pair?
Problem 2
Find if and satisfy and .
Problem 3
An abundant number is a natural number that's proper divisors sum is greater than the number. Which one of the following natural numbers is an abundant number?
Problem 4
Star flips a quarter four times. Find the probability that the quarter lands heads exactly twice.
Problem 5
Compute the sum of all twenty-one terms of the geometric series .
Problem 6
Find the units digit of the sum
Problem 7
An equilateral triangle with side length has the same area as a square with side length . Find .
Problem 8
Joe is right at the middle of a train tunnel and he realizes that a train is coming. The train travels at a speed of 50 miles per hour, and Joe can run at a speed of 10 miles per hour. Joe hears the train whistle when the train is a half mile from the point where it will enter the tunnel. At that point in time, Joe can run toward the train and just exit the tunnel as the train meets him. Instead, Joe runs away from the train when he hears the whistle. How many seconds does he have to spare (before the train is upon him) when he gets to the tunnel entrance?
Problem 9
Suppose that and are positive integers such that , the geometric mean of and is greater than , and the arithmetic mean of and is less than . How many pairs satisfy these conditions?
Problem 10
My grandparents are Arthur, Bertha, Christoph, and Dolores. My oldest grandparent is only years older than my youngest grandparent. Each grandfather is two years older than his wife. If Bertha is younger than Dolores, what is the difference between Bertha’s age and the mean of my grandparents’ ages?
Problem 12
My Frisbee group often calls "best of five" to finish our games when it's getting dark, since we don't keep score. The game ends after one of the two teams scores three points (total, not necessarily consecutive). If every possible sequence of scores is equally likely, what is the expected score of the losing team?
Problem 13
What is the smallest positive integer such that the number ends in two zeros?
Problem 14
Let be the number of positive integers which are relatively prime to . For how many distinct values of is ?
Problem 15
Form a pentagon by taking a square of side length 1 and an equilateral triangle of side length 1, and placing the triangle so that one of its sides coincides with a side of the square. Then "circumscribe" a circle around the pentagon, passing through three of its vertices, so that the circle passes through exactly one of the vertices of the equilateral triangle, and through exactly two vertices of the square. What is the radius of the circle?
Problem 16
How many lattice points lie within or on the border of the circle in the -plane defined by the equation
Problem 17
If and are acute angles such that and , find the value of .
Problem 18
Suppose that is a cubic with a double root at and another root at b, where and are real numbers. If and , what is ?
Problem 20
Find the largest integer such that is divisible by
NO SOLUTION HERE! PLEASE TRY AGAIN NEXT TIME
Problem 22
Find the value of such that the system of equations has exactly two solutions in real numbers.
Problem 23
Find the product of the non-real roots of the equation
Problem 24
Let be the smallest positive integer such that is a perfect square and is a perfect cube. Find the remainder when is divided by .
Problem 25
Ted's favorite number is equal to
Find the remainder when Ted's favorite number is divided by 25.
Short Answer Section
Problem 26
Julie runs a website where she sells university themed clothing. On Monday, she sells thirteen Stanford sweatshirts and nine Harvard sweatshirts for a total of $370. On Tuesday, she sells nine Stanford sweatshirts and two Harvard sweatshirts for a total of $180. On Wednesday, she sells twelve Stanford sweatshirts and six Harvard sweatshirts. If Julie didn't change the prices of any items all week, how much money did she take in (total number of dollars) from the sale of Stanford and Harvard sweatshirts on Wednesday?
Problem 27
The face diagonal of a cube has length . Find the value of n given that is the of the cube.
Problem 28
The space diagonal (interior diagonal) of a cube has length 6. Find the of the cube.
Problem 29
Let be equal to the sum . Find the remainder when is divided by .
Problem 30
While working with some data for the Iowa City Hospital, James got up to get a drink of water. When he returned, his computer displayed the “blue screen of death” (it had crashed). While rebooting his computer, James remembered that he was nearly done with his calculations since the last time he saved his data. He also kicked himself for not saving before he got up from his desk. He had computed three positive integers , and , and recalled that their product is , but he didn’t remember the values of the three integers themselves. What he really needed was their sum. He knows that the sum is an even two-digit integer less than with fewer than divisors. Help James by computing .
Problem 31
Let be the length of one side of a triangle and let y be the height to that side. If , find the maximum possible of the area of the triangle.
Problem 32
When a rectangle frames a parabola such that a side of the rectangle is parallel to the parabola's axis of symmetry, the parabola divides the rectangle into regions whose areas are in the ratio to . How many integer values of k are there such that and the area between the parabola and the -axis is an integer?
Problem 33
How many four-digit integers have the property that their digits, read left to right, are in strictly decreasing order?
Problem 34
Let be the probability that a randomly selected divisor of is a multiple of . If and are relatively prime positive integers, find .
Problem 35
Find the greatest natural number possessing the property that each of its digits except the first and last one is less than the arithmetic mean of the two neighboring digits.
Problem 36
Let b be a real number randomly selected from the interval . Then, m and n are two relatively prime positive integers such that m/n is the probability that the equation has two distinct real solutions. Find the value of .
Problem 37
Rob is helping to build the set for a school play. For one scene, he needs to build a multi-colored tetrahedron out of cloth and bamboo. He begins by fitting three lengths of bamboo together, such that they meet at the same point, and each pair of bamboo rods meet at a right angle. Three more lengths of bamboo are then cut to connect the other ends of the first three rods. Rob then cuts out four triangular pieces of fabric: a blue piece, a red piece, a green piece, and a yellow piece. These triangular pieces of fabric just fill in the triangular spaces between the bamboo, making up the four faces of the tetrahedron. The areas in square feet of the red, yellow, and green pieces are , and respectively. If the blue piece is the largest of the four sides, find the number of square feet in its area.
Problem 38
Find the largest positive integer that is equal to the cube of the sum of its digits.
Problem 39
Let a and b be relatively prime positive integers such that a/b is the sum of the real solutions to the equation . Find .
Problem 40
Let be the sum of all such that and . Compute .
Problem 41
The sequence of digits is obtained by writing the positive integers in order. If the digit in this sequence occurs in the part of the sequence in which the m-digit numbers are placed, define to be . For example, because the digit enters the sequence in the placement of the two-digit integer . Find the value of .
Problem 42
During a movie shoot, a stuntman jumps out of a plane and parachutes to safety within a foot by foot square field, which is entirely surrounded by a wooden fence. There is a flag pole in the middle of the square field. Assuming the stuntman is equally likely to land on any point in the field, the probability that he lands closer to the fence than to the flag pole can be written in simplest terms as , where all four variables are positive integers, is a multple of no perfect square greater than , a is coprime with , and is coprime with . Find the value of .
Problem 43
Bored of working on her computational linguistics thesis, Erin enters some three-digit integers into a spreadsheet, then manipulates the cells a bit until her spreadsheet calculates each of the following -digit integers:
She notes that two of them have exactly positive divisors each. Find the common prime divisor of those two integers.
Problem 44
A positive integer between and inclusive is selected at random. If and are natural numbers such that is the probability that and are relatively prime, find the value of .
Problem 45
Find the sum of all positive integers such that , where represent distinct base digits, .
Problem 46
Let be an ordered triplet of real numbers that satisfies the following system of equations: If is the minimum possible value of , find the modulo residue of .
Problem 47
Let and be sequences defined as follows: ,
Let be the largest integer that satisfies all of the following conditions: , for some positive integer ; , for some positive integer ; and . Find the remainder when is divided by .
Problem 48
Let a and b be relatively prime positive integers such that is the maximum possible value of , where, for is a nonnegative real number, and . Find the value of .
Problem 49
How many -element subsets of are there, the sum of whose elements is divisible by ?
Problem 50
A block is formed by gluing one face of a solid cube with side length onto one of the circular faces of a right circular cylinder with radius and height so that the centers of the square and circle coincide. If is the smallest convex region that contains , calculate (the greatest integer less than or equal to the volume of ).
Ultimate Questions
In the next 10 problems, the problem after will require the answer of the current problem. TNFTPP stands for the number from the previous problem.
For those who want to try these problems without having to find the T-values of the previous problem, a link will be here. Also, all solutions will have the T-values substituted.
Problem 51
Find the highest point (largest possible -coordinate) on the parabola
Problem 52
Let . Let be the region consisting of points of the Cartesian plane satisfying both and . Find the area of region .
Problem 53
Let . Three distinct positive Fibonacci numbers, all greater than , are in arithmetic progression. Let be the smallest possible value of their sum. Find the remainder when is divided by .
Problem 54
Let . Consider the sequence . Inserting the difference between and between them, we get the sequence . Repeating the process of inserting differences between numbers, we get the sequence . A third iteration of this process results in . A total of iterations produces a sequence with terms. If the integer (that is, times the integer ) appears a total of times among these terms, find the remainder when gets divided by .
Problem 55
Let , and let . Let be the smallest real solution of . Find the value of .
Problem 56
Let . In the binary expansion of , how many of the first digits to the right of the radix point are 's?
Problem 57
Let . How many positive integers are within of exactly perfect squares? (Note: is considered a perfect square.)
Problem 58
Let . For natural numbers , we define Compute the value of .
Problem 59
Let . Fermi and Feynman play the game in which Fermi wins with probability , where and are relatively prime positive integers such that . The rest of the time Feynman wins (there are no ties or incomplete games). It takes a negligible amount of time for the two geniuses to play so they play many many times. Assuming they can play infinitely many games (eh, they're in Physicist Heaven, we can bend the rules), the probability that they are ever tied in total wins after they start (they have the same positive win totals) is . Find the value of .
Problem 60
Let . Triangle has and . Point is on so that bisects angle . The circle through , and has center and intersects line again at , and likewise the circle through , and has center and intersects line again at . If the four points , and lie on a circle, find the length of .
Tiebreaker Questions
Problem TB1
The sum of the digits of an integer is equal to the sum of the digits of three times that integer. Prove that the integer is a multiple of 9.
Problem TB2
Factor completely over integer coefficients the polynomial . Demonstrate that your factorization is complete.
Problem TB3
4014 boys and 4014 girls stand in a line holding hands, such that only the two people at the ends are not holding hands with exactly two people (an ordinary line of people). One of the two people at the ends gets tired of the hand-holding fest and leaves. Then, from the remaining line, one of the two people at the ends leaves. Then another from an end, and then another, and another. This continues until exactly half of the people from the original line remain. Prove that no matter what order the original 8028 people were standing in, that it is possible that exactly 2007 of the remaining people are girls.
Problem TB4
Circle is the circumcircle of non-isosceles triangle . The tangent lines to circle at points and intersect at , and the tangents at and intersect at . The external angle bisectors of triangle at and meet at and the external bisectors at and intersect at . Prove that lines , , and are concurrent.
See Also
2007 iTest (Problems, Answer Key) | ||
Preceded by: 2006 iTest |
Followed by: 2008 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 • TB1 • TB2 • TB3 • TB4 |