The Last Number

Algebra Level 4

ζ = 1 + 4 + 4 + 9 + 9 + 9 + + n 2 + n 2 + n 2 + + n 2 n times + \zeta = 1+4+4+9+9+9+\dots+\underbrace{n^{2}+n^{2}+n^{2}+\dots+n^{2}}_{n \text{ times}}+\dots

Consider a series of m m terms where the number n 2 n^2 appears n n times, with the possible exception of the last number which could be truncated.

If ζ \zeta is the maximum number satisfying the series above, such that ζ 250 , 000 \zeta \leq 250,000 , what is the last number appeared in the series, and for how many times?

961, thirty-two times 1024, four times 961, thirty-one times 1024, three times

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.

3 solutions

Ben Habeahan
Sep 3, 2015

Use iduction, and we have this formula;

ζ = i = 1 n i 3 = ( n ( n + 1 ) 2 ) 2 . \zeta=\sum_{i=1}^ni^3=({ \frac{n(n+1)}{2} })^2.

So we can,

( n ( n + 1 ) 2 ) 2 < 250000... ( 1 ) ({ \frac{n(n+1)}{2} })^2 <250000 ...(1)

n ( n + 1 ) 2 < 500 \Leftrightarrow{ \frac{n(n+1)}{2} }<500

n ( n + 1 ) < 1000 \Leftrightarrow{ {n(n+1)} }<1000

For n = 31 n=31 we have 31 32 = 992 < 1000. 31*32=992 <1000. Substitute n = 31 n=31 to L.H.S . . . ( 1 ) ...(1)

Because ( 31 ( 31 + 1 ) 2 ) 2 = 246016 , ({ \frac{31(31+1)}{2} })^2=246016, so we take the next number n = 32 , n=32, n = 32 n 2 = 3 2 2 = 1024 . n=32 \implies n^2=32^2= \boxed{1024}.

Now,the diference 250000 250000 from 246016 246016 are 3984 3984 ,

3984 3 2 2 = 3 \lfloor{ \frac{3984}{32^2}} \rfloor = \boxed{3} times.

Well written solution. Thanks!

Kay Xspre - 5 years, 9 months ago

Nice solution. Same method.

Mehul Arora - 5 years, 9 months ago
Dhruv G
Aug 29, 2015

the sequence can be simplified to sum(n^3) which gives n(max)=31. so, 961 961s are included in this sum. the remaining sum is 3986. the next square is 1024. this means that 3 1024s more can fit in the sum. Hope I made sense!

How would you prove that assertion (i.e. the sequence is equal to a sum of cubes)?.... Induction?, summation?

Curtis Clement - 5 years, 9 months ago

Log in to reply

If you notice the condition that n 2 n^2 will appear n n times (save for the last n n ), the series will have the sum until the term of a n ( n + 1 ) 2 a_\frac{n(n+1)}{2} as the sum of cube. If the series terminate before it reaches the term number in the triangle number, you will have to count the next term appearing until it reaches the condition.

Kay Xspre - 5 years, 9 months ago
Hobart Pao
Oct 26, 2015

I probably have to prove this, but I solved using observation. 1 2 = 1 2 . T 1 1^{2} = 1^{2}. T_{1} 1 2 + 2 2 + 2 2 = 3 2 . T 2 1^{2} + 2^{2} + 2^{2} = 3^{2}. T_{2} 1 2 + 2 2 + 2 2 + 3 3 + 3 3 + 3 3 = 6 2 . T 3 1^{2} + 2^{2} + 2^{2}+ 3^{3} + 3^{3} + 3^{3} = 6^{2}. T_{3} Notice how the second column, all the numbers that are squared are triangular numbers, given by T n = n ( n + 1 ) 2 T_{n} = \frac{n(n+1)}{2}

The max first column value is 250000, or 50 0 2 500^{2} . I set 500 = n ( n + 1 ) 2 500 = \frac{n(n+1)}{2} and the nearest positive integer you get from solving for n is 31. Evaluating at T 31 T_{31} you get 246016. Subtract 246016 from 250000. Then, you know that the next term up is term 32. But, you know that you will go over 250000 if you add 32 3 2 2 32\cdot 32^{2} , so just count the maximum number of 3 2 2 32^{2} that have to be subtracted from 250000 246016 250000-246016 so that you don't get a negative number. That happens to be subtracting 3 2 2 32^{2} thrice.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...