# Difference between revisions of "2007 iTest Problems/Ultimate Question"

Rockmanex3 (talk | contribs) (UQ from 2007 iTest, but with T-values substituted) |
Rockmanex3 (talk | contribs) (Questions added) |
||

Line 1: | Line 1: | ||

The following questions are from the "Ultimate Question" of the [[2007 iTest]], but with the T-values substituted. This is for people who want to work on the problems without having to solve the previous problems. | The following questions are from the "Ultimate Question" of the [[2007 iTest]], but with the T-values substituted. This is for people who want to work on the problems without having to solve the previous problems. | ||

+ | |||

+ | ===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=== | ||

+ | Let <math>R</math> be the region consisting of points <math>(x,y)</math> of the Cartesian plane satisfying both | ||

+ | <math>|x|-|y|\le 16</math> and <math>|y|\le 16</math>. Find the area of region <math>R</math>. | ||

+ | |||

+ | [[2007 iTest Problems/Problem 52|Solution]] | ||

+ | |||

+ | ===Problem 53=== | ||

+ | Three distinct positive Fibonacci numbers, all greater than <math>1536</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=== | ||

+ | 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>2004</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=== | ||

+ | Let <math>R=675</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=== | ||

+ | In the binary expansion of <math>\dfrac{2^{2007}-1}{2^225-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=== | ||

+ | How many positive integers are within <math>810</math> of exactly <math>\lfloor \sqrt{810} \rfloor</math> perfect squares? (Note: <math>0^2=0</math> is considered a perfect square.) | ||

+ | |||

+ | [[2007 iTest Problems/Problem 57|Solution]] | ||

+ | |||

+ | ===Problem 58=== | ||

+ | 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,112)-S(10,55)+S(10,2)</math>. | ||

+ | |||

+ | [[2007 iTest Problems/Problem 58|Solution]] | ||

+ | |||

+ | ===Problem 59=== | ||

+ | 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>1/11</math>. Find the value of <math>a</math>. | ||

+ | |||

+ | [[2007 iTest Problems/Problem 59|Solution]] | ||

+ | |||

+ | ===Problem 60=== | ||

+ | Triangle <math>ABC</math> has <math>AB=99</math> and <math>AC=120</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]] |

## Revision as of 00:40, 25 June 2018

The following questions are from the "Ultimate Question" of the 2007 iTest, but with the T-values substituted. This is for people who want to work on the problems without having to solve the previous problems.

## Contents

### Problem 51

Find the highest point (largest possible -coordinate) on the parabola

### Problem 52

Let be the region consisting of points of the Cartesian plane satisfying both and . Find the area of region .

### Problem 53

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

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 appears a total of times among these terms, find the remainder when gets divided by .

### Problem 55

Let . Let be the smallest real solution of . Find the value of .

### Problem 56

In the binary expansion of , how many of the first digits to the right of the radix point are 's?

### Problem 57

How many positive integers are within of exactly perfect squares? (Note: is considered a perfect square.)

### Problem 58

For natural numbers , we define Compute the value of .

### Problem 59

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

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 .