On the range of values from [ 1 , 1 0 0 0 ] , there exist a certain number of perfect squares . As you move from one perfect square to the next without skipping any, you will find that the distance between perfect squares increases. What is the average of all such distances in the given range of values?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Nice observation! I just left the squares in and noticed that it was a telescoping series because you would get 3 0 2 2 − 1 2 + 3 2 − 2 2 + 4 2 − 3 2 + . . . + 3 1 2 − 3 0 2 = 3 0 3 1 2 − 1 = 3 2
Log in to reply
Yes, very nice! (+1)
Haha, that's what I thought at first, and was wondering where the arithmetic progression was.
Nice problem, but I don't think it's well suited in the AP chapter.
Problem Loading...
Note Loading...
Set Loading...
Relevant wiki: Arithmetic Progressions
The distances form an arithmetic sequence running from 2 2 − 1 2 = 3 to 3 1 2 − 3 0 2 = 6 1 , so that the average is 2 3 + 6 1 = 3 2