An interesting question ~ 2

Find the remainder when (1!+2!+3!+...+2007!)^500 is divided by 7...

#This question is directly copied from a standard buk... juzz wanna know different ways of solving it...

54 Answers

11
Anirudh Narayanan ·

How? [7][7][7]

11
Subash ·

can sumbody post the complete soln

1
gagar.iitk ·

i think nishant has posted the trick and r will come out to be 1

13
MAK ·

i'm not satisfied wid nishant bhaiya's method... i even posted my query...

n sry gagar... answer is not 1... [2]

11
Anirudh Narayanan ·

(7!+.........2007!) = 7a

1+2+6+24+120+720= 873 = 868+5

thus, give series (1+2!+3!+.......+2007!)500= (7n+5)500
What to do after this?

1
gagar.iitk ·

sorry the ans will be 4 now the value of r as suggested by nishant is 5
therefore the question will reduce to remainder in 5500
we can say 25*5498
→ 25*(56)83 and 56=15625which is of the form 7k+1 so the remainder in (56)83 =1
so the remainder in 25*(56)83=25 which is greater than 7 again calculating the ans will be 4

1
Philip Calvert ·

is the ans 4

sorry i din see that as i was typing the same time

1
gagar.iitk ·

at least i got one support

1
Philip Calvert ·

i too got 5500 but with a different method

1
gagar.iitk ·

let me hear that

1
Philip Calvert ·

nothing just modular arithmetic
(a+b)mod(n) = (a(mod)n+b(mod)n)mod(n)

and the same with multiplication and exponentiation
[1]

62
Lokesh Verma ·

all numbers above 7! will be divisible by 7

write the summation as

7k+r where r is less than 7

and then try..

1
gagar.iitk ·

i must have to increase the level of my mathematics to understand the soln

1
Philip Calvert ·

Aragorn arre mod the % almost in all programming lang

oops sorry forgot you were a bio student
x%y== remainder when x is divided by y

11
Anirudh Narayanan ·

What does this come under? Btw I heard talk of some modulo theory. Something to do wth this?

1
Philip Calvert ·

see aragorn its a bit difficult to explain under the light that you are not used to this modulus
see we need an operator to gives us the remainder we cannot always write
rem=b-[b/a]*a where [] is the GINT

1
gagar.iitk ·

ok the start was gr8 can u through some more light

1
Philip Calvert ·

hey Gagar bhaiyya you re kidding aren't you

is the method wrong?? please tell

1
gagar.iitk ·

no philip this is the weakest part of mine and even i got two consecutive f's in the same topic so just trying my hands

1
Philip Calvert ·

im not a genius at it either [6]
was the 1st prob i solved by the method you see.
learnt it today only

though the statement i wrote above about addition must be clear. [7]

1
Philip Calvert ·

i learnt it today in 20 mins everyone of you can read it somewhere
annd it can be extremely useful
i think now everyone is content with the answer
but hey gagar bhiyya give me something back! [4]
i cant get your method
plz explain [2]

13
MAK ·

well... the answer is not even 4... sorry...

ur interpretation is correct till 5^500...

but i didnt get how d remainder is 4 when 5^500 is divided by 7...?

gagar... can u explain it clearly plzzz...?

11
Anirudh Narayanan ·

Gagar bhaiyyah, MAQ's wondering how u thought of 25.[56]83?

1
gagar.iitk ·

i just wanted the term in the form of 7k+1 thats all and 56on div with 7 gives a remainder of 1 so i arrange the term accordingly

and still i am getting the ans 4 plz tell me if not correct

Your Answer

Close [X]