Difference between revisions of "1986 AIME Problems"
m (→See also: piped cat) |
m (→Problem 7) |
||
(16 intermediate revisions by 10 users not shown) | |||
Line 1: | Line 1: | ||
+ | {{AIME Problems|year=1986}} | ||
+ | |||
== Problem 1 == | == Problem 1 == | ||
+ | What is the sum of the solutions to the equation <math>\sqrt[4]{x} = \frac{12}{7 - \sqrt[4]{x}}</math>? | ||
[[1986 AIME Problems/Problem 1|Solution]] | [[1986 AIME Problems/Problem 1|Solution]] | ||
== Problem 2 == | == Problem 2 == | ||
+ | Evaluate the product <cmath>\left(\sqrt{5}+\sqrt{6}+\sqrt{7}\right)\left(\sqrt{5}+\sqrt{6}-\sqrt{7}\right)\left(\sqrt{5}-\sqrt{6}+\sqrt{7}\right)\left(-\sqrt{5}+\sqrt{6}+\sqrt{7}\right).</cmath> | ||
[[1986 AIME Problems/Problem 2|Solution]] | [[1986 AIME Problems/Problem 2|Solution]] | ||
== Problem 3 == | == Problem 3 == | ||
+ | If <math>\tan x+\tan y=25</math> and <math>\cot x + \cot y=30</math>, what is <math>\tan(x+y)</math>? | ||
[[1986 AIME Problems/Problem 3|Solution]] | [[1986 AIME Problems/Problem 3|Solution]] | ||
== Problem 4 == | == Problem 4 == | ||
+ | Determine <math>3x_4+2x_5</math> if <math>x_1</math>, <math>x_2</math>, <math>x_3</math>, <math>x_4</math>, and <math>x_5</math> satisfy the system of equations below. | ||
+ | <center><math>2x_1+x_2+x_3+x_4+x_5=6</math></center> | ||
+ | <center><math>x_1+2x_2+x_3+x_4+x_5=12</math></center> | ||
+ | <center><math>x_1+x_2+2x_3+x_4+x_5=24</math></center> | ||
+ | <center><math>x_1+x_2+x_3+2x_4+x_5=48</math></center> | ||
+ | <center><math>x_1+x_2+x_3+x_4+2x_5=96</math></center> | ||
[[1986 AIME Problems/Problem 4|Solution]] | [[1986 AIME Problems/Problem 4|Solution]] | ||
== Problem 5 == | == Problem 5 == | ||
+ | What is that largest [[positive integer]] <math>n</math> for which <math>n^3+100</math> is [[divisible]] by <math>n+10</math>? | ||
[[1986 AIME Problems/Problem 5|Solution]] | [[1986 AIME Problems/Problem 5|Solution]] | ||
== Problem 6 == | == Problem 6 == | ||
+ | The pages of a book are numbered <math>1_{}^{}</math> through <math>n_{}^{}</math>. When the page numbers of the book were added, one of the page numbers was mistakenly added twice, resulting in an incorrect sum of <math>1986_{}^{}</math>. What was the number of the page that was added twice? | ||
[[1986 AIME Problems/Problem 6|Solution]] | [[1986 AIME Problems/Problem 6|Solution]] | ||
== Problem 7 == | == 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]] | [[1986 AIME Problems/Problem 7|Solution]] | ||
== Problem 8 == | == Problem 8 == | ||
+ | Let <math>S</math> be the sum of the base <math>10</math> logarithms of all the proper divisors of <math>1000000</math>. What is the integer nearest to <math>S</math>? | ||
[[1986 AIME Problems/Problem 8|Solution]] | [[1986 AIME Problems/Problem 8|Solution]] | ||
== Problem 9 == | == Problem 9 == | ||
+ | In <math>\triangle ABC</math>, <math>AB= 425</math>, <math>BC=450</math>, and <math>AC=510</math>. An interior point <math>P</math> is then drawn, and segments are drawn through <math>P</math> parallel to the sides of the triangle. If these three segments are of an equal length <math>d</math>, find <math>d</math>. | ||
[[1986 AIME Problems/Problem 9|Solution]] | [[1986 AIME Problems/Problem 9|Solution]] | ||
== Problem 10 == | == Problem 10 == | ||
+ | In a parlor game, the magician asks one of the participants to think of a three digit number <math>(abc)</math> where <math>a</math>, <math>b</math>, and <math>c</math> represent digits in base <math>10</math> in the order indicated. The magician then asks this person to form the numbers <math>(acb)</math>, <math>(bca)</math>, <math>(bac)</math>, <math>(cab)</math>, and <math>(cba)</math>, to add these five numbers, and to reveal their sum, <math>N</math>. If told the value of <math>N</math>, the magician can identify the original number, <math>(abc)</math>. Play the role of the magician and determine the <math>(abc)</math> if <math>N= 3194</math>. | ||
[[1986 AIME Problems/Problem 10|Solution]] | [[1986 AIME Problems/Problem 10|Solution]] | ||
== Problem 11 == | == Problem 11 == | ||
+ | The polynomial <math>1-x+x^2-x^3+\cdots+x^{16}-x^{17}</math> may be written in the form <math>a_0+a_1y+a_2y^2+\cdots +a_{16}y^{16}+a_{17}y^{17}</math>, where <math>y=x+1</math> and the <math>a_i</math>'s are constants. Find the value of <math>a_2</math>. | ||
[[1986 AIME Problems/Problem 11|Solution]] | [[1986 AIME Problems/Problem 11|Solution]] | ||
== Problem 12 == | == Problem 12 == | ||
+ | Let the sum of a set of numbers be the sum of its elements. Let <math>S</math> be a set of positive integers, none greater than 15. Suppose no two disjoint subsets of <math>S</math> have the same sum. What is the largest sum a set <math>S</math> with these properties can have? | ||
[[1986 AIME Problems/Problem 12|Solution]] | [[1986 AIME Problems/Problem 12|Solution]] | ||
== Problem 13 == | == 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]] | [[1986 AIME Problems/Problem 13|Solution]] | ||
== Problem 14 == | == Problem 14 == | ||
+ | The shortest distances between an interior [[diagonal]] of a rectangular [[parallelepiped]], <math>P</math>, and the edges it does not meet are <math>2\sqrt{5}</math>, <math>\frac{30}{\sqrt{13}}</math>, and <math>\frac{15}{\sqrt{10}}</math>. Determine the [[volume]] of <math>P</math>. | ||
[[1986 AIME Problems/Problem 14|Solution]] | [[1986 AIME Problems/Problem 14|Solution]] | ||
== Problem 15 == | == 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>. | ||
[[1986 AIME Problems/Problem 15|Solution]] | [[1986 AIME Problems/Problem 15|Solution]] | ||
== See also == | == See also == | ||
+ | |||
+ | {{AIME box|year=1986|before=[[1985 AIME Problems]]|after=[[1987 AIME Problems]]}} | ||
+ | |||
* [[American Invitational Mathematics Examination]] | * [[American Invitational Mathematics Examination]] | ||
* [[AIME Problems and Solutions]] | * [[AIME Problems and Solutions]] | ||
Line 66: | Line 90: | ||
[[Category:AIME Problems|1986]] | [[Category:AIME Problems|1986]] | ||
+ | {{MAA Notice}} |
Latest revision as of 14:48, 21 August 2023
1986 AIME (Answer Key) | AoPS Contest Collections • PDF | ||
Instructions
| ||
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 |
Contents
Problem 1
What is the sum of the solutions to the equation ?
Problem 2
Evaluate the product
Problem 3
If and , what is ?
Problem 4
Determine if , , , , and satisfy the system of equations below.
Problem 5
What is that largest positive integer for which is divisible by ?
Problem 6
The pages of a book are numbered through . When the page numbers of the book were added, one of the page numbers was mistakenly added twice, resulting in an incorrect sum of . What was the number of the page that was added twice?
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 8
Let be the sum of the base logarithms of all the proper divisors of . What is the integer nearest to ?
Problem 9
In , , , and . An interior point is then drawn, and segments are drawn through parallel to the sides of the triangle. If these three segments are of an equal length , find .
Problem 10
In a parlor game, the magician asks one of the participants to think of a three digit number where , , and represent digits in base in the order indicated. The magician then asks this person to form the numbers , , , , and , to add these five numbers, and to reveal their sum, . If told the value of , the magician can identify the original number, . Play the role of the magician and determine the if .
Problem 11
The polynomial may be written in the form , where and the 's are constants. Find the value of .
Problem 12
Let the sum of a set of numbers be the sum of its elements. Let be a set of positive integers, none greater than 15. Suppose no two disjoint subsets of have the same sum. What is the largest sum a set with these properties can have?
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 14
The shortest distances between an interior diagonal of a rectangular parallelepiped, , and the edges it does not meet are , , and . Determine the volume of .
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 .
See also
1986 AIME (Problems • Answer Key • Resources) | ||
Preceded by 1985 AIME Problems |
Followed by 1987 AIME Problems | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |
- American Invitational Mathematics Examination
- AIME Problems and Solutions
- Mathematics competition resources
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.