Do you know its property? (4)

Algebra Level 5

If t n = 8 + 6 ( n 1 1 ) + 2 ( n 1 2 ) t_{n}=8+ 6\binom{n-1}{1}+2\binom{n-1}{2} , then find the digit sum of n = 1 1729 ( t n ) . \displaystyle \large\sum_{n=1}^{1729} (t_{n}).

Details and Assumptions:

  1. ( n r ) = n ! r ! × ( n r ) ! \binom{n}{r}=\dfrac{n!}{r! \times (n-r)!} .

  2. Digit sum refers to the sum of the digits of the number. For instance, Digit sum of 1729 is 1+7+2+9=19.

  3. Assume ( n r ) = 0 \binom{n}{r}=0 if n < r n<r .


The answer is 44.

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

Sandeep Bhardwaj
Oct 13, 2014

From the properties of Binomial coefficient, we have k = 1 n ( n + k 1 k ) = ( n + k k + 1 ) \displaystyle \sum_{k=1}^{n} \binom{n+k-1}{k}= \binom{n+k}{k+1} for any given natural number k

For example, k = 1 n ( n + 1 2 ) = ( n + 2 3 ) \displaystyle \sum_{k=1}^{n} \binom{n+1}{2} = \binom{n+2}{3}

So here k = 1 n 8 + 6 ( n 1 1 ) + 2 ( n 1 2 ) = 8 n + 6 ( n 2 ) + 2 ( n 3 ) \displaystyle \sum_{k=1}^{n} 8+6\binom{n-1}{1}+2\binom{n-1}{2} = 8n+6\binom{n}{2}+2 \binom{n}{3} using the above stated property

Putting n = 1729 n=1729 , k = 1 n 8 + 6 ( n 1 1 ) + 2 ( n 1 2 ) = 1728903176 \displaystyle \sum_{k=1}^{n} 8+6\binom{n-1}{1}+2\binom{n-1}{2} = 1728903176

So digit sum here is 1 + 7 + 2 + 8 + 9 + 0 + 3 + 1 + 7 + 6 = 44 1+7+2+8+9+0+3+1+7+6 = \boxed{44}

enjoy !

Did exactly the same way , nice problem @Sandeep Bhardwaj

Shubhendra Singh - 6 years, 8 months ago

Log in to reply

thanks ! I created the problem at my own :)

Sandeep Bhardwaj - 6 years, 8 months ago

Nice problem bro!

Ashu Dablo - 6 years, 8 months ago

God kill me.... I waste my all chances by due to wrong calculation everytime...!! Anyway Nice Question @Sandeep Bhardwaj as always. But It is My request is that please try to make question with simple calculation... Since I have no calculator. Even You tagged it with JEE so I try to make calculation by my own But fails everytime.

Karan Shekhawat - 6 years, 8 months ago

Log in to reply

hehehe..ok. If you are preparing for JEE, its very necessary for you to do as much calculation as you can to get very good RANK. You should not avoid calculations and also should do it correctly with full presence of mind. You recheck you calculation after every step, may be it will help you in reducing your calculation errors. And its a positive point with you that you haven't got a calculator. Keep struggling. All the best!

Sandeep Bhardwaj - 6 years, 8 months ago

nice one !! ...... i liked the solution but my procedure was very long!........ im tired :) :p

Abhinav Raichur - 6 years, 8 months ago

Dude please please please use \binom{n}{r} in place of ^n C _r

^n C _r appears as n C r ^n C _r

\binom{n}{r} appears as ( n r ) \binom{n}{r}

The other symbol that the one you used, is considered standard. I've edited the question, you please edit the solution.

Aditya Raut - 6 years, 7 months ago

Log in to reply

Ok dude. But what's the issue in using ^nC_r ,as it has been mentioned in the question what does it represent. However, I will edit the solutions. But still I want to know why ?

Sandeep Bhardwaj - 6 years, 7 months ago

Log in to reply

Because it makes the wrong sense at times. For example, in your queston, previously it was written

t n = 8 + 6 n 1 C 1 + 2 n 1 C 2 \displaystyle t_n = 8 + 6 ^{n-1}C_1 + 2 ^{n-1}C_2

Now see, someone (including me) could have thought at first sight that it means

t n = 8 + ( 6 n 1 ) × C 1 + ( 2 n 1 ) × C 2 \displaystyle t_n = 8 + (6^{n-1}) \times C_1 + (2^{n-1}) \times C_2

