Problems
66 match
Michael walks at the rate of feet per second on a long straight path. Trash pails are located every feet along the path. A garbage truck travels at feet per second in the same direction as Michael and stops for seconds at each pail. As Michael passes a pail, he notices the truck ahead of him just …
Let be a sequence for which , , and for each positive integer . What is ?
The first term of a sequence is . Each succeeding term is the sum of the cubes of the digits of the previous term. What is the term of the sequence?
A grocer stacks oranges in a pyramid-like stack whose rectangular base is oranges by oranges. Each orange above the first level rests in a pocket formed by four oranges below. The stack is completed by a single row of oranges. How many oranges are in the stack?
A game is played with tokens according to the following rule. In each round, the player with the most tokens gives one token to each of the other players and also places one token in the discard pile. The game ends when some player runs out of tokens. Players , , and start with , , and …
Let be a function with the following properties: (i) , and (ii) for any positive integer . What is the value of ?
In the sequence , , , , each term after the third is found by subtracting the previous term from the sum of the two terms that precede that term. For example, the fourth term is . What is the term in this sequence?
Simplify .
What is the units digit of ?
A large equilateral triangle is constructed by using toothpicks to create rows of small equilateral triangles. For example, in the figure, we have rows of small congruent equilateral triangles, with small triangles in the base row. How many toothpicks would be needed to construct a large equilateral triangle if …
The symbolism denotes the largest integer not exceeding . For example, and . Compute
A set of tiles numbered 1 through 100 is modified repeatedly by the following operation: remove all tiles numbered with a perfect square, and renumber the remaining tiles consecutively starting with 1. How many times must the operation be performed to reduce the number of tiles in the set to one?
The arithmetic mean of the nine numbers in the set is a -digit number , all of whose digits are distinct. The number doesn't contain the digit
Let be a sequence of integers such that and for all positive integers and Then is
Consider the dark square in an array of unit squares, part of which is shown. The first ring of squares around this center square contains unit squares. The second ring contains unit squares. If we continue this process, the number of unit squares in the ring is
Figures , , , and consist of , , , and nonoverlapping unit squares, respectively. If the pattern were continued, how many nonoverlapping unit squares would there be in figure 100?