Solve this interesting problem

Thanks to all who join this discussion and make it a success....Anyone willing to solve the problem is welcomed. Enjoy it ...!!

Easy Math Editor

This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.

When posting on Brilliant:

Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.

Markdown	Appears as
`italics` or `_italics_`	italics
`bold` or `__bold__`	bold
- bulleted - list	bulleted list
1. numbered 2. list	numbered list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1 paragraph 2	paragraph 1 paragraph 2
`[example link](https://brilliant.org)`	example link
`> This is a quote`	This is a quote
# I indented these lines # 4 spaces, and now they show # up as a code block. print "hello world"	# I indented these lines # 4 spaces, and now they show # up as a code block. print "hello world"

Math	Appears as
Remember to wrap math in `\(` ... `\)` or `\[` ... `\]` to ensure proper formatting.
`2 \times 3`	$2 \times 3$
`2^{34}`	$2^{34}$
`a_{i-1}`	$a_{i-1}$
`\frac{2}{3}`	$\frac{2}{3}$
`\sqrt{2}`	$\sqrt{2}$
`\sum_{i=1}^3`	$\sum_{i=1}^3$
`\sin \theta`	$\sin \theta$
`\boxed{123}`	$\boxed{123}$

Comments

isn't there anybody to encounter this tumbling question....?

Sayan Chaudhuri - 8 years, 1 month ago

I think there are 22 zeroes at the end.

Justin Wong - 8 years, 1 month ago

Actually, nvm. I didn't account for the 23rd digits to add up to a multiple of 10... idk.

Justin Wong - 8 years, 1 month ago

actually i got the answer what the integer S(n) is...but you see i have to calculate it in short time within hardly 3 minute in hand....so i want to learn the technique behind it.....

Sayan Chaudhuri - 8 years, 1 month ago

@Sayan Chaudhuri – can you give me a simple and neat solution for...this...or few examples...to solve these type of mathematical...operations..using....bases.i still dont...know how to...calculate these...using bases

plz

A Former Brilliant Member - 8 years, 1 month ago

@A Former Brilliant Member – see Jay W.'s reply in this discussion ....you would learn at least how to solve such kind of problem....without calculator....

Sayan Chaudhuri - 8 years, 1 month ago

@Sayan Chaudhuri – ok...i got....that.

thank u soooo much :)

A Former Brilliant Member - 8 years, 1 month ago

yes,you are right to "guess"....but would you kindly describe to calculate such type of problem at exam hall without spending much of time...thanking you for any help if you yield.......

Sayan Chaudhuri - 8 years, 1 month ago

Maybe you would have already noticed, but see there are 2 pairs of 99!,98!2!,97!3!.. 100!. also there are 2 pairs of 50! factorial, in S(n). Maybe you could use it, or find a way to use it.

Aditya Parson - 8 years, 1 month ago

there, ll be 144 zeroes in this expression, because the largest term in this series is 50!50! and all other terms are smaller and have very less zeroes in them as compared to 144 zeroes in 50!50! therfore, their additon will not make much of a difference in the no of zeroes of whole expression.

Pratik Singhal - 8 years, 1 month ago

so far to my calculation,.....you are absurdly wrong.....there can never be 144 zeroes in the term 50!50! because the number 50!50! only contains 129 decimal digits in base 10....your reason that being other terms so smaller they would not make much of a difference in the number of zeroes also sound to be halting and proofless...actually there is only 22 zeroes at last of the number S(n)....only find the technique that could solve it in time saving process.....i only took help of calculator to do this but you see that's not a process,not yours too....better try...enjoy it...:)

Sayan Chaudhuri - 8 years, 1 month ago

There are 24 zeroes at the end of 50!50!. There are at least 22 zeroes at the end of the sum. To have a zero at the end, we need a 2 and 5 in the factorization (2*5=10). So to count the zeroes at the end of an expression, you count the number of pairings of 2 and 5. In factorials, we only need to count 5s because there are less 5s than 2s. Counting, we see that there are 10 multiples of 5 in 50!. However, two of these multiples are also multiples of (5^), or 25. We add another 5 for each of these, coming with a total of 12. %0!50! therefore has 24 zeroes or pairs of (25) in its decimal representation in base 10. After a little more work, it seems as like every number (from 1!99! to 49!51!) except 50!50! could have 22 zeroes at the end. However, 25!75! and 75!25! also have 24 zeroes, as does 50!50 (do you see why?) More work yields that when r is congruent to 0(mod5), it has 23 zeroes. So the least zeroes that any component of the sum is 22; hence there are at least 22 zeroes at the end. But when adding numbers, we can add more zeros to the end if in some 10^n th digit-place the digits add up to a number congruent to 0(mod10). So there might be more zeroes, but I am too lazy right now/under-educated to go any further. Concerning the second part, we could divide the sum by 10^z (where z is the number of zeroes at the end) and do some modular arithmetic/Chinese Remainder Theorem or something.

Justin Wong - 8 years, 1 month ago

thanx a lot for you gave perfect and neat technique for the solution of the problem.....however i got to the perception for solving such kind of problems...once again thanx....

Sayan Chaudhuri - 8 years, 1 month ago

@Sayan Chaudhuri – Aww, thanks. You are welcome. I try.

Justin Wong - 8 years, 1 month ago