A problem from my book

Function f ( n ) f(n) is defined as the sum of digits of n n being repeated until that sum becomes a single digit. For example, [f(123456)=(1+2+3+4+5+6)=(21)=(2+1)=(3)=3.

Find the value of F ( 2612000 ! ) F(2612000!) .

Notation :
! ! denotes the factorial notation. For example, 10 ! = 1 × 2 × 3 × × 10 10! = 1\times2\times3\times\cdots\times10 .


The answer is 9.

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.

2 solutions

Puneet Mangla
Mar 2, 2016

The number 2612000 is not a special number whose sum of digits can be calculated . Actually it can be done with factorial of any number greater than 6 and answer will be same. so lets start with our solution; The number given is 2612000! so we all know that it is divisible by 9, and for divisibility by 9 the sum of digits must be a multiple of 9. so let X be the sum obtained by adding digits of 2612000!. and this X will surely be a multiple of 9 say 9a,which again means that X is divisible by 9. and if we add digits of X we will get a new number which is multiple of 9 say Y. which again means that Y is divisible by 9. and hence we will do adding the digits of sum obtained and finally come towards a one digit number which is none other than 9 as 9 is divisible by 9.hence the answer is 9.

this one was nice.

aryan goyat - 5 years, 3 months ago
Aryan Goyat
Mar 4, 2016

2612000!=3^(k)p where p is another natural no . now since it is divisible by 3^(2) so sum of its is of form 9z and so on it goes on until z=1.

Yes factorial of any number greater than or equal to 6 will give the answer 9.

Archit Agrawal - 5 years, 3 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...