Updated: Apr 2026
First Chapter - 100% FREE

CMI BS Hons Chapter-wise PYQs

Practice CMI BS Hons previous year questions organized by chapter. 107+ PYQs from 6 years with detailed solutions. First chapter FREE!

107+
Total PYQs
6
Years
45
Chapters
FREE
First Chapter
Start Free Test →

Year-wise PYQ Distribution

2025
23
2024
27
2023
19
2022
6
2021
16
2020
16

All Chapters

Logarithms and exponentials

FREE

Algebra and Functions • 1 PYQs

Start Free

Rational expressions

Algebra and Functions • 1 PYQs

Unlock

Root theory

Algebra and Functions • 7 PYQs

Unlock

Polynomial basics

Algebra and Functions • 2 PYQs

Unlock

Sums and patterns

Algebra and Functions • 2 PYQs

Unlock

Series behaviour

Algebra and Functions • 1 PYQs

Unlock

Operations on functions

Algebra and Functions • 6 PYQs

Unlock

Types of functions

Algebra and Functions • 2 PYQs

Unlock

Basic function language

Algebra and Functions • 1 PYQs

Unlock

Polar form

Trigonometry and Complex Numbers • 5 PYQs

Unlock

Quadrilaterals

Geometry • 2 PYQs

Unlock

Lines and angles

Geometry • 1 PYQs

Unlock

Triangles

Geometry • 1 PYQs

Unlock

Locus problems

Geometry • 2 PYQs

Unlock

Geometric transformations

Geometry • 1 PYQs

Unlock

Systems of equations

Vectors, Matrices and 3D Geometry • 1 PYQs

Unlock

Geometric use of vectors

Vectors, Matrices and 3D Geometry • 5 PYQs

Unlock

Line and plane basics

Vectors, Matrices and 3D Geometry • 2 PYQs

Unlock

Definite integration

Calculus • 3 PYQs

Unlock

Derivative basics

Calculus • 2 PYQs

Unlock

Logarithms and exponentials - PYQs

Free sample questions from Algebra and Functions

