math questions help me!!!!!!!

geez why

you know thats mean

*farts*

For first

9/10 = 0 R9

8/9 = 0 R8

if you are use intgers

For another

first the total number of games is that can be played is (3*2*1)^3 (the number of ways to order the cards  times itself by the number of players). 6^3 =216

Second, round one  3*2*1 because one played can play any color and the second two, a last only one. round two, 2*2*1, two play can any color in their hand because no matter what play one play, one of the others doesn't have and thus can play either. third round1*1*1, every players has one card.

1*4*6 =24

24/216 = .1111111

I think thats right

The card problem can also be explained like this:

 round 1:  player 1 randomely picks a card, now player 2 has a 2/3 chance left not to turn over the same colour. After player 2 turns over different colour, player 3 has only a 1/3 chance not to turn over a colour that has either been played by player 1 or 2.

So for the first round, that's a probability of 1/3*2/3 = 2/9

round 2: Each player has 2 cards. PLayer 1 randomely picks a card. PLayer 2 or player 3 doesn't have the colour that player 1 turns over, so for one of these players the chance of not playing the same card is 1/1. For the other player, this chance is 1/2.

So for the second round that's a probability of 1/1*1/2 = 1/2

round 3. Each player has one card left, probability 1/1.

so, for the 3 rounds that's a probability: (2/9)*(1/2)*(1/1) = 1/9 = 0.1111...

thanks for problem #2, but i still don't get problem #1

I don't really get your problem, because Ruah allready told you the answer:P

If you want to find the smallest number "X" with a certain remainder "R", when divised by a number "D", then this smallest number is allways "R" itself,

because the remainder itself is 0*D + "R"

Take an example.. smallest number "X" with a remainder 5, when divised by 7

is ofcourse 5, because it's 0*7 + 5.

 I might not fully understand your problem, because it's really just this simple;P

okay i'll try asking some1 else

#1 is pretty easy...just make each number congruent to 1 + each mod, then subtract one away from each...and you end with 2519