Let:-
λ = n = 0 ∑ 1 7 2 9 1 7 2 9 1 7 2 9 ⌊ 5 n 1 7 2 9 1 7 2 9 1 7 2 9 ⌋
Calculate the value of ( λ m o d ( 1 7 2 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.
A very nice and difficult problem! :)
Thanks dud....
Representing 172917291729 in base 5 is not an easy task. Not only does it require many calculations but its also very tedious. Writing a program for calculating n = 1 ∑ 1 6 ⌊ 5 n 1 7 2 9 1 7 2 9 1 7 2 9 ⌋ is much easier.
Note
:-( i don't even know the ABCD of programming.......
Great problem to commemorate an extraordinary man. Doesn't look like much fun to write 172917291729 in base 5, however, hahaha!
Yeah writing b l a h in base 5 was a very tedious task.....please post your solution...how solved this problem
Also, isn't the given summation what is used to calculate trailing zeroes of 172917291729! and not just the largest power of 5 that divides it? Or am I mistaken?
Also try Aman's Greek Letter Challenge
Once n is sufficiently large all the terms become zero. Also the fact that we need to find λ ( m o d 1 7 2 9 ) simplifies the work. We can immediately throw out n=0.
Note that 1 7 2 9 1 7 2 9 1 7 2 9 = 1 0 0 0 1 0 0 0 1 ⋅ 1 7 2 9 .
So for the first four terms
⌊ 5 n 1 7 2 9 1 7 2 9 1 7 2 9 ⌋ ≡ ⌊ 5 n 1 7 2 9 ⌋ ( m o d 1 7 2 9 )
And for terms five to eight
⌊ 5 n 1 7 2 9 1 7 2 9 1 7 2 9 ⌋ ≡ ⌊ 5 n 1 7 2 9 1 7 2 9 ⌋ ( m o d 1 7 2 9 )
And now we can simply calculate these terms, getting: 345 +69 +13 +2 +5533 +1106 +221 +44 +88533 +17706 +3541 +708 +141 +28 +5 +1=117996 1 1 7 9 9 6 ≡ 4 2 4 ( m o d 1 7 2 9 )
( A w s o m e ) ∞
Really amazing!
Problem Loading...
Note Loading...
Set Loading...
Let 1 7 2 9 1 7 2 9 1 7 2 9 = k Given series can be written as:-
1 7 2 9 1 7 2 9 1 7 2 9 + n = 1 ∑ k ⌊ 5 n 1 7 2 9 1 7 2 9 1 7 2 9 ⌋ . . . . . . ( 1 )
Now observe the term ∑ 5 n b l a h in equation (1) deeply for a minute, it is actualy counting the largest power of 5 which can divide 1 7 2 9 1 7 2 9 1 7 2 9 ! without leaving any remainder .Now we will use the following well known result:-
For an integer j and a prime p largest power of p which can divide j ! without leaving any remainder is :- O r d p ( j ! ) = p − 1 j − σ p ( j )
Note that the notation O r d p ( j ! ) is used to represent largest power of p which can divide j ! and σ p n denotes the sum all digits of j when expressed in base p
Now we are in a better situation because now can calculate the value of ∑ 5 n b l a h easily by using this theoram
Hence :-
n = 1 ∑ k ⌊ 5 n 1 7 2 9 1 7 2 9 1 7 2 9 ⌋ = 4 1 7 2 9 1 7 2 9 1 7 2 9 − σ 5 ( 1 7 2 9 1 7 2 9 1 7 2 9 ) . . . . ( 2 )
Now:-
1 7 2 9 1 7 2 9 1 7 2 9 = ( 1 0 3 1 3 1 1 3 3 1 1 3 1 3 4 0 4 ) 5 Hence σ 5 ( 1 7 2 9 1 7 2 9 1 7 2 9 ) = 3 3 ,putting this value in equation (2) we get:-
n = 1 ∑ k ⌊ 5 n 1 7 2 9 1 7 2 9 1 7 2 9 ⌋ = 4 1 7 2 9 1 7 2 9 1 7 2 9 − 3 3
And finaly putting this value in equation (1):-
n = 0 ∑ k ⌊ 5 n 1 7 2 9 1 7 2 9 1 7 2 9 ⌋ = 2 1 6 1 4 6 6 1 4 6 5 3
Hence λ = 2 1 6 1 4 6 6 1 4 6 5 3
Also λ = 1 2 5 0 1 2 5 0 1 × 1 7 2 9 + 4 2 4
Hence
λ m o d ( 1 7 2 9 ) = 4 2 4
Also note that we don't need to worry about the value of k because when value of 5 n will grow larger then 1 7 2 9 1 7 2 9 1 7 2 9 each floor operation will yeild the answer 0 so it does not effect our result
If you know any other mathod for solving this question ,please post it.