One from my side:
Q)In an integer d1d2...dk from left satisfy didi+1 for i even. How many integers from 1000 to 9999 have four distinct digits?
rupam_1987 SaysIs it option b) 778 ?
No. thats not the answer. Its 882.
One from my side:
Q)In an integer d1d2...dk from left satisfy didi+1 for i even. How many integers from 1000 to 9999 have four distinct digits?
rupam_1987 SaysIs it option b) 778 ?
Hello Friends,,,
Help me in solving this problem :
remainder of 5555......93times divided by 98
Didn't understood the answer in totalgadha!!!
hello Friends,, Help me in solving this problem !!!!
1: 2^1990 mod 1990 ( Remainder )
.
hello Friends,, Help me in solving this problem !!!!
1: 2^1990 mod 1990 ( Remainder )
.


How many 7-digit numbers exist which are divisible by 9 and whose last but one digit is 5?
msabhi SaysHow many 7-digit numbers exist which are divisible by 9 and whose last but one digit is 5?
Hello Friends,,,
Help me in solving this problem :
remainder of 5555......93times divided by 98
Didn't understood the answer in totalgadha!!!
msabhi SaysHow many 7-digit numbers exist which are divisible by 9 and whose last but one digit is 5?
R @ J SaysIs the answer 100000?
R @ J SaysIt should leave a remainder of 23 when divided by 98....
jain_ashu SaysPls provide the solutions.

answer not given puys :(...am sorry...i cudnt solve it ..so wanted to know aproach and come to conclusion ,which is nothing but puys answer ...my apologies 😞
hello Friends,, Help me in solving this problem !!!!
1: 2^1990 mod 1990 ( Remainder )
.
2^1990 mod 199 = 29
2^1990 mod 5 = 4.
So,199a + 29 = 5b+4 = 2c.
On solving we get 2^1990 mod 1990 = 1507.
Sahana Kavitha SaysAshu, On solving 199a + 29 = 5b+4 = 2c, I'm getting a=5, b=204, c=512, how did u arrive 1507? I thought the ans is 1024..
Hello Friends,,,
Help me in solving this problem :
remainder of 5555......93times divided by 98
Didn't understood the answer in totalgadha!!!
Hello Friends,,,
Help me in solving this problem :
remainder of 5555......93times divided by 98
Didn't understood the answer in totalgadha!!!
98 = 2*49
now 5555.....93 times mod49 = 9
55555...93timesmod 2 = 1
so the num is of the form 2k+1 = 49m+9
it comes to be 98k+ 107
so the remainder is 107
= 5(10^92+10^91+10^90.....10^0) % 98
= 5(2^46+ 2^45(10+1)+ 2^44(10+1)+ 2^43(10+1)......2^0(10+1)) % 98
= 5(2^46+ 11(2^45 + 2^44 + 2^43....+2^0)) % 98
= 5(2^46 + 11(2^46 - 1)) % 98
= 5(12*2^46 -11)) % 98
= (60*2^46 - 55) % 98, solving this
= (78-55) % 98
= 23
jain_ashu SaysPls specify what method have you used for 5555.....93 times mod49 bcoz 49 is not a prime number???
199a + 29 = 5b+4. So, the general case becomes 995m+1024.
Now, 995m+1024 = 2c. at m = 2, c = 1507.
P.S : Have just applied the chinese reminder theorem
Could you pls elaborate on the red part? How have you converted powers of 10 to powers of 2 and where have the 5s gone?
Thanx.
= 5(10^92+10^91+10^90.....10^0) % 98
= 5(2^46+ 2^45(10+1)+ 2^44(10+1)+ 2^43(10+1)......2^0(10+1)) % 98
= 5(2^46+ 11(2^45 + 2^44 + 2^43....+2^0)) % 98
= 5(2^46 + 11(2^46 - 1)) % 98
= 5(12*2^46 -11)) % 98
= (60*2^46 - 55) % 98, solving this
= (78-55) % 98
= 23
hello Friends,, Help me in solving this problem !!!!
1: 2^1990 mod 1990 ( Remainder )
.