Class 10 RD Sharma Solutions - Chapter 9 Arithmetic Progressions - Exercise 9.4 | Set 2
Last Updated :
25 Jan, 2021
Question 14. The 4th term of an A.P. is three times the first and the 7th term exceeds twice the third term by 1. Find the first term and the common difference.
Solution:
Let’s assume that the first term and the common difference of the A.P to be a and d respectively.
Given that,
4th term of an A.P. is three times the first
a4 = 3(a)
As we know that, to find nth term in an A.P = a + (n – 1)d
a + (4 – 1)d = 3a
3d = 2a ⇒ a = 3d/2 ---------(i)
and,
7th term exceeds twice the third term by 1
a7 = 2(a3) + 1
a + (7 – 1)d = 2(a + (3–1)d) + 1
a + 6d = 2a + 4d + 1
a – 2d +1 = 0 --------(ii)
Using (i) in (ii), we get
3d/2 – 2d + 1 = 0
3d – 4d + 2 = 0
d = 2
therefore, putting d = 2 in (i), we get a
a = 3
Hence, the first term is 3 and the common difference is 2.
Question 15. Find the second term and the nth term of an A.P. whose 6th term is 12 and the 8th term is 22.
Solution:
Given that,
a6 = 12 and a8 = 22
As we know that, to find nth term in an A.P = a + (n – 1)d
therefore,
a6 = a + (6-1)d = a + 5d = 12 --------(i)
and,
a8 = a + (8-1)d = a + 7d = 22 ---------(ii)
Solving (i) and (ii), we get
(ii) – (i)
a + 7d – (a + 5d) = 22 – 12
2d = 10
d = 5
now put d in (i) we get,
a + 5(5) = 12
a = 12 – 25
a = -13
Hence for the A.P: a = -13 and d = 5
so, the nth term is given by an = a + (n-1)d
an = -13 + (n-1)5 = -13 + 5n – 5
an = 5n – 18
Hence, the second term is given by a2 = 5(2) – 18 = 10 – 18 = -8
Question 16. How many numbers of two digit are divisible by 3?
Solution:
The first 2 digit number divisible by 3 is 12 and the last 2 digit number divisible by 3 is 99.
this forms an A.P,
12, 15, 18, 21, …., 99
Where, a = 12 and d = 3
now find the number of terms in this A.P
99 = 12 + (n-1)3
99 = 12 + 3n – 3
90 = 3n
n = 90/3 = 30
Hence, there are 30 two digit numbers divisible by 3.
Question 17. An A.P. consists of 60 terms. If the first and the last terms be 7 and 125 respectively, find 32nd term.
Solution:
Given that,
An A.P of 60 terms
and a = 7 and a60 = 125
As we know that, to find nth term in an A.P = a + (n – 1)d
a60 = 7 + (60 – 1)d = 125
7 + 59d = 125
59d = 118
d = 2
Therefore, the 32nd term is given by
a32 = 7 + (32 -1)2 = 7 + 62 = 69
Hence a32 = 69
Question 18. The sum of 4th and 8th terms of an A.P. is 24 and the sum of the 6th and 10th terms is 34. Find the first term and the common difference of the A.P.
Solution:
Given that,
The sum of 4th and 8th terms of an A.P. is 24 and
the sum of the 6th and 10th terms is 34
a4 + a8 = 24
and, As we know that, to find nth term in an A.P = a + (n – 1)d
[a + (4-1)d] + [a + (8-1)d] = 24
2a + 10d = 24
a + 5d = 12 ---------(i)
a6 + a10 = 34
[a + 5d] + [a + 9d] = 34
2a + 14d = 34
a + 7d = 17 ----------(ii)
Subtracting (i) form (ii), we get
a + 7d – (a + 5d) = 17 – 12
2d = 5
d = 5/2
Using d in (i) we get,
a + 5(5/2) = 12
a = 12 – 25/2
a = -1/2
Hence, the first term is -1/2 and the common difference is 5/2.
Question 19. The first term of an A.P. is 5 and its 100th term is -292. Find the 50th term of this A.P.
Solution:
Given that,
a = 5 and a100 = -292
As we know that, to find nth term in an A.P = a + (n – 1)d
a100 = 5 + 99d = -292
99d = -297
d = -3
Hence, the 50th term is
a50 = a + 49d = 5 + 49(-3) = 5 – 147 = -142
Question 20. Find a30 – a20 for the A.P.
(i) -9, -14, -19, -24 (ii) a, a+d, a+2d, a+3d, ……
Solution:
As we know that, to find nth term in an A.P = a + (n – 1)d
therefore, a30 – a20 = (a + 29d) – (a + 19) =10d
(i) Given A.P. -9, -14, -19, -24
Here, a = -9 and d = -14 – (-9) = = -14 + 9 = -5
therefore, a30 – a20 = 10d
= 10(-5) = -50
(ii) Given A.P. a, a+d, a+2d, a+3d, ……
therefore, a30 – a20 = (a + 29d) – (a + 19d) =10d
Question 21. Write the expression an – ak for the A.P. a, a+d, a+2d, …... Hence, find the common difference of the A.P. for which
(i) 11th term is 5 and 13th term is 79.
(ii) a10 – a5 = 200
(iii) 20th term is 10 more than the 18th term.
Solution:
Given A.P. a, a+d, a+2d, …..
therefore, an = a + (n-1)d = a + nd –d
And, ak = a + (k-1)d = a + kd – d
an – ak = (a + nd – d) – (a + kd – d)
= (n – k)d
(i) Given that 11th term is 5 and 13th term is 79,
where n = 13 and k = 11,
a13 – a11 = (13 – 11)d = 2d
79 – 5 = 2d
d = 74/2 = 37
(ii) Given that, a10 – a5 = 200
(10 – 5)d = 200
5d = 200
d = 40
(iii) Given that, 20th term is 10 more than the 18th term.
a20 – a18 = 10
(20 – 18)d = 10
2d = 10
d = 5
Question 22. Find n if the given value of x is the nth term of the given A.P.
(i) 25, 50, 75, 100, ; x = 1000 (ii) -1, -3, -5, -7, …; x = -151
(iii) 5½, 11, 16½, 22, ….; x = 550 (iv) 1, 21/11, 31/11, 41/11, …; x = 171/11
Solution:
(i) Given that, A.P. 25, 50, 75, 100, ……,1000
where, a = 25 d = 50 – 25 = 25
nth term= 1000
As we know that, to find nth term in an A.P = a + (n – 1)d
1000 = 25 + (n-1)25
1000 = 25 + 25n – 25
n = 1000/25
n = 40
(ii) Given that, A.P. -1, -3, -5, -7, …., -151
where, a = -1 d = -3 – (-1) = -2
nth term = -151
As we know that, to find nth term in an A.P = a + (n – 1)d
-151 = -1 + (n-1)(-2)
-151 = -1 – 2n + 2
n = 152/2
n = 76
(iii) Given that, A.P. 5½, 11, 16½, 22, …, 550
where, a = 5½ d = 11 – (5½) = 5½ = 11/2
nth term = 550
As we know that, to find nth term in an A.P = a + (n – 1)d
550 = 5½ + (n-1)(11/2)
550 x 2 = 11+ 11n – 11
1100 = 11n
n = 100
(iv) Given that, A.P. 1, 21/11, 31/11, 41/11, 171/11
where, a = 1 d = 21/11 – 1 = 10/11
nth term = 171/11
As we know that, to find nth term in an A.P = a + (n – 1)d
171/11 = 1 + (n-1)10/11
171 = 11 + 10n – 10
n = 170/10
n = 17
Question 23. The eighth term of an A.P is half of its second term and the eleventh term exceeds one third of its fourth term by 1. Find the 15th term.
Solution:
Given that,
a8 = 1/2(a2)
a11 = 1/3(a4) + 1
As we know that, to find nth term in an A.P = a + (n – 1)d
a8 = 1/2(a2)
a + 7d = 1/2(a + d)
2a + 14d = a + d
a + 13d = 0 -------(i)
And, a11 = 1/3(a4) + 1
a + 10d = 1/3(a + 3d) + 1
3a + 30d = a + 3d + 3
2a + 27d = 3 --------(ii)
By solving (i) and (ii), by (ii) – 2x(i)
2a + 27d – 2(a + 13d) = 3 – 0
d = 3
Putting d in (i) we get,
a + 13(3) = 0
a = -39
Hence, the 15th term a15 = -39 + 14(3) = -39 + 42 = 3
Question 24. Find the arithmetic progression whose third term is 16 and the seventh term exceeds its fifth term by 12.
Solution:
Given that,
a3 = 16 and a7 = a5 + 12
As we know that, to find nth term in an A.P = a + (n – 1)d
a + 2d = 16…… (i)
and,
a + 6d = a + 4d + 12
2d = 12
d = 6
Using d in (i), we get
a + 2(6) = 16
a = 16 – 12 = 4
Hence, the A.P is 4, 10, 16, 22, …….
Question 25. The 7th term of an A.P. is 32 and its 13th term is 62. Find the A.P.
Solution:
Given that,
a7 = 32 and a13 = 62
From an – ak = (a + nd – d) – (a + kd – d) = (n – k)d
a13 – a7 = (13 – 7)d = 62 – 32 = 30
6d = 30
d = 5
Now,
a7 = a + (7 – 1)5 = 32
a + 30 = 32
a = 2
Hence, the A.P is 2, 7, 12, 17, ……
Question 26. Which term of the A.P. 3, 10, 17, …. will be 84 more than its 13th term ?
Solution:
Given that,
A.P. 3, 10, 17, ….
where, a = 3 and d = 10 – 3 = 7
an = a13 + 84 (Given)
As we know that, to find nth term in an A.P = a + (n – 1)d
3 + (n – 1)7 = 3 + (13 – 1)7 + 84
3 + 7n – 7 = 3 + 84 + 84
7n = 168 + 7
n = 175/7
n = 25
Hence, the 25th term which is 84 more than its 13th term.
Question 27. Two arithmetic progressions have the same common difference. The difference between their 100th terms is 100, what is the difference between their 1000th terms?
Solution:
Let's assume that the two A.Ps be A.P1 and A.P2
For A.P1 the first term is a and the common difference is d
and for A.P2 the first term is b and the common difference is d
Given that,
a100 – b100 = 100
(a + 99d) – (b + 99d) = 100
a – b = 100
Now, the difference between their 1000th terms is,
(a + 999d) – (b + 999d) = a – b = 100
Hence, the difference between their 1000th terms is also 100.
Similar Reads
Basics & Prerequisites
Data Structures
Array Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
3 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Hereâs the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem