@saurav205 said:Q>Find the remainder when 2222^5555 + 5555^2222 is divided by 7?options :1,3,0 and 5
0
@saurav205 said:Q>How many number of zeroes will be there at the end of 12! expressed in base 6?options ;4,5,6,7
OA : 5
approach :6= 3*2
[12/3] + [4/3] = 5
hence 5 zeroes.
@saurav205 said:Q>How many number of zeroes will be there at the end of 12! expressed in base 6?options ;4,5,6,7
5?
@joyjitpal said:1
2222^5555 + 5555^2222 Mod 7
= 3^5555 + 4^2222 mod 7
= (3^5)^1111 + (4^2)^1111 mod 7
= 5^1111 + 2^1111 mod 7
=0
as we know that a^n + b^n is divisible by (a+b) when n is odd,
= 3^5555 + 4^2222 mod 7
= (3^5)^1111 + (4^2)^1111 mod 7
= 5^1111 + 2^1111 mod 7
=0
as we know that a^n + b^n is divisible by (a+b) when n is odd,
@saurav205 said:Q>Find the remainder when 2222^5555 + 5555^2222 is divided by 7?options :1,3,0 and 5
0...cat 12 mein aaya tha...
@saurav205 said:Q>How many number of zeroes will be there at the end of 12! expressed in base 6?options ;4,5,6,7
5 zeros
@saurav205 said:Q>How many number of zeroes will be there at the end of 12! expressed in base 6?options ;4,5,6,7
Counting the number of zeros is nothing but counting the number of 6's in base 6.
6 = 2X3
12! has 10 2's and 5 3's. minimum of (10,5) = 5. Hence 5.
6 = 2X3
12! has 10 2's and 5 3's. minimum of (10,5) = 5. Hence 5.
@saurav205 said:Q>Find the remainder when 2222^5555 + 5555^2222 is divided by 7?options :1,3,0 and 5
0 only (a+b) rule
@saurav205 said:Q>Find the remainder when 2222^5555 + 5555^2222 is divided by 7?options :1,3,0 and 5
0
N is a 1001 digit number consisting of 1001 sevens. What is the remainder when N is divided by 1001?
Options:
7,777,700, 707
@mailtoankit said:0...cat 12 mein aaya tha...
Kya baat hai?? tere slot mein?
Nishit Sinha k book mein bhi hai...
@saurav205 said:N is a 1001 digit number consisting of 1001 sevens. What is the remainder when N is divided by 1001?Options:7,777,700, 707
700
@saurav205 said:Kya baat hai?? tere slot mein?Nishit Sinha k book mein bhi hai...
haan bhai....meine bhi pehele kiya hua tha!!
@saurav205 said:N is a 1001 digit number consisting of 1001 sevens. What is the remainder when N is divided by 1001?Options:7,777,700, 707
700
@saurav205 said:N is a 1001 digit number consisting of 1001 sevens. What is the remainder when N is divided by 1001?Options:7,777,700, 707
700
@saurav205 said:N is a 1001 digit number consisting of 1001 sevens. What is the remainder when N is divided by 1001?Options:7,777,700, 707
700
777777 mod 1001 = 0 ( 6 digits)
Hence Only 77777 is left ( 1001 mod 6 = 5 )
77777 mod 1001 = 700 ...
@viewpt said:7
Make pairs of 3 starting from right and add and subtract.
We get sum as 0 till the 998th pair. Now we are left with +777 - 77 = 700
So 700 mod 1001 = 700
We get sum as 0 till the 998th pair. Now we are left with +777 - 77 = 700
So 700 mod 1001 = 700
@Ibanez said:Make pairs of 3 starting from right and add and subtract. We get sum as 0 till the 998th pair. Now we are left with +777 - 77 = 700So 700 mod 1001 = 700
bhai wahi rule toh lagaya tha 7 11 13 wala kuch calc mistake ho gayi thi..