Compound Interest - Solved Questions and Answers
Last Updated :
08 Jul, 2025
Compound Interest is interest calculated on the initial principal and the accumulated interest from previous periods. It grows exponentially over time because you earn "interest on interest."
Formula:
A =P(1+ \frac{R}{n})^{nT}
Where:
- A = Final amount (Principal + Interest)
- P = Principal amount (initial investment/loan)
- R = Annual interest rate
- n = Number of times interest is compounded per year
- T = Time in years
Compound Interest questions and answers are provided below for you to learn and practice.
Question 1: Find the compound interest on Rs. 10,000 at 10% per annum for a time period of three and a half years.
Solution:
Time period of 3 years and 6 months means for 3 years, the interest is compounded yearly and for the remaining 6 months, the interest is compounded half-yearly.
This means that we have 3 cycles of interest compounded yearly and 1 cycle of interest compounded half yearly.
So, Amount = P [1 + (R / 100)]3 [1 + ( {R/2} / 100 )]
=> Amount = 10000 [1 + 0.1]3 [1 + 0.05]
=> Amount = 10000 (1.1)3 (1.05)
=> Amount = Rs. 13975.50
=> Compound Interest, CI = Amount - Principal = 13975.50 - 10000
Therefore, CI = Rs. 3975.50
Question 2: If Rs. 5000 amounts to Rs. 5832 in two years compounded annually, find the rate of interest per annum.
Solution:
Here, P = 5000, A = 5832, n = 2
A = P [1 + (R / 100)]n
5832 = 5000 [1 + (R / 100)]2
1 + (R / 100)]2 = 5832 / 5000
[1 + (R / 100)]2 = 11664 / 10000
[1 + (R / 100)] = 108 / 100 => R / 100 = 8 / 100
R = 8%
Thus, the required rate of interest per annum in 8%
Question 3: The difference between the SI and CI on a certain sum of money at a 10 % rate of annual interest for 2 years is Rs. 549. Find the sum.
Solution:
Let the sum be P
R = 10 %
n = 2 years
SI = P x R x n / 100
= P x 10 x 2 / 100
= 0.20 P
CI = A - P = P [1 + (R / 100)]n - P = 0.21 P
Now, it is given that CI - SI = 549
=> 0.21 P - 0.20 P = 549
=> 0.01 P = 549 => P = 54900
Therefore, the required sum of money is Rs. 54,900
Question 4: A sum of Rs. 1000 is to be divided among two brothers such that if the interest is compounded annually is 5 % per annum, then the money with the first brother after 4 years is equal to the money with the second brother after 6 years.
Solution:
Let the first brother be given Rs. P => Money with second brother = Rs. 1000 - P
Now, according to the question,
P [1 + (5 / 100)]4 = (1000 - P) [1 + (5 / 100)]6
=> P (1.05)4 = (1000 - P) (1.05)6
=> 0.9070 P = 1000 - P
=> 1.9070 P = 1000
=> P = 524.38
Therefore, share of first brother = Rs. 524.38
Share of second brother = Rs. 475.62
Question 5: A sum of money amounts to Rs. 669 after 3 years and to Rs. 1003.50 after 6 years on compound interest. Find the sum.
Solution:
Let the sum of money be Rs. P => P [1 + (R/100)]3= 669
P [1 + (R/100)]6= 1003.50
Dividing both equations, we get [1 + (R/100)]3 = 1003.50 / 669 = 1.50
Now, we put this value in the equation P [1 + (R/100)]3= 669
=> P x 1.50 = 669
=> P = 446
Thus, the required sum of money is Rs. 446
Question 6: An investment doubles itself in 15 years if the interest is compounded annually. How many years will it take to become 8 times?
Solution:
It is given that the investment doubles itself in 15 years.
Let the initial investment be Rs. P => At the end of 15 years, A = 2 P
Now, this 2 P will be invested. => Amount after 15 more years = 2 x 2 P = 4 P
Now, this 4 P will be invested. => Amount after 15 more years = 2 x 4 P = 8 P
Thus, the investment (P) will become 8 times (8 P) in 15 + 15 + 15 = 45 years
Question 7: If the difference between compound interest and simple interest on some principle amount is at the rate of interest of 20% per annum for 3 years in $48, then what is the principle amount?
Solution:
Here, T = 3 years, R = 20%, P = ?
Also, C.I - S.I = 48
P(1 + (R / 100))T - P - (P × R × T) / 100 = 48
⇒ P(1 + (20/100))3 - P - (P × 20 × 3) / 100 = 48
⇒ P(6/5)3 - P - P (3/5) = 48
⇒ P ((216/125)3 - 1 - (3/5)) = 48
⇒ P (0.128) = 48
⇒ P = (48/0.128)
⇒ P = 375
Therefore, the principle amount is $375.
Question 8: A sum of money placed at compound interest doubles itself in 3 years. In how many years will it amount to 8 times itself?
Solution:
Let in 3 years, P = y, C.I = 2y (since, it doubles itself)
Now, by formula,
C.I = P (1 + (R / 100))T
⇒ 2y = y (1 + (R / 100))3
⇒ 2 = (1 + (R / 100))3
So, (1 + (R/100)) = 21/3 . . . (i)
We need to find, T = ? when C.I = 8y,
By formula,
C.I = P (1 + (R / 100))T
⇒ 8y = y(21/3)T [From equation (i)]
⇒ 23y = y(2T/3)
On Comparing, we get
T/3 = 3
⇒ T = 3(3)
⇒ T = 9 years.
Therefore, in 9 years the the sum of money will amount to 8times itself.
Question 9: In how many years will a sum of $800 at 10% per annum compound semi-annually become $926. ?
Solution:
Given that, P = $800, R = 10% per year, A = $1064.8, T = ?
By formula, Amount,
A = P (1 + ((R/2)/100))2T
⇒ 926.1 = 800(1 + (5/100))2T
⇒ (926.1 /800) = (21 /20)2T
⇒ (9261 /8000) = (21/20)2T
⇒ (21/20)3 = (21/10)2T
On comparing, we get
2T = 3
⇒ T = 3/2 years
Therefore, in 3/2 years the semi-annually compounded sum will become $926.1
Question 10: A tree increases annually by (1/8)th of its height. By how much will it increase after 2 years, if it stands today 64cm high?
Solution:
The increase% is given by, (1/8) × 100 % = (25/2) %
By formula,
C.I. = P (1 + (R / 100))T
⇒ C.I.= 64(1 + (25/(2 × 100)))2
⇒ C.I.= 64(9/8)2
⇒ C.I.= 64(81/64)
⇒ C.I.= 81
Total Increase = Height after 2 years−Initial Height = 81−64 = 17 cm
Therefore, the tree will compound to height 17cms after 2 years.
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