Difference between revisions of "User:Rowechen"
Line 1: | Line 1: | ||
Hey how did you get to this page? If you aren't me then I have to say hello. If you are me then I must be pretty conceited to waste my time looking at my own page. | Hey how did you get to this page? If you aren't me then I have to say hello. If you are me then I must be pretty conceited to waste my time looking at my own page. | ||
If you aren't me, seriously, how did you get to this page? This is pretty cool. Well, nice meeting you! I'm going to stop wasting my time typing this up and do some math. Gtg. Bye. | If you aren't me, seriously, how did you get to this page? This is pretty cool. Well, nice meeting you! I'm going to stop wasting my time typing this up and do some math. Gtg. Bye. | ||
+ | |||
+ | Here's the AIME compilation I will be doing: | ||
+ | |||
+ | == Problem 3 == | ||
+ | By a proper divisor of a natural number we mean a positive integral divisor other than 1 and the number itself. A natural number greater than 1 will be called "nice" if it is equal to the product of its distinct proper divisors. What is the sum of the first ten nice numbers? | ||
+ | |||
+ | [[1987 AIME Problems/Problem 3|Solution]] | ||
+ | |||
+ | == Problem 4 == | ||
+ | Let <math>S</math> be a list of positive integers - not necessarily distinct - in which the number <math>68</math> appears. The arithmetic mean of the numbers in <math>S</math> is <math>56</math>. However, if <math>68</math> is removed, the arithmetic mean of the numbers is <math>55</math>. What's the largest number that can appear in <math>S</math>? | ||
+ | |||
+ | [[1984 AIME Problems/Problem 4|Solution]] | ||
+ | |||
+ | == Problem 6 == | ||
+ | Rectangle <math>ABCD</math> is divided into four parts of equal area by five segments as shown in the figure, where <math>XY = YB + BC + CZ = ZW = WD + DA + AX</math>, and <math>PQ</math> is parallel to <math>AB</math>. Find the length of <math>AB</math> (in cm) if <math>BC = 19</math> cm and <math>PQ = 87</math> cm. | ||
+ | |||
+ | [[Image:AIME_1987_Problem_6.png]] | ||
+ | |||
+ | == Problem 8 == | ||
+ | What is the largest <math>2</math>-digit prime factor of the integer <math>n = {200\choose 100}</math>? | ||
+ | |||
+ | == Problem 7 == | ||
+ | The increasing sequence <math>1,3,4,9,10,12,13\cdots</math> consists of all those positive integers which are powers of 3 or sums of distinct powers of 3. Find the <math>100^{\mbox{th}}</math> term of this sequence. | ||
+ | |||
+ | [[1986 AIME Problems/Problem 7|Solution]] | ||
+ | |||
+ | == Problem 10 == | ||
+ | The numbers <math>1447</math>, <math>1005</math> and <math>1231</math> have something in common: each is a <math>4</math>-digit number beginning with <math>1</math> that has exactly two identical digits. How many such numbers are there? | ||
+ | |||
+ | [[1983 AIME Problems/Problem 10|Solution]] | ||
+ | |||
+ | == Problem 8 == | ||
+ | What is the largest positive integer <math>n</math> for which there is a unique integer <math>k</math> such that <math>\frac{8}{15} < \frac{n}{n + k} < \frac{7}{13}</math>? | ||
+ | |||
+ | == Problem 12 == | ||
+ | Diameter <math>AB</math> of a circle has length a <math>2</math>-digit integer (base ten). Reversing the digits gives the length of the perpendicular chord <math>CD</math>. The distance from their intersection point <math>H</math> to the center <math>O</math> is a positive rational number. Determine the length of <math>AB</math>. | ||
+ | |||
+ | [[File:pdfresizer.com-pdf-convert-aimeq12.png]] | ||
+ | |||
+ | [[1983 AIME Problems/Problem 12|Solution]] | ||
+ | |||
+ | == Problem 10 == | ||
+ | Let <math>a_{}^{}</math>, <math>b_{}^{}</math>, <math>c_{}^{}</math> be the three sides of a triangle, and let <math>\alpha_{}^{}</math>, <math>\beta_{}^{}</math>, <math>\gamma_{}^{}</math>, be the angles opposite them. If <math>a^2+b^2=1989^{}_{}c^2</math>, find | ||
+ | <center><math>\frac{\cot \gamma}{\cot \alpha+\cot \beta}</math></center> | ||
+ | |||
+ | [[1989 AIME Problems/Problem 10|Solution]] | ||
+ | |||
+ | == Problem 11 == | ||
+ | A sample of 121 integers is given, each between 1 and 1000 inclusive, with repetitions allowed. The sample has a unique mode (most frequent value). Let <math>D^{}_{}</math> be the difference between the mode and the arithmetic mean of the sample. What is the largest possible value of <math>\lfloor D^{}_{}\rfloor</math>? (For real <math>x^{}_{}</math>, <math>\lfloor x^{}_{}\rfloor</math> is the greatest integer less than or equal to <math>x^{}_{}</math>.) | ||
+ | |||
+ | [[1989 AIME Problems/Problem 11|Solution]] | ||
+ | |||
+ | == Problem 13 == | ||
+ | In a sequence of coin tosses, one can keep a record of instances in which a tail is immediately followed by a head, a head is immediately followed by a head, and etc. We denote these by TH, HH, and etc. For example, in the sequence TTTHHTHTTTHHTTH of 15 coin tosses we observe that there are two HH, three HT, four TH, and five TT subsequences. How many different sequences of 15 coin tosses will contain exactly two HH, three HT, four TH, and five TT subsequences? | ||
+ | |||
+ | [[1986 AIME Problems/Problem 13|Solution]] | ||
+ | |||
+ | == Problem 15 == | ||
+ | Determine <math>w^2+x^2+y^2+z^2</math> if | ||
+ | |||
+ | <center><math> \frac{x^2}{2^2-1}+\frac{y^2}{2^2-3^2}+\frac{z^2}{2^2-5^2}+\frac{w^2}{2^2-7^2}=1 </math></center> | ||
+ | <center><math> \frac{x^2}{4^2-1}+\frac{y^2}{4^2-3^2}+\frac{z^2}{4^2-5^2}+\frac{w^2}{4^2-7^2}=1 </math></center> | ||
+ | <center><math> \frac{x^2}{6^2-1}+\frac{y^2}{6^2-3^2}+\frac{z^2}{6^2-5^2}+\frac{w^2}{6^2-7^2}=1 </math></center> | ||
+ | <center><math> \frac{x^2}{8^2-1}+\frac{y^2}{8^2-3^2}+\frac{z^2}{8^2-5^2}+\frac{w^2}{8^2-7^2}=1 </math></center> | ||
+ | |||
+ | [[1984 AIME Problems/Problem 15|Solution]] | ||
+ | |||
+ | == Problem 15 == | ||
+ | Squares <math>S_1</math> and <math>S_2</math> are inscribed in right triangle <math>ABC</math>, as shown in the figures below. Find <math>AC + CB</math> if area <math>(S_1) = 441</math> and area <math>(S_2) = 440</math>. | ||
+ | |||
+ | [[Image:AIME_1987_Problem_15.png]] | ||
+ | |||
+ | [[1987 AIME Problems/Problem 15|Solution]] | ||
+ | |||
+ | == Problem 13 == | ||
+ | A given sequence <math>r_1, r_2, \dots, r_n</math> of distinct real numbers can be put in ascending order by means of one or more "bubble passes". A bubble pass through a given sequence consists of comparing the second term with the first term, and exchanging them if and only if the second term is smaller, then comparing the third term with the second term and exchanging them if and only if the third term is smaller, and so on in order, through comparing the last term, <math>r_n</math>, with its current predecessor and exchanging them if and only if the last term is smaller. | ||
+ | |||
+ | The example below shows how the sequence 1, 9, 8, 7 is transformed into the sequence 1, 8, 7, 9 by one bubble pass. The numbers compared at each step are underlined. | ||
+ | <center><math>\underline{1 \quad 9} \quad 8 \quad 7</math></center> | ||
+ | <center><math>1 \quad {}\underline{9 \quad 8} \quad 7</math></center> | ||
+ | <center><math>1 \quad 8 \quad \underline{9 \quad 7}</math></center> | ||
+ | <center><math>1 \quad 8 \quad 7 \quad 9</math></center> | ||
+ | Suppose that <math>n = 40</math>, and that the terms of the initial sequence <math>r_1, r_2, \dots, r_{40}</math> are distinct from one another and are in random order. Let <math>p/q</math>, in lowest terms, be the probability that the number that begins as <math>r_{20}</math> will end up, after one bubble pass, in the <math>30^{\mbox{th}}</math> place. Find <math>p + q</math>. | ||
+ | |||
+ | [[1987 AIME Problems/Problem 13|Solution]] | ||
+ | |||
+ | == Problem 15 == | ||
+ | Let triangle <math>ABC</math> be a right triangle in the <math>xy</math>-plane with a right angle at <math>C_{}</math>. Given that the length of the hypotenuse <math>AB</math> is <math>60</math>, and that the medians through <math>A</math> and <math>B</math> lie along the lines <math>y=x+3</math> and <math>y=2x+4</math> respectively, find the area of triangle <math>ABC</math>. |
Revision as of 14:49, 22 May 2020
Hey how did you get to this page? If you aren't me then I have to say hello. If you are me then I must be pretty conceited to waste my time looking at my own page. If you aren't me, seriously, how did you get to this page? This is pretty cool. Well, nice meeting you! I'm going to stop wasting my time typing this up and do some math. Gtg. Bye.
Here's the AIME compilation I will be doing:
Contents
[hide]Problem 3
By a proper divisor of a natural number we mean a positive integral divisor other than 1 and the number itself. A natural number greater than 1 will be called "nice" if it is equal to the product of its distinct proper divisors. What is the sum of the first ten nice numbers?
Problem 4
Let be a list of positive integers - not necessarily distinct - in which the number appears. The arithmetic mean of the numbers in is . However, if is removed, the arithmetic mean of the numbers is . What's the largest number that can appear in ?
Problem 6
Rectangle is divided into four parts of equal area by five segments as shown in the figure, where , and is parallel to . Find the length of (in cm) if cm and cm.
Problem 8
What is the largest -digit prime factor of the integer ?
Problem 7
The increasing sequence consists of all those positive integers which are powers of 3 or sums of distinct powers of 3. Find the term of this sequence.
Problem 10
The numbers , and have something in common: each is a -digit number beginning with that has exactly two identical digits. How many such numbers are there?
Problem 8
What is the largest positive integer for which there is a unique integer such that ?
Problem 12
Diameter of a circle has length a -digit integer (base ten). Reversing the digits gives the length of the perpendicular chord . The distance from their intersection point to the center is a positive rational number. Determine the length of .
Problem 10
Let , , be the three sides of a triangle, and let , , , be the angles opposite them. If , find
Problem 11
A sample of 121 integers is given, each between 1 and 1000 inclusive, with repetitions allowed. The sample has a unique mode (most frequent value). Let be the difference between the mode and the arithmetic mean of the sample. What is the largest possible value of ? (For real , is the greatest integer less than or equal to .)
Problem 13
In a sequence of coin tosses, one can keep a record of instances in which a tail is immediately followed by a head, a head is immediately followed by a head, and etc. We denote these by TH, HH, and etc. For example, in the sequence TTTHHTHTTTHHTTH of 15 coin tosses we observe that there are two HH, three HT, four TH, and five TT subsequences. How many different sequences of 15 coin tosses will contain exactly two HH, three HT, four TH, and five TT subsequences?
Problem 15
Determine if
Problem 15
Squares and are inscribed in right triangle , as shown in the figures below. Find if area and area .
Problem 13
A given sequence of distinct real numbers can be put in ascending order by means of one or more "bubble passes". A bubble pass through a given sequence consists of comparing the second term with the first term, and exchanging them if and only if the second term is smaller, then comparing the third term with the second term and exchanging them if and only if the third term is smaller, and so on in order, through comparing the last term, , with its current predecessor and exchanging them if and only if the last term is smaller.
The example below shows how the sequence 1, 9, 8, 7 is transformed into the sequence 1, 8, 7, 9 by one bubble pass. The numbers compared at each step are underlined.
Suppose that , and that the terms of the initial sequence are distinct from one another and are in random order. Let , in lowest terms, be the probability that the number that begins as will end up, after one bubble pass, in the place. Find .
Problem 15
Let triangle be a right triangle in the -plane with a right angle at . Given that the length of the hypotenuse is , and that the medians through and lie along the lines and respectively, find the area of triangle .