@notimetowaste said: if u multiply 10!, the last digit u get is 8,(ignoring 0's and taking the nonzero numbers only), then upto 96! we have nine 8's to multiply with 6!(which has last digit 2) of 96! so in totality we have,8^9*2= will give last digit = 6 (u can solve 8^9 using cyclicity of powers)i know this method is not good for bigger numbers if anyone knows to do in a better way, kindly highlight them
@YouMadFellow said: www.wolframalpha.com/input/?i=...Ans is -2 or 69.. I guess after the last step k = +2, or -2
did u get this answer? i guess its in four ways.
@sameersapre23 said: please anyone explain this question its recent aimcat questionin how many ways 600 can be expressed as the sum of two or more consecutive integers.... !!
@janvats said: find the remainder when (38^16!)^1777 is divided by 17 a. 1 b. 16 c. 8 d. 13
@taruniim said: what is the remainder when 9+9^2+9^3............9^(2n+1) is divided by 6.....ans is 36=2 *3..all powers of 9 leave remainder 0 and 1 in case of division by 3 and 2 respectively...so remainder should be of form 1+1+1...(2n+1)times...i.e remainder on divin by 2 should be 1...so answer sud b 1...bt answer is 3...??HELP..
First of all if you get any question in generalized form such as this, the quick and dirty way is to put values and tick the answer. Like here Put n=0, you get answer 3 and done. This is CAT not IIT JEE.
You are right that, 3 divides the expression, but 2 leaves a remainder of 1. Like for 9|2 gives 1 as remainder, and when 9+9^2+9^3|2 leaves 1 as remainder.
Now, E = 3k and E=2k' +1. Since E gives a remainder of 1 when divided by 2, so
3k gives a remainder of 1 when divided by 2, knowing that 3 gives a remainder of 1 when divided by 2, K should also give a remainder of 1 when divided by 2. Hence,
k=2k'' +1
so 3k=6k''+3
Therefore, E=6k''+3.
This is a special case of Chinese Remainder Theorem, if say n1 divides E and n2 gives a remainder of k, then n1*n2 gives a remainder of n1*k while dividing E.
Puys please help:
122333444.... upto 1000 digits when divided by 16 yields?
How do I solve such type of questions - Approach please!
@akansh_1 said: Puys please help: 122333444.... upto 1000 digits when divided by 16 yields? How do I solve such type of questions - Approach please!
@akansh_1 said: Puys please help: 122333444.... upto 1000 digits when divided by 16 yields? How do I solve such type of questions - Approach please!
At n = 32. this sum becomes 966.
Thanks a lot ..Enceladus and mani0303 for the approach.
@[262236:akansh_1] what is the answer?
@[75748:karl]..is there any particular method for solving remainder problems when factorials r involved and v cant apply wilson or fermats theorem?
@[592846:YouMadFellow] couldnt get the right ans of this Qs
@[419941:Enceladus]two numbers a & b r such dat their GM is 20% lower than AM find ratio b/w numbrz. couldnt find the right ans
@[592846:YouMadFellow] the sum of first four terms of AP is 28 & sum of first 8 terms of same AP is 88 find sum of first 16 terms of AP
@[592846:YouMadFellow] A SUM of money kept in bank amounts to Rs 1240 in 4 years and Rs 1600 in 10 years at simple interest. find the sum
@notimetowaste said: did u get this answer? i guess its in four ways.
@[595194:sahib_sheetu]
@sahib_sheetu said: @YouMadFellow couldnt get the right ans of this Qs the sum of three numbrz in gp is 14 & sum of their squares is 84 find the largest.plz help me out
@sahib_sheetu said: @YouMadFellow the sum of first four terms of AP is 28 & sum of first 8 terms of same AP is 88 find sum of first 16 terms of AP
@sahib_sheetu said: @YouMadFellow A SUM of money kept in bank amounts to Rs 1240 in 4 years and Rs 1600 in 10 years at simple interest. find the sum