- © 2015-2016
- Careers
- Advertise
- Contact Us

Posts and Comments

Hi Guyz,

the following set is the one which appeared in AIMCAT1003. Please suggest an alternative method to solve it.

**Sixty-four players seeded from seed 1 to seed 64 participated in a knock-out tennis tournament. Seed 1 is the highest seed and seed 64 is the lowest seed. The tournament would be played in six rounds i.e., first round, second round, third round, quarterfinals, semi finals and final. In the first round, the player with the highest seed (i.e., 1) would play with the player with the lowest seed (i.e., 64) which is designated Match No.1. Similarly, the player with the second highest seed (i.e., 2) would play with the player with the second lowest seed (i.e., 63), which is designated Match No.2 and so on. **

In the second round, the winner of the Match No.1 of the first round would play with the winner of the Match No.32 of the first round and this match is designated Match No.1 of the second round.

Similarly, the winner of the Match No.2 of the first round would play with the winner of the Match No.31 of the first round and this match is designated Match No.2 of the second round and so on. In the similar pattern the subsequent rounds will be played.

**1.** **If the player seeded 43 won the tournament, then which of the following players cannot be the runner-up?**

(1) Player seeded 44 (2) Player seeded 45 (3) Player seeded 46 (4) Player seeded 36 (5) Player seeded 37

2.Who could be the lowest seeded player facing the player seeded 12 in the finals?

(1) 57 (2) 59 (3) 62 (4) 63 (5) 64

3.If one of the matches was between the players seeded 23 and 46, then one of the matches in the tournament can be between players seeded

(1) 9 and 13 (2) 6 and 18 (3) 5 and 51 (4) 17 and 15 (5) 34 and 56

4.If there are only five upsets (a lower seeded player beating a higher seeded player) in the tournament, then who could be the lowest seeded player winning the tournament?

(1) 16 (2) 17 (3) 63 (4) 33 (5) 32

5.**If each player is involved in at most one upset (a lower seeded player beating a higher seeded player), then who could be the lowest seeded player winning the tournament?**

(1) 47 (2) 33 (3) 32 (4) 31 (5) 17

Please post the details of the method used for solving

the following set is the one which appeared in AIMCAT1003. Please suggest an alternative method to solve it.

In the second round, the winner of the Match No.1 of the first round would play with the winner of the Match No.32 of the first round and this match is designated Match No.1 of the second round.

Similarly, the winner of the Match No.2 of the first round would play with the winner of the Match No.31 of the first round and this match is designated Match No.2 of the second round and so on. In the similar pattern the subsequent rounds will be played.

(1) Player seeded 44 (2) Player seeded 45 (3) Player seeded 46 (4) Player seeded 36 (5) Player seeded 37

2.Who could be the lowest seeded player facing the player seeded 12 in the finals?

(1) 57 (2) 59 (3) 62 (4) 63 (5) 64

3.If one of the matches was between the players seeded 23 and 46, then one of the matches in the tournament can be between players seeded

(1) 9 and 13 (2) 6 and 18 (3) 5 and 51 (4) 17 and 15 (5) 34 and 56

4.If there are only five upsets (a lower seeded player beating a higher seeded player) in the tournament, then who could be the lowest seeded player winning the tournament?

(1) 16 (2) 17 (3) 63 (4) 33 (5) 32

5

(1) 47 (2) 33 (3) 32 (4) 31 (5) 17

Please post the details of the method used for solving

(10A+B)(10C+D)= 100AC+10AD+10BC+BD

(10A+B)(10D+C)= 100AD+10BD+10AC+BC

subtract 2nd frm 1st

d= 9(C-D)(10A+B)

d shld be divisible by 9, so option a,b gone(sum is nt divisbl by 9)

max(d) = 9(9-0)(10.9+9) = 8019 so option d gone

hence only option left c

therfore option(c)

Whats the OA?

Yup ... its option C

- 1 Like

1.1234 2.2345 3.3456 4.9495

Pls post your approach

Options

1.14.14m

2.14.28m

3.16.66m

4.12.5m

Please post a detailed solution

ash_paglaguy SaysIs the answer a^2/4..

but how please explain ...

barclays_boss Saysif a n degree equation has n+1 roots...then what can we say about the nature of the equation?.....for eg. if a quadratic equation happens to have three roots

Is this possible? I doubt .... please provide an example if you have one ...

This is one of the questions in AIMCAT 1009 (Q62).

"If the equation of the tangent drawn to a circle with (2,-1) as centre is 3x+y=0 . then find the equation of the other tangent from origin to circle"

1.3x-y=0

2.x+3y=0

3.x-3y=0

4.x+2y=0

Please provide a detailed solution .. i didnt get the one provided by TIME

When you reverse the digits of the number 13, the number increases by 18. How many other two-digit numbers increase by 18 when their digits are

5

6

7

8

10

Answer is 6

24

35

46

57

68

79

*************************

0Comments »new comments