Scribd
Upload
18 views4 pages

Ugb2 Solutions

The document contains solutions to a mock test with various mathematical problems, including proofs and inequalities. It discusses functions, prime numbers, and properties of sets, providing detailed reasoning for each solution. The solutions demonstrate logical deductions and mathematical principles to arrive at conclusions.

Uploaded by

nandiniwadhwanw
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
18 views4 pages

Ugb2 Solutions

The document contains solutions to a mock test with various mathematical problems, including proofs and inequalities. It discusses functions, prime numbers, and properties of sets, providing detailed reasoning for each solution. The solutions demonstrate logical deductions and mathematical principles to arrive at conclusions.

Uploaded by

nandiniwadhwanw
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

ISI UGB Mock Test 2 Solutions

Shounak Kar
January 2025

Hints and Solutions


1. Note that
an − ak = pn − pk =⇒ an − pn = ak − pk
pn |an =⇒ pn |an − pn =⇒ pn |ak − pk For any n, k ∈ N
This implies ak − pk has infinitely many prime factors =⇒ ak − pk = 0
=⇒ ak = pk for all k and we are done.

2. Assume that this is not true. Then there is ϵ > 0 so that for every α ∈ R
there is x > α such that |f (x)| > ϵ. By choosing only those values of f with
the same sign, and maybe changing f to −f , we may remove the bars in
the last equality, so that it reads f (x) > ϵ. Choose α large enough so that
|f (x) + f ′ (x)| < ϵ/2 for all x > α. If f (x) > ϵ on [α, ∞), then f ′ (x) < −ϵ/2, which
forces limx→∞ f (x) = −∞, and consequently limx→∞ (f (x) + f ′ (x)) = −∞. Hence
f takes some values smaller than ϵ on every interval [β, ∞). So we can find
an interval [a, b], a > α which contains an x such that f (x) > ϵ and such that
f (a), f (b) < ϵ. But then f has a point of maximum c ∈ (a, b). Then f ′ (c) = 0,
and of course f (c) > ϵ since this inequality already holds for a point in (a, b).
But this is impossible since c > α implies f (c) = |f (c) + f ′ (c)| < ϵ/2. The con-
clusion follows.

3. Let {an } be the enumeration of those 100 numbers. Let us assume the con-
trary that for all n, an + an+3 ≤ an+1 + an+2 (taking n modulo 100).

Now, we look at all consecutive sums and choose the consecutive pair with
the minimum sum. (If there are multiple pairs with minimum sums, just
choose any one pair). Then let us call the two consecutive terms an+1 , an+2 .
Let, an+1 + an+2 = m. We know that an + an+1 ≥ an+1 + an+2 = m. Since all the
terms are distinct we get strict inequality an + an+1 > m. Similarly, we can
show that an+2 + an+3 > m.

Adding these two inequalities, we get that an + an+3 > m = an+1 + an+2 , which
is a contradiction to our assumption.

1
4. Clearly , the identical function f (p) = p for all p ∈ P is a solution. We will
show that this is the only one.
First we will show that f (2) = 2. Taking q = 2 and p any odd prime number,
we have
f (p)f (2) + 2p = f (2)f (p) + p2
Assume that f (2) ̸= 2. It follows that f (2) is odd and so f (p) = 2 for any odd
prime number p.
Taking any two different odd prime numbers p, q we have
22 + q p = 22 + pq ⇒ pq = q p ⇒ p = q
contradiction. Hence, f (2) = 2. So for any odd prime number p we have

f (p)2 + 2p = 2f (p) + p2

Copy this relation as


2p − p2 = 2f (p) − f (p)2
Let T be the set of all positive integers greater than 2, i.e. T = {3, 4, 5, . . .}.
The function g : T → Z, g(n) = 2n − n2 , is strictly increasing,
As consequence, (1) holds if and only if f (p) = p for all odd prime numbers p,
as well as for p = 2.
Therefore, the only function that satisfies the given relation is f (p) = p, for
all p ∈ P.

5. Assume the contrary. Then there exist x, y ∈ U such that xy ∈ T and there
exist z, w ∈ T such that zw ∈ U . Thus
(xy) · z · w ∈ T (zw) · x · y ∈ U
Thus xyzw ∈ T ∩ U = ∅ which is absurd. Hence one of T or U has to be closed
under multiplication.

Page 2
6. We prove a stronger statement: there is subset S of {z1 , z2 , . . . , zn } such that
X 1
z ≥
z∈S
4

For 1 ≤ k ≤ n, let zk = xk + iyk . Then


1 = |z1 | + |z2 | + · · · + |zn |
≤ (|x1 | + |y1 |) + (|x2 | + |y2 |) + · · · + (|xn | + |yn |)
X X X X
= |xk | + |xk | + |yk | + |yk |
xk ≥0 xk <0 yk ≥0 yk <0

By the Pigeonhole Principle, at least one of the above sums is not less than
1/4. By symmetry, we may assume that

1 X X
≤ |xk | = xk
4 x ≥0 x ≥0
k k

Consequently,
X X 1
zk ≥ xk ≥
xk ≥0 xk ≥0
4

7. Let assume −1 ≤ k ≤ 1 such that


P (k) = (a + c)k 3 + (b + d)k 2 + ck(1 − k 2 ) + d(1 − k 2 ) = 0

Note that
d > |c| ≥ |ck| =⇒ (d + ck) > 0; b + d > |a + c| ≥ |(a + c)k| =⇒ (b + d) + (a + c)k > 0
(a + c)k 3 + (b + d)k 2 ≥ ((b + d) + (a + c)k)k 2 ≥ 0 and equality holds if k = 0.
ck(1 − k 2 ) + d(1 − k 2 ) = (d + ck)(1 − k 2 ) ≥ 0 and equality holds if k = +1 or −1.
So there exists no such k.

Page 3
8. Let S = sin θ + cos θ and P = sin θ cos θ. We can see that the value which we
wish to compute is 1 + S + P . By sine properties, we see that
 2
1
1 + sin 2θ − sin 2θ = 1 + 2 sin θ cos θ − (sin θ cos θ)2 = 1 + 2P − P 2 = 0
2
√
so P = 1 ± 2. However, P can’t be greater √ than 1 , since sine and cosine
have an upper bound of 1 , so P = 1 − 2. Expanding the original equation
slightly differently yields

1 + 2 sin θ cos θ − (sin θ cos θ)2 = sin2 θ + cos2 θ + 2 sin θ cos θ − (sin θ cos θ)2
= (sin θ + cos θ)2 − (sin θ cos θ)2
= S2 − P 2
√
As a result, we see that 1 + 2P − P 2 = S 2 − P 2 , so S = ±(1 − 2). We want to
maximize 1 + S + P√, and since P is fixed, this is equivalent
√ to maximizing
√ S.
Thus, we get S = 2 − 1, and hence, 1 + S + P = 1 + ( 2 − 1) + (1 − 2) = 1 ,
which is our answer.

Page 4

You might also like