1980 AHSME Problems/Problem 25

Problem

In the non-decreasing sequence of odd integers $\{a_1,a_2,a_3,\ldots \}=\{1,3,3,3,5,5,5,5,5,\ldots \}$ each odd positive integer $k$ appears $k$ times. It is a fact that there are integers $b, c$ , and $d$ such that for all positive integers $n$ , $a_n=b\lfloor \sqrt{n+c} \rfloor +d$ , where $\lfloor x \rfloor$ denotes the largest integer not exceeding $x$ . The sum $b+c+d$ equals

$\text{(A)} \ 0 \qquad \text{(B)} \ 1 \qquad \text{(C)} \ 2 \qquad \text{(D)} \ 3 \qquad \text{(E)} \ 4$

Solution

$\fbox{}$

1980 AHSME (Problems • Answer Key • Resources)
Preceded by Problem 24	Followed by Problem 26
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 • 26 • 27 • 28 • 29 • 30
All AHSME Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.

Page

Toolbox

Search

1980 AHSME Problems/Problem 25

Problem

Solution

See also