Top 10+ XAT Progressions and Series Questions with Solutions PDF

In a school, the number of students in each class, from Class I to X, in that order, are in an arithmetic progression. The total number of students from Class I to V is twice the total number of students from Class VI to X.

If the total number of students from Class I to IV is 462, how many students are there in Class VI?

Consider $$a_{n+1} =\frac{1}{1+\frac{1}{a_{n}}}$$ for $$n = 1,2, ....., 2008, 2009$$ where $$a_{1} = 1$$. Find the value of $$a_{1}a_{2} + a_{2}a_{3} + a_{3}a_{4} + ... + a_{2008}a_{2009}$$.

A marble is dropped from a height of 3 metres onto the ground. After hitting the ground, it bounces and reaches 80% of the height from which it was dropped. This repeats multiple times. Each time it bounces, the marble reaches 80% of the height previously reached. Eventually, the marble comes to rest on the ground.

What is the maximum distance that the marble travels from the time it was dropped until it comes to rest?

Shireen draws a circle in her courtyard. She then measures the circle’s circumference and its diameter with her measuring tape and records them as two integers, A and B respectively. She finds that A and B are co-primes, that is, their greatest common divisor is 1. She also finds their ratio, A:B, to be: 3.141614161416… (repeating endlessly).

What is A - B ?

If both the sequences x, a1, a2, y and x, b1, b2, z are in A.P. and it is given that $$y > x$$ and $$z < x$$, then which of the following values can $$\left\{\frac{(a1-a2)}{(b1-b2)}\right\}$$ possibly take?

A man is laying stones, from start to end, along the two sides of a 200-meterwalkway. The stones are to be laid 5 meters apart from each other. When he begins, all the stones are present at the start of the walkway. He places the first stone on each side at the walkway’s start. For all the other stones, the man lays the stones first along one of the walkway’s sides, then along the other side in an exactly similar fashion. However, he can carry only one stone at a time. To lay each stone, the man walks to the spot, lays the stone, and then walks back to pick another. After laying all the stones, the man walks back to the start, which marks the end of his work. What is the total distance that the man walks in executing this work? Assume that the width of the walkway is negligible.

When opening his fruit shop for the day a shopkeeper found that his stock of apples could be perfectly arranged in a complete triangular array: that is, every row with one apple more than the row immediately above, going all the way up ending with a single apple at the top.
During any sales transaction, apples are always picked from the uppermost row, and going below only when that row is exhausted.
When one customer walked in the middle of the day she found an incomplete array in display having 126 apples totally. How many rows of apples (complete and incomplete) were seen by this customer? (Assume that the initial stock did not exceed 150 apples.)

The sum of series, (-100) + (-95) + (-90) + …………+ 110 + 115 + 120, is:

Consider the set of numbers {1, 3, $$3^{2}$$, $$3^{3}$$,…...,$$3^{100}$$}. The ratio of the last number and the sum of the remaining numbers is closest to:

What is the sum of the following series?
-64, -66, -68,............., -100

Let $$a_{n} = 1 1 1 1 1 1 1..... 1$$, where 1 occurs n number of times. Then,
i. $$a_{741}$$ is not a prime.
ii. $$a_{534}$$ is not a prime.
iii. $$a_{123}$$ is not a prime.
iv. $$a_{77}$$ is not a prime.

In a list of 7 integers, one integer, denoted as x is unknown. The other six integers are 20, 4, 10, 4,8, and 4. If the mean, median, and mode of these seven integers are arranged in increasing order, they form an arithmetic progression. The sum of all possible values of x is

a,  b,  c,  d and  e are integers such that 1 ≤ a < b < c < d < e. If a, b, c, d and e are geometric progression and lcm (m , n) is the least common multiple of m and n, then the maximum value of $$\frac{1}{lcm(a,b)}+\frac{1}{lcm(b,c)}+\frac{1}{lcm(c,d)}+\frac{1}{lcm(d,e)}$$ is