Search found 8 matches


Call the number of letters n, then you have (n^2)/2 different codes. n different possibilities for the first letter, n-1 for the second plus one for the case the second letter is "empty". You divide by two to account for the alphabetical order.

The least n with (n^2)/2>12 is n=5.

Antoni

by ASS1991

Tue Jul 28, 2009 6:31 pm
Forum: Problem Solving
Topic: Medical experiment
Replies: 6
Views: 6598

Hey, if all three team earn 3 points, who got first in the race? Even if each team sends only one participant, there must be a winner, second and third placed. Therefore we have to allocate the points 1 to 5 on three accounts such that the minimum is as high as possible while the maximum stays 6. Te...

by ASS1991

Tue Jul 28, 2009 12:53 am
Forum: Problem Solving
Topic: Race
Replies: 3
Views: 1259

Nice question, but don't we need the radius/diameter or any other information?

by ASS1991

Mon Jul 27, 2009 5:55 pm
Forum: Problem Solving
Topic: napkin ring
Replies: 7
Views: 2211

With the coordinates given, it is easy to calculate the distance between the center of the circle and the two points. You don't even have to use the general formula (Root of (Difference of x-values plus Difference of y-values) because in both cases either the x or the y-value remains the same. So th...

by ASS1991

Fri Jul 24, 2009 3:21 pm
Forum: Problem Solving
Topic: Circle!
Replies: 2
Views: 1304

Sry, I get answer (c), hope you find my error.

(x/x+y)*10+(y/x+y)*20
=10*((x+y)/(x+y) + (y/x+y))
=10 + (y/x+y)*10

=> 15<10 + (y/x+y)*10<20

=> Answer (c) 16.

Thanks,
Antoni

by ASS1991

Tue Jul 21, 2009 5:30 pm
Forum: Problem Solving
Topic: integers values
Replies: 3
Views: 1250

Can you post the quenstion?

Thanks :)

by ASS1991

Tue Jul 21, 2009 5:17 pm
Forum: Problem Solving
Topic: Any other way for this problem?
Replies: 6
Views: 1316

Where did you find this question?

Obviously states x!=y! <=> x=y.

Hence
2!=(m-1)! <=>
2=m-1 <=>
3=m

by ASS1991

Mon Jul 20, 2009 9:56 pm
Forum: Problem Solving
Topic: factorial question!
Replies: 2
Views: 1448

Dear sureshbala,

I would like to thank you for these great problems. I did them just for fun (I wont take the GMAT in the next 3 years) and it was great pleasure to solve your questions!

Hope you continue with problems of this (or even higher :wink: ) difficulty!

Best regards,
Antoni

by ASS1991

Mon Jul 20, 2009 9:51 pm
Forum: Problem Solving
Topic: Problem Solving for 780+ Aspirants.
Replies: 209
Views: 63797