The ratio of the sum of the lengths of all chord roads to the length of the outer ring road is

1.  √ 5:2

2.  √5 : 2

3.  √5 :?

4.  None of the above

4

√5 :?

Explanation :
No Explanation available for this question

The number of positive integers n in the range 12  n? 40 such that the product (n – 1) (n –2)…3.2.1 is not divisible by n is

1.  5

2.  7

3.  13

4.  14

4

7

Explanation :
No Explanation available for this question

If x, y, z are distinct positive real numbers then would be

1.  greater than 4

2.  greater than 6

3.  greater than 5

4.  None of the above

4

greater than 5

Explanation :
No Explanation available for this question

In a certain examination paper, there are n questions. For j = 1, 2 …n, there are  2n-j students who answered j or more questions wrongly. If the total number of wrong answers is 4095, then the value of n is

1.  12

2.  11

3.  10

4.  9

4

12

Explanation :
No Explanation available for this question

Consider the following two curves in the x -y plane:   y = x 3 + x 2 + 5   y = x 2 + x + 5 Which of the following statements is true for -2 x ? 2?

1.  The two curves intersect once

2.  The two curves intersect twice

3.  The two curves do not intersect

4.  The two curves intersect thrice

4

The two curves intersect thrice

Explanation :
No Explanation available for this question

Let T be the set of integers {3, 11, 19, 27,…451, 459, 467} and S be a subset of T such that the sum of no two elements of S is 470. The maximum possible number of elements in S is

1.  32

2.  28

3.  29

4.  30

4

30

Explanation :
No Explanation available for this question

A graph may be defined as a set of points connected by lines called edges. Every edge connects a pair of points. Thus, a triangle is a graph with 3 edges and 3 points. The degree of a point is the number of edges connected to it. For example, a triangle is a graph with three points of degree 2 each. Consider a graph with 12 points. It is possible to reach any point from any other point through a sequence of edges. The number of edges, e, in the graph must satisfy the condition

1.  11 e ? 66

2.  10 ? e ? 66

3.  11 ? e ? 65

4.  0 ? e? 11

4

11 e ? 66

Explanation :
No Explanation available for this question

There are 6 boxes numbered 1, 2, …6. Each box is to be filled up either with a red or a green ball in such a way that at least 1 box contains a green ball and the boxes containing green balls are consecutively numbered. The total number of ways in which this can be done is

1.  5

2.  21

3.  33

4.  60

4

21

Explanation :
No Explanation available for this question

How much does M owe to S in US Dollars

1.  3

2.  4

3.  5

4.  6

4

5

Explanation :
No Explanation available for this question

1.  428

2.  416

3.  334

4.  324

4