Difference between revisions of "2008 Mock ARML 2 Problems"
m (wikifying) |
(→Problem 6) |
||
(2 intermediate revisions by one other user not shown) | |||
Line 32: | Line 32: | ||
= Set 3 = | = Set 3 = | ||
== Problem 5 == | == Problem 5 == | ||
− | Al is thinking of a function, <math>f(x)</math>. He reveals to Bob that the function is a polynomial of the form <math>f(x) = ax^8 + bx^5 + cx^2 + dx + e</math>, where <math>a</math>, <math>b</math>, <math>c</math>, <math>d</math>, and <math>e</math> are '''complex''' number coefficients. Bob wishes to determine the value of <math>d</math>. For any | + | Al is thinking of a function, <math>f(x)</math>. He reveals to Bob that the function is a polynomial of the form <math>f(x) = ax^8 + bx^5 + cx^2 + dx + e</math>, where <math>a</math>, <math>b</math>, <math>c</math>, <math>d</math>, and <math>e</math> are '''complex''' number coefficients. Bob wishes to determine the value of <math>d</math>. For any '''complex''' number <math>x</math> that Bob asks about, Al will tell him the value of <math>f(x)</math>. At least how many values of <math>x</math> must Bob ask about in order to definitively determine the value of <math>d</math>? |
[[2008 Mock ARML 2 Problems/Problem 5 | Solution]] | [[2008 Mock ARML 2 Problems/Problem 5 | Solution]] | ||
== Problem 6 == | == Problem 6 == | ||
− | John has a pile of <math>63</math> blocks. On top of the pile is one block. Below this block are two smaller blocks. Below each of these two blocks are two even smaller blocks. Below each of these blocks are two still smaller blocks, and so on until the last row, which contains <math>32</math> blocks. John removes blocks one at a time, removing only blocks that currently have no blocks on top of them. Find the number of ways in which John can remove exactly seven blocks. | + | John has a pile of <math>63</math> blocks. On top of the pile is one block. Below this block are two smaller blocks. Below each of these two blocks are two even smaller blocks. Below each of these blocks are two still smaller blocks, and so on until the last row, which contains <math>32</math> blocks. John removes blocks one at a time, removing only blocks that currently have no blocks on top of them. Find the number of ways (order matters) in which John can remove exactly seven blocks. |
[[2008 Mock ARML 2 Problems/Problem 6 | Solution]] | [[2008 Mock ARML 2 Problems/Problem 6 | Solution]] |
Latest revision as of 20:57, 8 May 2019
Contents
Set 1
Problem 1
is a convex quadrilateral such that , , , and . Given that , find the area of .
Problem 2
Given that the sum of all positive integers with exactly two proper divisors, each of which is less than , is , find the sum of all positive integers with exactly three proper divisors, each of which is less than (a proper divisor of is a positive integer that divides but is not equal to ).
Set 2
Problem 3
A variation of Pascal's triangle is constructed by writing the numbers and in the top row and writing each subsequent term as the sum of the two terms above it. Find the fifth term from the left in the thirteenth row.
Problem 4
Equilateral triangle has a side length of . A ball begins at vertex , rolls through the interior of the triangle, bounces off side , and settles at point P. Given that and , find the total distance that the ball travels.
Set 3
Problem 5
Al is thinking of a function, . He reveals to Bob that the function is a polynomial of the form , where , , , , and are complex number coefficients. Bob wishes to determine the value of . For any complex number that Bob asks about, Al will tell him the value of . At least how many values of must Bob ask about in order to definitively determine the value of ?
Problem 6
John has a pile of blocks. On top of the pile is one block. Below this block are two smaller blocks. Below each of these two blocks are two even smaller blocks. Below each of these blocks are two still smaller blocks, and so on until the last row, which contains blocks. John removes blocks one at a time, removing only blocks that currently have no blocks on top of them. Find the number of ways (order matters) in which John can remove exactly seven blocks.
Set 4
Problem 7
Let equal the number of zeroes to the right of the rightmost non-zero digit in the decimal form of , and let . Given that can be written as , where and are relatively prime positive integers, is less than , and is less than , find .
Problem 8
Given that and for all non-negative integers , evaluate .