( 2 6 2 7 2 8 2 9 3 0 3 1 = = = = = = 5 + 6 + 7 + 8 8 + 9 + 1 0 1 + 2 + 3 + 4 + 5 + 6 + 7 1 4 + 1 5 4 + 5 + 6 + 7 + 8 1 5 + 1 6
If you see the above numbers , they can be represented as a sum of some consecutive numbers.If 32 can be expressed as i = 1 ∑ n a i , where a 1 , a 2 , a 3 , … a n are some consecutive positive numbers , compute i = 1 ∏ n a i .
Note: If you think that 32 is not lucky enough to have such representation , input the answer as 999.
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.
Can you prove why all numbers of the form 2 n cannot have such representation.?
Log in to reply
Sorry, as I told you ealier, that I am confined to a small screen I can't type the solutions and currently I am travelling, if you want to know more read this .
Also please don't mind that I didn't solve most of you JEE Novices, because I am out of station. . . . ⌢ ¨
Sorry for a late reply, the signal is not proper. . . . .
Learnt a bit of politeness today.
You might want to specify these numbers are positive integers. The sum of the numbers from -31 to 32 consecutively equals 32 (product being zero).
Thanks for telling that. Also please refrain from writing reports in solution section.You can submit the report by clicking the "dot-dot-dot" menu in the right bottom part of the screen. Thanks!
Log in to reply
My apologies. It was my first time making a comment on this site.
Log in to reply
Well , it was an advice and not a scolding. So no need to apologize.
Problem Loading...
Note Loading...
Set Loading...
Actually Nihar was taking of polite numbers.
In number theory, a polite number is a positive integer that can be written as the sum of two or more consecutive positive integers. Other positive integers are impolite
The first few polite numbers are,
3 , 5 , 6 , 7 , 9 , 1 0 , 1 1 , 1 2 , 1 3 , 1 4 , 1 5 , 1 7 , 1 8 , 1 9 , 2 0 , 2 1 , 2 2 , 2 3 , 2 4 , 2 5 , 2 6 , 2 7 , 2 8 , 2 9 , 3 0 , 3 1 , 3 3 , 3 4 , 3 5 , 3 6 , 3 7 , 3 8 , 3 9 , 4 0 , 4 1 , 4 2 , 4 3 , 4 4 , 4 5 , 4 6 , 4 7 , 4 8 , 4 9 , 5 0 , . . . . . .
The impolite numbers are exactly the powers of two.It follows from the Lambek–Moser theorem that the nth polite number is ƒ ( n + 1 ) , where
f ( n ) = n + ⌊ lo g 2 ( n + lo g 2 n ) ⌋ .
For more information follow this link
All Content taken from wikipedia, this is for the sole purpose of education, it is in no way intended for copyright violations.