[apocalyptic]

Originally Posted by shanks4mba

how did u get Rs = 1 and Rd = 1 and others as 5???

We need to find the (mininmum value>10) of Rs+Rd+Ss+Sd
subject to condition (Rs/Rd)^3 =(Ss/Sd)^2
Also Rs != Sd and Ss != Rd

I think all these are satisfied here.

[anytomdickandhary]

corrected my original post....

[MIOCHE]

wat is wilson theorem?

[ash_paglaguy]

Hi, Reposting the question from a previous post.. Nobody posted the solution for it.. But question is really good...

Ques: Two friends, Kumar and Sumit are playing a game. They start with an unlimited supply of coins, with denominations of 1, 5, 10 paisa. They take turns placing a single coin into a pot, which is intially empty. They decide a target amount and amount in the pot should not exceed this target amount. The winner is the player who puts in the last coin in the pot, reaching the target.

1) For which of the following as the target amount kumar will win the game, if he starts the game by putting the first coin?
100 paise 107 paise 113 paise 120 paise 122 paise

2) For which of the following target amount(>10 paisa), whoever starts the game by putting any of the coin would win the game?
69 paise 64 paise 25 paise 84 paise None of the above

....

[ash_paglaguy]

Originally Posted by MIOCHE

wat is wilson theorem?

Wilson Theorem is that 'p' is a prime number iff (p - 1)! mod p = -1

For ex: 4! mod 5 = -1

....

[karthikm]

Crew of 8 member rowing team is chosen from 12 men, of which 3 must row on one side only and 2 must row on other side only. find the number of ways of arranging the crew with 4 members on each side?

answer with explanation plz.. weak in p&c


OA for this??

my approach is

choosing 3 from 7 ppl left in 7C3 ways and then arranging them in 4! x 4! ways

7C3x 4! x 4! = 20160

some others have given ans as 60480. im not able to quote in this new thread..

Can any1 confirm an answer for this?

[karthikm]

Originally Posted by ash_paglaguy

Wilson Theorem is that 'p' is a prime number iff (p - 1)! mod p = -1

For ex: 4! mod 5 = -1

....

adding to yours,

a derivative of this theorem is,

(P-2)! mod P = 1

same eg: 3! mod 5 = 1

[naga25french]

Originally Posted by ash_paglaguy

Hi, Reposting the question from a previous post.. Nobody posted the solution for it.. But question is really good...

Ques: Two friends, Kumar and Sumit are playing a game. They start with an unlimited supply of coins, with denominations of 1, 5, 10 paisa. They take turns placing a single coin into a pot, which is intially empty. They decide a target amount and amount in the pot should not exceed this target amount. The winner is the player who puts in the last coin in the pot, reaching the target.

1) For which of the following as the target amount kumar will win the game, if he starts the game by putting the first coin?
100 paise 107 paise 113 paise 120 paise 122 paise

....

i think its 107

[naga25french]

Originally Posted by ash_paglaguy

2) For which of the following target amount(>10 paisa), whoever starts the game by putting any of the coin would win the game?
69 paise 64 paise 25 paise 84 paise None of the above

....

it should be 69 for this one

[ash_paglaguy]

Originally Posted by karthikm

Crew of 8 member rowing team is chosen from 12 men, of which 3 must row on one side only and 2 must row on other side only. find the number of ways of arranging the crew with 4 members on each side?

answer with explanation plz.. weak in p&c


OA for this??

my approach is

choosing 3 from 7 ppl left in 7C3 ways and then arranging them in 4! x 4! ways

7C3x 4! x 4! = 20160

some others have given ans as 60480. im not able to quote in this new thread..

Can any1 confirm an answer for this?

Your solution is also correct, what it is just missing is that after you selected 3 out of 7 people, you again have to select 2 out of these 3 selected people that will go on one side..

So answer would be... 3C2 * 20160 = 60480

Hope that helps..