[(1!)^(1!) + (2!)^(2!) + (3!)^(3!) + ............ + (1000!)^(1000!)] / [2^3 X 5^1].
Find the Remainder.
[(1!)^(1!) + (2!)^(2!) + (3!)^(3!) + ............ + (1000!)^(1000!)] / [2^3 X 5^1].
Find the Remainder.
@The_Loser said:in hw many ways alphabet of letter be arranged so that dre are 7 letters bw a & b.
@sunnychopra89 said:[(1!)^(1!) + (2!)^(2!) + (3!)^(3!) + ............ + (1000!)^(1000!)] / [2^3 X 5^1].Find the Remainder.
@The_Loser said:bhai kya kiya hai ye?
@The_Loser said:in hw many ways alphabet of letter be arranged so that dre are 7 letters bw a & b.
@sunnychopra89 said:[(1!)^(1!) + (2!)^(2!) + (3!)^(3!) + ............ + (1000!)^(1000!)] / [2^3 X 5^1].Find the Remainder.
@bs0409 said:Use CRT
Let Nr=X
then Xmod8=5
also, Xmod5=2
8a+5=5b+2=37
a=4,b=7
ans=37
@sunnychopra89 said:@bs0409 Could u plz telme in brief what is CRT/Chineese Remainer Theorem.
examination
fr 1st 3 papers = max marks 50
4th exm - max marks 100
find no f ways one can score 60% ?
3^1/3.
@The_Loser said:examination fr 1st 3 papers = max marks 504th exm - max marks 100find no f ways one can score 60% ?
@bs0409 said:Write Denominator as a*b where a and b are coprime to each other.
Find Nr mod a (=x say) and Nr mod b (=y say).
then solve am+x=bn+y for m and n in integers. the value will be the remainder....
@shattereddream said:If you hav a subset of integers to chosen bet. 1 to 3000, such that no integers add up to multiple of nine, what can be the max number of elements in the subset?1. 16682. 13323. 13334. 1334
@Subhashdec2 said:considering 1 and 3000 are not included9k+1-3339k+2-3349k+3-3339k+4-3339k+5-3339k+6-3339k+7-3339k+8-3339k-333we can have 9k+1,9k+2,9k+3,one among9k+4/9k+5334+333*3 =1333
@shattereddream said:If you hav a subset of integers to chosen bet. 1 to 3000, such that no integers add up to multiple of nine, what can be the max number of elements in the subset?1. 16682. 13323. 13334. 1334