100% FREE
1 Single Choice
2025
B4. [12 points] The domain of ff is the set of positive integers and
f(xy)=f(x)+f(y)f(xy)=f(x)+f(y)
for all x,yx,y. Answer the independent questions below. (Data from (a) are not valid for the rest.) (a) Suppose f(2025)=0f(2025)=0, f(20)=10f(20)=10 and f(25)=20f(25)=20. What is the smallest nn for which f(n)f(n) is not uniquely determined? Write values of f(x)f(x) for each positive integer x<nx<n. (b) Is there such a function ff for which f(x)=0f(x)=0 for all positive integers x<20252025x<2025^{2025} but ff is not identically 00? Show how to define such ff or show that it is not possible. (c) The domain of a function gg is the set of positive rational numbers, codomain the set of integers, and
g(xy)=g(x)+g(y)g(xy)=g(x)+g(y)
for all positive rational x,yx,y. Suppose g(a)=24g(a)=24, g(b)=2025g(b)=2025, g(c)=102025g(c)=10^{2025} for some rational numbers a,b,ca,b,c. Show that there are infinitely many rational numbers rr such that g(r)=1g(r)=1. (*See solutions for relevance of the codomain.)
View Solution
Because
f(xy)=f(x)+f(y),f(xy)=f(x)+f(y),
the value of ff on any positive integer is determined by its values on primes. Also,
f(1)=f(11)=f(1)+f(1),f(1)=f(1\cdot 1)=f(1)+f(1),
so
f(1)=0.f(1)=0.
For part (a), factor the given numbers:
2025=3452,20=225,25=52.2025=3^4\cdot 5^2,\qquad 20=2^2\cdot 5,\qquad 25=5^2.
Let
f(2)=A,f(3)=B,f(5)=C.f(2)=A,\qquad f(3)=B,\qquad f(5)=C.
Then
f(25)=2C=20C=10.f(25)=2C=20 \quad\Longrightarrow\quad C=10.
Also
f(20)=2A+C=102A+10=10A=0.f(20)=2A+C=10 \quad\Longrightarrow\quad 2A+10=10 \quad\Longrightarrow\quad A=0.
And
f(2025)=4B+2C=04B+20=0B=5.f(2025)=4B+2C=0 \quad\Longrightarrow\quad 4B+20=0 \quad\Longrightarrow\quad B=-5.
So for all integers built only from primes 2,3,52,3,5, the value is uniquely determined. Hence
f(2)=0,f(3)=5,f(4)=0,f(5)=10,f(6)=5.f(2)=0,\quad f(3)=-5,\quad f(4)=0,\quad f(5)=10,\quad f(6)=-5.
The first positive integer whose value is not determined is the first prime not among 2,3,52,3,5, namely
7.7.
So the smallest such nn is
7.\boxed{7}.
For part (b), yes, such a function exists. Choose any prime
p>20252025.p>2025^{2025}.
Define
f(n)=vp(n),f(n)=v_p(n),
the exponent of pp in the prime factorization of nn. Then
vp(xy)=vp(x)+vp(y),v_p(xy)=v_p(x)+v_p(y),
so this does satisfy
f(xy)=f(x)+f(y).f(xy)=f(x)+f(y).
Now if
n<20252025<p,n<2025^{2025}<p,
then pp cannot divide nn, so
f(n)=vp(n)=0.f(n)=v_p(n)=0.
Thus f(x)=0f(x)=0 for every positive integer x<20252025x<2025^{2025}, but
f(p)=1,f(p)=1,
so ff is not identically zero. For part (c), first note that
gcd(24,2025,102025)=1.\gcd(24,2025,10^{2025})=1.
Therefore by Bézout''s identity there exist integers u,v,wu,v,w such that
24u+2025v+102025w=1.24u+2025v+10^{2025}w=1.
Define
r0=aubvcw.r_0=a^u b^v c^w.
Since a,b,ca,b,c are positive rationals and u,v,wu,v,w are integers, r0r_0 is again a positive rational number. Using the additive property,
g(r0)=ug(a)+vg(b)+wg(c)=24u+2025v+102025w=1.g(r_0)=u\,g(a)+v\,g(b)+w\,g(c)=24u+2025v+10^{2025}w=1.
So at least one such rational exists. Now we show there are infinitely many. Choose two distinct primes p,qp,q. Since the codomain is the integers, the numbers g(p)g(p) and g(q)g(q) are integers. Consider
s=pg(q)qg(p).s=p^{g(q)}q^{-g(p)}.
This is a positive rational number, and
g(s)=g(q)g(p)g(p)g(q)=0.g(s)=g(q)\,g(p)-g(p)\,g(q)=0.
If s1s\neq 1, then for every integer tt,
g(r0st)=g(r0)+tg(s)=1.g(r_0 s^t)=g(r_0)+t\,g(s)=1.
The numbers r0str_0s^t are all distinct, so this already gives infinitely many rationals with value 11. If s=1s=1, then unique factorization forces
g(p)=g(q)=0,g(p)=g(q)=0,
and then
g ⁣(pq)=g(p)g(q)=0,g\!\left(\frac{p}{q}\right)=g(p)-g(q)=0,
with pq1\frac{p}{q}\neq 1. Again
g ⁣(r0(pq)t)=1g\!\left(r_0\left(\frac{p}{q}\right)^t\right)=1
for all integers tt, giving infinitely many distinct rational numbers. Hence there are infinitely many positive rational numbers rr such that
g(r)=1.\boxed{g(r)=1}.
The relevance of the codomain being the integers is exactly that exponents such as g(p)g(p) and g(q)g(q) are integers, so the constructed kernel element is again a rational number.

Why Practice PYQs?

📈

Understand Pattern

Know what to expect in the actual exam

🎯

Topic Weightage

Focus on high-yield topics

Build Confidence

Practice with real exam questions

Frequently Asked Questions

How are CMI PYQs organized?

PYQs are organized chapter-wise across 45 topics, making it easy to practice specific areas. Each question shows its year and slot.

How many years of PYQs are available?

We have 6 years of CMI BS Hons PYQs from 2020 to 2025, totaling 107+ questions.

Is the first chapter free?

Yes! The first chapter's PYQs are completely FREE with full solutions. Practice and evaluate before upgrading.

Do PYQs have detailed solutions?

Every PYQ comes with step-by-step solutions and explanations to help you understand the concepts thoroughly.

More CMIBS Hons Resources

Why Choose MastersUp?

🎯

AI-Powered Plans

Personalized study schedules based on your exam date and learning pace

📚

15,000+ Questions

Verified questions with detailed solutions from past papers

📊

Smart Analytics

Track your progress with subject-wise performance insights

🔖

Bookmark & Revise

Save important questions for quick revision before exams

Start Your Free Preparation →

No credit card required • Free forever for basic features