where C 1 C_1 and C 2 C_2 are some unknown constants that might matter in the question later.


This seems standard, because whenever we are solving (generalising) recurrence relations, such terms (unknown constants multiplied by powers of some numbers) are there.

If you don't believe, just go to Wolfram and see how it shows the output of general term when you input the recurrence

t n = 8 t n 1 12 t n 2 t_n =8t_{n-1} - 12t_{n-2}

@Sandeep Bhardwaj

Also, the one you previously used, was not the standard symbol. In no Olympiad or any competition, I've seen use of that one... Hope I've convinced why \binom{n}{r} should be used.

If you want it to appear as a bigger and clearer one, use \dbinom{n}{r}

Reply please , friend :)

Aditya Raut - 6 years, 7 months ago

Log in to reply

@Aditya Raut Ok friend. Thank you very much, I got what you wanted to convey. I will apply the things you told me and will try to improve my latex coding. :)

Sandeep Bhardwaj - 6 years, 7 months ago

One more thing @Sandeep Bhardwaj , there are some fundamental things about summation you gotta see.

Never use the same variable as the range, like

n = 1 n ( n + 1 2 ) \displaystyle \sum_{n=1}^n \dbinom{n+1}{2}

Please use it as k = 1 n ( k + 1 2 ) \displaystyle \sum_{k=1}^n \dbinom{k+1}{2}

This is because always, the n n will be a number which will be the upper limit of the sum. And you can't use it as a variable. Use another variable, and because your upper limit will be n n , the v a r i a b l e variable will become into that value in the final answer.

Also please use \displaystyle before the \sum symbol, (see the changes that I've made to your solution)

When you write

\sum {n=0}^{1729} t n , it appears as n = 0 1729 t n \sum_{n=0}^{1729} t_n

\displaystyle at start makes it appears as n = 0 1729 t n \displaystyle \sum_{n=0}^{1729} t_n

Aditya Raut - 6 years, 7 months ago

I think it missed something. Look at the last assumption. By doing it your way, you done it wrong since you've neglected some terms. It should then be 1731890886 or 51 as the digit sum.

Limanan Nursalim - 6 years, 3 months ago

I bashed t n = n 2 + 3 n + 4 t_{n} = n^{2} + 3n + 4 , and found the summation manually :P.

Venkata Karthik Bandaru - 5 years, 5 months ago

i got 1728903166 , god knows why i got wrong , also is it necessary to shove 1729 in every problem ? ...sigh... ramanujan fans :P

A Former Brilliant Member - 4 years, 4 months ago
Aravind Vishnu
May 19, 2016

We can observe by expansion of the terms that

n = 1 1729 ( 8 + 6 ( n 1 1 ) + 2 ( n 1 2 ) ) = n = 1 1729 ( n 2 + 3 n + 4 ) \Large\sum\limits_{n=1}^{1729}{(8+6\binom{n-1}{1}+2\binom{n-1}{2})}=\Large\sum\limits_{n=1}^{1729}{(n^2+3n+4)}

= n = 1 1729 ( n 2 ) + 3 n = 1 1729 ( n ) + n = 1 1729 ( 4 ) =\Large\sum\limits_{n=1}^{1729}{(n^2)}+3\Large\sum\limits_{n=1}^{1729}{(n)}+\Large\sum\limits_{n=1}^{1729}{(4)}

= 1724409505 + 3 × 1495585 + 4 × 1729 =1724409505+3\times 1495585+4\times 1729

= 1724409505 + 4486755 + 6916 =1724409505+4486755+6916

= 1728903176 =1728903176

1 + 7 + 2 + 8 + 9 + 0 + 3 + 1 + 7 + 6 = 44 1+7+2+8+9+0+3+1+7+6=44

M Dub
Aug 3, 2015

Got the result, but did not use this property of binomial coefs. The first binomial coef equals to n-1, the second -- (n-1)(n-2)/2. The expression in the sum is n^2 +3n +4.
The sums for each term are: Sum(n^2) = n(n+1)(2n+1)/6 = 1729(1729+1)(2 * 1729+1)/6.
3*Sum(n) = 3 * n(n+1)/2=3 * 1729(1729+1) / 2.
Sum(4) = 4 * 1729.
The total sum is 1728903176. The sum of the digits 44.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...