Let a be a real number such that
a = 1 1 + 3 1 + 6 1 + 1 0 1 + ⋯ + 5 0 5 0 1 .
If a can be expressed in the form y x , where x , y are coprime, positive integers, find x + y .
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.
good method...
did it using the same method
Intrresting problem @Victor Loh
During summation of problem given I found an intresting pattern as follows: For "n"th term summation of series follows n + 1 2 n . Thus for n=100,as sum of first 100 No.s is 5050 Thus by above statement Answer should be 1 0 1 2 0 0 And thus 200+101=301 .... Thats It..
It should actually be n ( n + 1 ) 2 instead of n + 1 2 n (I guess it's a typo).
This is no coincidence because it can easily be observed that the series is actually k = 1 ∑ 1 0 0 T k 1 where T k is the k th triangular number . Using the well-known closed form for T k and using telescopy, the problem becomes trivial.
Use induction for this one
x + 1 2 x + 2 1 ( x + 1 ) ( ( x + 1 ) + 1 ) 1 = ( x + 1 ) + 1 2 ( x + 1 )
same actually i did it by same way @Michael Mendrin But during summation of problem given I found an intresting pattern as follows: For "n"th term summation of series follows n + 1 2 n . Thus for n=100,as sum of first 100 No.s is 5050 Thus by above statement Answer should be 1 0 1 2 0 0
Problem Loading...
Note Loading...
Set Loading...
We have
1 1 + 3 1 + 6 1 + ⋯ + 5 0 5 0 1
= 2 2 + 6 2 + 1 2 2 + ⋯ + 1 0 1 0 0 2
= 1 × 2 2 + 2 × 3 2 + 3 × 4 2 + ⋯ + 1 0 0 × 1 0 1 2
= 2 ( 1 × 2 1 + 2 × 3 1 + 3 × 4 1 + ⋯ + 1 0 0 × 1 0 1 1 )
= 2 ( 1 1 − 2 1 + 2 1 − 3 1 + 3 1 − 4 1 + ⋯ + 1 0 0 1 − 1 0 1 1 )
= 2 ( 1 1 − 1 0 1 1 )
= 2 ( 1 0 1 1 0 0 )
= 1 0 1 2 0 0