DEPARTMENT OF MATHEMATICS

OSMANIA UNIVERSITY
M.Sc. Mathematics
Algebra
MM 101 Paper I Semester I

Unit I

Automaphisms- Conjugacy and G-sets- Normal series solvable groups- Nilpotent groups. (Pages
104 to 128 of [1] )

Unit II

Structure theorems of groups: Direct product- Finitly generated abelian groups- Invariants of a
finite abelian group- Sylow’s theorems- Groups of orders p2,pq . (Pages 138 to 155)

Unit III

Ideals and homomsphism- Sum and direct sum of ideals, Maximal and prime ideals- Nilpotent
and nil ideals- Zorn’s lemma (Pages 179 to 211).

Unit-IV

Unique factorization domains - Principal ideal domains- Euclidean domains- Polynomial rings
over UFD- Rings of traction.(Pages 212 to 228)

Text Books:

[1] Basic Abstract Algebra by P.B. Bhattacharya, S.K. Jain and S.R. Nagpanl.

Reference: 1] Topics in Algebra by I.N. Herstein.

 M.Sc (Mathematics)

Algebra

MM 151 Paper I Semester I

Practical Questions

1. A finite group G having more than two elements and with the condition that
x 2  e for some x  G must have nontrivialautomorphism.
2. (i) Let G be a group Define a  x  ax, a , x G then the set G is a G-set
(ii) Let G be a group Define a  x  axa 1 a , x  G then G is a G-set.
3. An abelian group G has a composition series if and only if G is finite
4. Find the number of different necklaces with p beads p prime where the beads
can have any of n different colours
5. If G is a finite cyclic group of order n then the order of Aut G , the group of
automorphisms of G , is  (n), where  is Euler’s function.
6. If each element  e of a finite group G is of order2 then G  2 n and
G  C1  C 2  .... ..  C n where Ci are cyclic and C i  2.
Z
7. (i) Show that the group is a direct sum of H  {0 5 }and K  {0 2 4 6 8 }
 10 
 z 
(ii) Show that the group  ,   cannot be written as the direct sum of two
4  
Subgroups of order 2.
8. (i) Find the non isomorphic abelian groups of order 360
(ii) If a group of order p n contains exactly one sub group each of orders
p , p 2 , _ _ _ P n 1 then it is cyclic.
9. Prove that there are no simple groups of orders 63, 56, and 36
10. Let G be a group of order 108. Show that there exists a normal subgroup of
order 27 or 9.
11. (i) Let R be acommutative Ring wilth unity. Suppose R has no nontrivial ideals .Prove
that R is a field.
Z
(ii) Find all ideals in Z and in
10
12. (i) The only Homomorphism from the ring of integers Z to Z are the identity and
Zero Mappings.
(ii) Show that any nonzero homomorphism of a field F into a ring R is one-one.
A B A
13. For any tow ideals A and B in a Ring R (i) 
B A B
A B A B A B B A
(ii)     In particular if R  A  B then
A B A B A B A B
R R R
  .
A B A B
14. Let R be a commutative ring with unity in which each ideal is prime then R is a
field
15. Let R be a Boolean ring then each prime ideal P  R is maximal.
16. The commutative integral domain R  {a  b  5 / a , b Z } is not a UFD.
17. (i) The ring of integers Z is a Euclidean domain
(ii) The Ring of Gausion Integers R  {m  n  1 / m, n  Z} is a Euclidean domain
18. (i) Prove that 2   5 is irreducible but not prime in Z (  5 )
(ii) Show that 1  2  5 and 3 are relatively prime in Z (  5 )
19. Let R be a Euclidean domain . Prove the following
(i) If b  0 then  a    (b)
(ii) If a and b are associates then  (a)   (b)
(iii) If a b and  (a)   (b) then a and b are associates
20. Prove that every nonzero prime ideal in a Euclidean domain is maximal.
 DEPARTMENT OF MATHEMATICS
OSMANIA UNIVERSITY
M.Sc. Mathematics
MM – 102 Semester I
Analysis
Paper-II
Unit I

Metric spaces- Compact sets- Perfect sets- Connected sets

Unit II

Limits of functions- Continuous functions- Continuity and compactness Continuity and

connectedness- Discontinuities – Monotone functions.

Unit III

Rieman- Steiltjes integral- Definition and Existence of the Integral- Properties of the integral-
Integration of vector valued functions- Rectifiable waves.

Unit-IV

Sequences and series of functions: Uniform convergence- Uniform convergence and

continuity- Uniform convergence and integration- Uniform convergence and differentiation-
Approximation of a continuous function by a sequence of polynomials.

Text Books:

[1] Principles of Mathematical Analysis (3rd Edition) (Chapters 2, 4, 6 ) By Walter Rudin,

Mc Graw-Hill Internation Edition.
 M.Sc. Mathematics
Analysis
MM 152 Paper –II Semester –
IPractical Questions

1. Construct a bounded set of real numbers with exactly three limit points
2. Suppose E1 is the set of all limit points of E. Prove that E1 is closed also prove that E and E
have the same limit points.
3. Let E0 demote the set of all interior points of a set E. Prove that E0 is the largest open set
contained in E Also prove that E is open if and only if E = E0
4. Let Xbe an infinite set.For p  X , q  X define

1 if p  q
d  p, q   
0 if p  q

Prove that this is a metric, which subsets of the resulting metric space are open, which
areclosed? Which are compact?

5. i) If A and B are disjoint closed sets in some metric space X, prove that they are separated
ii) Prove the same for disjoint open sets
iii)Fixa p  X and   o, Let A = { q  X : d ( p, q )   }
and B  {q  X :d ( p , q )   } prove that A and B are separated.

6. i) Suppose f is a real function on R which satisfies lim  f ( x  h)  f ( x  h)  o for every

ho

x  R Does this imply that f is continuous? Explain

ii) Let f be a continuous real function on a metric space X,let Z(f) = p  X : f ( p)  0

prove that z (f) is closed.

7. If f is a continuous mapping of a metric space X into a metric space Y .prove that

__ ____
f ( E )  f (E ) for every set E  X

8. Let f and g be continuous mapping of a metric space X into a metric space Y Let E be a dense
subset of X. Prove that
i) f(E) is dense in f(X)
ii) If g(p) =f(p)  p  E , Prove that g(p) =f(p)  p  X

9. Suppose f is a uniformly continuous mapping of a metric space X into a metric space Y and {
Xm} is a Couchy sequence in X prove that {f(Xm)} is Cauchy sequence in Y
10. Let I = [ 0 , 1 ] be the closed unit interval, suppose f is a continuous mapping of f into I. Prove
that f(x) = x for at least one x

11. Suppose  increases on [ a , b ] , a <xo <b,  is continuous at x0, f(x0) = 1 and f(x) =0 if x  xo
b
.Prove that f  R(  ) and  f d  0
a
b
12. Suppose f ≥0 and f is continuous on [ a , b] and  f ( x)dx  0 , Prove that f(x) =0  x € [ a , b]
a

13. If f(x) = 1or 0 according as x is rational or not .Prove that f  R on [ a , b] for any a,b,€R with
a<b.Also prove that f R(  ) on [ a , b] with respect to any monotonically increasing function
 on [ a , b]
14. Suppose f is a bounded real function on [ a , b] and f2€R on [ a , b]. Does it follow that f  R ?

Does the answer change if we assume that f3€R?

15. Suppose  1 and  2 are the curves in the complex plane defined on [0,2  ] by  1(t)= e it ,  2 (t )  e 2it

Show that the two curves have the same range

Also Show that  1 and 2 are rectifiable and find the curve length of  1 and 2

16. Discuss the uniform conversance of the sequence of functions {fn} where

sin nx
fn(x) = x real, n = 1,2,3....
n

17. Give an example of a series of continuous functions whose sum function may be discontinuous.
18. Discuss the uniform conversance of the sequence

1
fn(x)= x  0, n  1,2,3...
1  nx

19. Give an example of a sequence of functions such that

lim f n   lim f n

20. Prove that a sequence {fn} converse to f with respect to the metric of C(x) if and only if fn  f
uniformly on X
 DEPARTMENT OF MATHEMATICS
OSMANIA UNIVERSITY
M.Sc. (Mathematics)

MM – 103 Semester I
Mathematical Methods
Paper- III
Unit I
dy
Existence and Uniqueness of solution of = f(x,y). The method of successive approximation-
dx
Picard’s theorem- Sturm-Liouville’s boundary value problem.
Partial Differential Equations: Origins of first-order PDES-Linear equation of first-order-
Lagrange’s method of solving PDE of Pp+Qq = R – Non-Linear PDE of order one-Charpit
method- Linear PDES with constant coefficients.

Unit II

Partial Differential Equations of order two with variable coefficients- Canonical form
Classification of second order PDE- separation of variable method solving the one-dimensional
Heat equation and Wave equation- Laplace equation.

Unit III

Power Series solution of O.D.E. – Ordinary and Singular points- Series solution about an ordinary
point -Series solution about Singular point-Frobenius Method.
Lagendre Polynomials: Lengendre’s equation and its solution- Lengendre Polynomial and its
properties- Generating function-Orthogonal properties- Recurrance relations- Laplace’s definite
integrals for Pn (x)- Rodrigue’s formula.

Unit-IV
Bessels Functions: Bessel’s equation and its solution- Bessel function of the first kind and its
properties- Recurrence Relations- Generating function- Orthogonality properties.
Hermite Polynomials: Hermite’s equation and its solution- Hermite polynomial and its properties-
Generating function- Alternative expressions (Rodrigue’s formula)- Orthogonality properties-
Recurrence Relations.

Text Books:

[1] “Elements of Partial Differential Equations”, By Ian Sneddon, Mc.Graw-Hill

International Edition.
[2] “Text book of Ordinary Differential Equation”, By S.G.Deo, V. Lakshmi Kantham, V.
Raghavendra, Tata Mc.Graw Hill Pub. Company Ltd.
[3] “Ordinary and Partial Differential Equations”, By M.D. Raisingania,
S. Chand Company Ltd., New Delhi.
 M.Sc. Mathematics
Mathematical Methods
MM 153 Paper III Semester I
Practical Questions

1. Compute the first three successive approximations for the solution of the initialvalue
dx
problem  x 2 , x(0)  1.
dt

2. Solve yp  2 yx  log q.

3. Solve yzp  zxq  xy with usual notations.

4. Explain Strum-Liouille’s boundary value problems.

 2u  2u  2u u u
5. Classify the equation  4  4  2  0.
x 2
xy y 2
x y

6. Solve r  t  2 s  0 with the usual notations.

7. Find the particular integral of the equation ( D 2  D) Z  e 2 x  y .

8. Solve in series the equation xy"  y '  y  0 .

9. Solve y "  y  x using power series method.

10. Solve the Froenius method x 2 y "  2 x 2 y '  2 y  0 .

11. Solve in series 2 xy"  6 y '  y  0.

12. Prove that J  n ( x)  ( 1) n J n ( x) where n is an integer.

13. Prove that xJ n' ( x)  nJ n ( x)  xJ n 1 ( x ) .

14. Prove that H n ( x)  (1) n H n ( x).

15. Show that H 2 n 1 (0)  0.

16. Show that (2n  1) xPn ( x)  (n  1) Pn 1 ( x)  nPn 1 ( x ).

u u
17. Solve  ; with u ( x,0)  4e  x using separation of variable method.
x y

18. Find the surface passing through the parabolas Z  0, y 2  4ax and Z  1, y 2  4ax and
satisfying the equation xr  zp  0 .

19. Find the surface satisfying t  6 x 2 y containing two lines y = 0 = z and y = 2 = z .

20. Reduse the equation x 2 r  y 2t  px  qy  x 2 in the canonical form.

 DEPARTMENT OF MATHEMATICS
OSMANIA UNIVERSITY
M.Sc. Mathematics
Semester I

MM104 Elementary Number Theory

Paper- IV

UNIT-I

The Division Algorithm- Number Patterns- Prime and Composite Numbers-

Fibonacci and Lucas’ numbers- Fermat Numbers- GCD-The Euclidean Algorithm-
The Fundamental Theorem of Arithmetic- LCM- Linear Diophantine Equations

UNIT-II

Congruences- Linear Congruences- The Pollard Rho Factoring Method- Divisibility

Tests- Modular Designs- Check Digits- The Chinese Remainder Theorem- General
Linear Systems- 2X2 Systems

UNIT-III

Wilson’s Theorem- Fermat’s Little Theorem- Pseudo primes- Euler’s Theorem-

Euler’s Phi function Revisisted- The Tau and Sigma Functions- Perfect Numbers-
Mersenne Primes- The Mobius Function

UNIT-IV

The Order of a Positive Integer- Primality Tests- Primitive Roots for Primes-
Composites with Primitive roots- The Algebra of Indices- Quadratic Residues- The
Legendre Symbol- Quadratic Reciprocity- The Jacobi Symbol

Text Book : Thomas Koshy , Elementary Number Theory with Applications

 d Aryabhata. 9. If [a, b] = ab, then a = b. Prove each, where a, b, c, k, m, a1 , a2 , . . . , an , x, y, and z
Find the lcm of each pair of integers. 32.positive
are The lcmintegers. of any two integers is unique.
10. If [a, b] = ab and [b, c] = bc, then [a, c] = ac.
11. 110, 210 12. 65, 66 33. (a, b)|[a, b]
Find the lcm of each pair of integers. 32.
34. The
[ka,lcm kb] = of k[a,
any b] two integers is unique.
•
Find [a, b] if Does every LDE have a solution?
11. 110, 210 12. 65, 66 33. (a,
35. aLet b)|[a, b]
m be any multiple of a and b. Then [a, b]|m.
13. a|b • If not, under what conditions 14. b|a does an LDE have solution?
Find [a, b]• ifIf an LDE is solvable, what is the maximum number 36. [ka,
34. Let kb] =
a2k[a,
, . . . ,b]anitbe
a1 ,solutions
of cann (≥have?3) positive integers. Then
15. a = 1 16. a = b 35. Let of a and b. Then [a, b]|m.
13. a|b 14. b|a Figure 3.4 [a1 , a2 , . . . , amultiple
m be any
n ] = [[a1 , a2 , . . . , an−1 ], an ].
17. a and b are distinct primes. 16.bea answered
15. a = 1The first question can =b
36.
37. Let
easily. Consider Elementary Number theory
[kathe , a2,,....2x
a LDE
1 ,1ka 2
a+
..,,ka be nk[a
n ==
n ]4y 5.1 ,3)
(≥ a2positive
No , . . . , an−1integers.
, an ]. Then
b = a +what
18. matter 1 the integers x and y are, the Practicals Question Bank
17. a and b are distinct primes.
Recall that the solutions of the LDE
LHS 2x + 38.
ax + by = 37.
c are
[a
[ka
1
the
,
1
a
4y isIf always 2
, ka
, . .
lattice
2
s. ,
[a1 , a2 ,even,
a n ] = [[a
. . . , anwhereas
, kan ] =that
, . . .points
1 , a
] = a1 a2 the
2
k[a1lie
, . .
, a2on
. , a n−1 ], a
· · · an−1 an , thenn ].
, . . . , an−1 , an ].
a1 , a2 ,
RHS
FindUNIT-I
18. b [a,
is
= ab]+if1
always odd, so the LDE has no solution. Thus, not. . every
. , a n LDE
are has
pairwise a solution.
relatively prime.
the MM154
line + by
axwe = c. (Assume 0 for
a, t >and Paper
38. IfThe
convenience.) IV[a1slope
, a2 , . .of n ] =line
. , athis a ais2 · · · an−1 an , then a1 , a2 Semester , I
Next, establish a necessary sufficient 39. max{x,
condition for y, thez}LDE − min{x, ax +y,1by z} + = min{x,
c y} + min{y, z} +
19. (a,
Find [a, b)
b] =if 3 and ab = 693. . . . , an are pairwise relatively prime.
x} = xsolution,
+ y + z when it
to be solvable. Its proof, in fact, provides a a formulaa/d for anmin{z, arbitrary
20. 1
ab = 156 and a and b are relatively prime. − =− 39. max{x, y, z} − min{x, y, z} + min{x, y} + min{y, z} +
40. The sum of the twin primes p and p + 2 is divisible
is solvable.
19. (a, b) = 3 and ab = 693. b b/d min{z, x} = x + by + z
21. Find the positive integer a if [a, a + 1] = 132.
20. ab =
where 156
The and
= a
Indian and b are relatively
mathematician
Locate prime.
Aryabhata
P(xq]0 ,=y0provided aline.by
complete 12, where
solution p > t3.
of (C.
theZiegenfus,
LDE 1963)
22. Find thedtwin (a, b).
primes p and qthe suchpoint
that [p, ), on the40.
323. The Then summove of the twin units
primesto the
p and p + 2 is divisible
21. 2
Find the positive
in two variables. integer a if [a, a + 1] = 132.
A portion of the proof of Theorem 3.19, 41. (a, [b,
which c]) = [(a,
isplong,
d b), (a, c)]
butZiegenfus,
fairly 1963)
a by 12, |b| where
4.2 Linear
> 3. (C.
Congruences 237
right
FindFind
22. and
the positive
the t units
twin integers
primes paadown ifsuch
andqbsuch
and b of
> 0 [p,
that
that (see
q] = Figure 42.and
323. 3.4a), [a, (b,Linear =
tc)]units ([a, b],
tob),the[a,left
c]) and 237
straightforward, d is variation his method. 41. (a, 4.2[b,
d c]) = Congruences
[(a, (a, c)]
!3
Find a positive integers a and b such that
the 42. [a, c)] = ([a, b],
(b,procedure [a, c]) !
t units down if b < 0 (see Figure E 3.4b).EIn either
X R Ccase,I the S E S determines
4.2 a
d E X E R C I S
EOREM 3.19 The LDE ax + by = c is solvable if and only if d|c, where d = (a, b). If x0 , y0 is a
!
E S 4.2 !
lattice point on the line. The cases a < 0 and t < 0 can be interpreted similarly.
particular solution of the LDE, then all its solutions are given by
Using Theorem 4.9, determine whether each linear con- FindFind
Using Theorem 4.9, determine whether each linear con-
the least residues modulo m that are self-invertible
the least residues modulo m that are self-invertible
gruence is solvable. ! " !for "each value of m.
gruence is solvable. b for each a value of m.
204Euler’s Method CHAPTER for =Solving
x 4.3 x0The+3Pollard LDEs
Greatest
t Rho andCommon y = y0Divisors
−
Factoring Method t 239 30. twelve
1. 20412x1. ≡ 12x 18≡(mod 18 (mod 15) 15) CHAPTER d3 Greatest Common d seven
29.
29.Divisors
seven 30. twelve
2. Euler
12x
16y2. ≡ +16y devised
16y
18 ≡(mod=1818 a method
(mod
12) 12) for 3. solving
14x + 16y LDEs= 15 that employs Determinethe division whether algorithm,
each LDE isbut solvable.
3.5wherenot
Linear
3. theWe now
is
12xt euclidean
≡ an Diophantine
14 (modcompute
arbitrary the gcd
13) integer.
algorithm.
Equations
(xj − xi , n) for every Using Using
distinct 4.2
pair
inverses, inverses,
Linear
j , xithe
xfind find
until theaincongruent
Congruences non- solutions
incongruent solutionsof each lin-237
of each lin-
4.2 Linear Congruences
3. 12x
4. trivial
12x ≡
+ 14
2.Linear
12x 13y+(mod16y 14 =13)
=emerges. 18 5.(x 28x
3. +x91y
14x + ==
16y 119
= 15 29. Determine
2x +congruence.
3y + whether 4z = 5 each LDE is solvable.
3.5 gcd Diophantine Since Equations
6 − 2 , n) (364 − 26,ear ear
7943)
congruence. = (338, 7943) = 169,
4. 4 4. 28u ≡ 119 (mod 91) 8x +2x10y +
28u ≡ 119 (mod 91) Often we are interested in integral
4.5. 12x
6. 169|7943. ++≡ 50 =
13y =144152 E 28xX+ 91y
5. E = 119 R C 30.Isolutions 29. S5x+≡ E3y of+ S4z==6)25
16z
equations 5 with!integral coefficients.
4.2 E withX32. E R C(mod I 13) S E S 4.2
1776x
PROOF 76v 1976y (mod 176) 31. 3−(mod 32.≡4x ≡(mod
11
AMPLE 3.245. 76v
Solve ≡ 50
the LDE
(mod 176)
1076x Such
Often + 2076y
equations
we are = 3076 are
interested by
calledEuler’s
in diophantine 31.solutions
method.
integral 5x
12x
30. ≡equations,
8x+3 + 30y
(mod of
10y 6)
42z16z
equations
+ ==
after 6625 Diophantus, 4x
integral who11 wrote
coefficients. 13)ex-
7. The1076x
6.6. 1776x + 2076y
proof
2076y + consists
≡ 3076
1976y = 1155 = of
(mod 4152four
1076) parts: 33. 33.
19x
32. 31.76w 19x
≡+restrict
29 ≡
176x 29 +− (mod
16)
276y 16)
+ 376z =34. 34.
48xwho 48x
≡ 39 the≡ 39 (mod
17) 17)
6. 2076y ≡ 3076 (mod 1076)
Find5 Using Theorem tensively
Such
4.9,=determine of equations onLDE
eachwhether them. areeachFor
called
linear diophantine
example, con- when Find weequations,
12x the+least
(mod
30y the 42z
after
residues =Diophantus,
66
solutions
modulo to476
mintegers,
that arewrote
(mod equa-ex-
self-invertible
7.the1076x general + 2076y solution 1155 using Theo- Using Theorem
Solve 35. the 4.9,
following
Suppose determine LDEs.
is an whether
inverse each
of a linear con-
modulo Show Find the least residues modulo m t
SOLUTION
3.19.The
Determine
gruence • the If above
the theLDE number istensively
algorithm solvable,
tions has+
of incongruent
2x onthen
the = d|c.
disadvantage
3ythem. For
solutions
4, 2
x using 2
+example,of=that
yeach each we
1, and 35. need
when 2
32.
xfor we 76w
+each
Suppose 2 +
ytorestrict
compute
= 2
176x
bzis are bthe
an + 276y
j−x
solutions
diophantine
of inverse + 376z
ofi ,an)to = 476
integers,
equations.
modulo m. Show m.
the equa- that athat a
Determine theisgeneral
solvable.
number of incongruentof eachsolutions of value m.
remFind (x
solution LDE Theo-
gruence is solvable.
x+
33. Solve 2y + following =
3z2solutions. for each value of m.
linear Since
linear
for every congruence.
congruence.(1076,distinct 2076) pair =xj4, xand
tions 2x +4|3076,
i until 3y =
a 16y 4,= the
nontrivial x202+ LDE ygcd2= has1, infinitely
and xThis
occurs. 2is + many
isinverse
anycan 2thean
=beinverse
z time of6bdiophantine
are of
modulo
consuming.Euler’s
b modulo
LDEs. m. m. equations.
8. rem2x + 3.19.
3y =
1. 12x ≡involves 4
18 (modsolving 15) 9. 12x + 34. 33.2x
29. −xseven3y2y + 4z 3z = 5the 30. twelve
method
Fortunately, we can15) do better. the LDE for the variable 1. 12x with
36.
≡ 18 36.(mod
the
Let Let+
fsmaller
(n) f15)+
denote
(n) denote
=
coefficient, the number
6 number x in of positive
of positive integersintegers n ≤seven
≤ 29. n 30
10.
7. 12x 7. 2x
2.
8. +
≡12x
16y 13y
18
+ ≡
≡3y =18
18
(mod = 14 15) 12)
(mod
4
(mod 11. 15x 9. + 21y
12x + = 39
16y = 20 35. 34.6x + 12y − 15z = 33
this case: 2. 16y ≡ 18 and(mod
Using 2xand −
relatively relatively
3y +
12) prime
inverses, 4zfind = prime
5 to
to incongruent
the n. Using
n. Using thesolutions the function
function of f , eachf , give
give lin-
8. 10.
12. 28x
28u
3. +
8. 12x
≡28u
12x 91y
119+≡≡13y=119
14
(mod119=(mod
(mod 91)13)
14 91) 13. 11. 1776x 15x++1976y 21y ==3941523. 12x36. 12xnumber +
the+ 30y number−of− 42z of=least
6633residues
= modulo thatinvert-
m are Using inverses, find the incongruent
are invert-
≡ 35.the
14
ear 6x
congruence.
(mod 12y
13) 15z
least residues modulo m that
9. 49x
12. 9.
14. UNIT-II
4. 28x
Verify ≡49x 94
28uthe +≡
≡91y 94
119
(mod 36)
(mod
=(mod
general 119 36)
−2076y
91)
solution + of3076
13. 1776x
the LDE + 1976yin Exam- = 4152 37. ible.
A collection
ible.+ 91) 30yplate − 42z contains
= 66 nickels, dimes, and quar- ear congruence.
x = 4. 28u ≡ 36. 119 12x
10. A Refined Version (mod
10.
91y ≡91y 119 ≡
76v ≡ 50 (mod
5. 3.24 119
(mod 28)
(mod 28)
176)3.19. 1076 of the LDE in Exam- ters.
31. 5x The ≡pa3total (mod avalue 6) is $4, andathat there32. are
4xtwice
≡ 11 as
(modmany p13) 5x
14.
11. 48v
ple
11.
Verifyusing
≡48v 144 ≡≡
the Theorem
144
general solution
84) 84)1076)
5. 76v37. ≡ 37.37.(mod
Let
50 A
pLet becollection
176)be
prime. plate
prime.Prove contains
Prove
that nickels,
least a least
residuedimes,
residue
modulo and
moduloquar-
31. p ≡ 3 (mod 6) 32
6. 2076y (mod3076 (mod (mod quarters
33.
is 19x
ters.
is ≡ as
The 29 there(mod
total
self-invertible
self-invertible are
ifvalue
anddimes.
16) if is
and
only $4, Find
only
if and ≡the
34.
there
if ±1 possible
48x
≡ are
±1 ≡ 39
twicenumber
(modas many17)
−1000y + 924 a a p). p).
12. 6
15–20. Since Using
ple x ≡
3.24
i x
Euler’s
using
j (mod d),
method,
Theorem solve
3.19. the LDEs in Exer- 6. 2076y ≡ 3076 (mod 1076) (mod (mod 33. 19x ≡ 29 (mod 16) 34
2076x
12. 2076x ≡ 3076 ≡ 3076 = −y
(mod (mod + 21076)
1076) + , by the division of combinationsalgorithm of each (3.12)
kind, ifFind therethe arepossible
more quar-
cises
Determine 8–13.
the number of incongruent 1076 solutions of each 35. quarters
Supposeasb there is an are inversedimes. of a modulo m. Show number
that a
13. 15–20.
Suppose Using
x0 isxEuler’s
0a is solution method,of the solve the LDEs
congruence in
≡ax b ≡ b Findthe
Exer-
Determine the number
Find last
the two last digits
oftwo of each
digits
incongruent of eachnumber. number.of each 35. Suppose b is an inverse of a m
13. Suppose a solution
xi+1 !
of
≡mThe
the
f" " f (xax
! congruence
≡
ters ofthan
is an
nickels.
combinations
inverse of bofmodulo each solutions
kind,
m. if there are more quar-
21. linear
A pilecongruence.
of mangoes
cises 8–13. was collected. (x )king
im took j) ≡ one- xj+1 (mod
linear congruence.
Mrs.
d)
Hall bought 10 hot dogs, 15 cheeseburgers, and 20 is an inverse of b modulo m.
777ters ⋆ 39. ⋆191991 1991
(mod(mod
sixth,
m). Show
the
m). Show
queen
that xthat
one-fifth
= xx0=+x0 + t is also
of the remainder,
t is also
the
a solu-
three
a solu-⋆ 38. ⋆36. 738. 7777than
Let f (n) nickels.
denote the number 39.positive
of 19 integers ≤ n
21.7. A 12x pile ≡ of 18mangoes d
(mod 15)was collected. The king took one- d sandwiches for a pool party. The total bill was $73.50. 36. Let f (n) denote the number of
CHAPTER
tion
where
princes of
tion the
i of5congruence,
j.
the
one-fourth,
< Congruence
Consequently,
congruence, where
one-third, Applications
d =one-half
the
where
and d =m).
elements
(a, (a, m).of of
the thesuc- 7. 12xFind
sequence ≡ Mrs.
18 {x
the and
(mod
} Hallrelatively
lastreduced bought 10
15)
three modulo
digits primehot dogs,
of d
eachtore- n. 15 cheeseburgers,
Using
number. the function and f , give20
and relatively prime to n. Usin
28u ≡the
8. sixth, 119queen 91)
(modone-fifth of the remainder, the three 38. Find k the last
general three digits
solution. of each number.
14–19. 14–19.
peat Find
cessive in the incongruent
Find
every
remainders, the
block incongruent
of
and j − solutions
the i solutions
elements;
youngest of child
each
of each
that congru-
is,
took x the 8.x 28u
congru-
≡ (mod ≡ sandwiches
119
d), the
(mod
where number
91)r
for aofpool
≡ s leastparty.
(mod residues
j −
The modulo
i),
total billmwas that$73.50.
are invert- the number of least residues mo
49x ≡ 94
9. princes (mod 36)one-third, and one-half of the 9.
one-fourth, r s
suc- ⋆ 39. Find
2076 2076 the possible combinations of the
⋆ 41. ⋆171776 1776 numbers of hot
three
and ence
r, s
91y ≡ 119
10. cessive
in i.Exercises
ence
remaining
≥ in Exercises
In mangoes.
fact, 7–12.
{x } 7–12.
Find
reduced the
(mod 28)kand the youngest child took
remainders,
number
modulo ofd man-
is periodic
the
49x40. 440.
≡⋆38.
94
with
≡ 39.
dogs,
37.
Find
4 36)
ible.
(mod
period
Find
Let
the general solution.
pthe
that
cheeseburgers,
28)possible
be
is
a prime.
a factor
and
combinations
of
sandwiches
41. 17
she
of the
could
numbers
have
of hotp
ible.
20. Using
20.
goes Using
− i.three
j11.
Note in
48v
the
that the congruence
thethe converse
pile.
≡remaining
144
congruence
(Mahavira)
(mod
−23y−23y
84) of theFind
mangoes.
≡ −7 ≡(mod
preceding−7 (mod
the number
63), 63), solve
statement
10.
of 11.
solve
man-
91yFind
is false;
119
the
Find
bought
(mod
that last ifnonzero
theis, last nonzero
aif cheeseburger
the digitProve
digital in root
digit the
cost
that a least
indecimal
the
65¢decimal
more
residue
value of modulo
value
than each.
a of 37.
hot Let p be a prime. Prove that a l
each.
the LDE 63x − 23y = −7. ≡ 144Use
48v(Hint: dogs,
(mod cheeseburgers,
is self-invertible
84) 17–20 if and and sandwiches
only if a3.3.) ≡ ±1 (mod p). haveis self-invertible if and only if a
she could
22. of The the
total
In
is 1, LDE
cost
particular, 63x
of −
nine 23y
9,let =
citrons −7.
beNthe
t 1076) and seven
smallest fragrant
not be multiple wood dog.
(Hint:
j −instance,
of2076x i≡ that Exercises
Use
is the greater Exercises than in
17–20Then
i. of Section
in Section 3.3.)
7 12.Ngoes2076x in4,≡the7,
3076 or (mod
pile. then
(Mahavira) need a square. 12. For 3076bought (mod digital
if 1076) root
a cheeseburger 43 cost 65¢ more than a hot
apples is 107 coins; the costLDE. of seven citrons and nine 40. ⋆Find
(Williams’ the last version)
two d). digits Fiveof eachsailors and a monkey are
Using t13.
is
22. congruences,
≡7,
Using 0Suppose
Thebut 43 isjcost
total
congruences,
(mod x− solve
0not i);
is so
ofaanineeach
square.
solution
solve ≡ tof(mod
2tcitrons
each LDE.the
and j −
congruence
seven i). Consequently,
fragrant axwood≡ b ⋆ 42. x
100! t ≡dog. x 2t (mod Thus, ⋆to43.number.
⋆376! Find the last two digits of each num
fragrant wood apples is 101 coins. !
find apples
a is
nontrivial 107 coins;
factor the
of cost
n, weof
Find
sevenm
compute
"the cost of13.
citrons the andgcd’s
a Suppose
nine ⋆ 44. −
42.x0100!
marooned
609!x
is a solution of the
n), where on a kdesert
≥ 1,
!
as
congruence
island.
the⋆ "
45.
43. 376!
During
1010!
ax ≡ b
the day they
(x 40. , 777
(Williams’ version) m
Five sailors and1991 a monkey ⋆ 38.are
21. 3x 21.+(mod 4yand+=4y 5a wood
m). =Show x =22.
that (Mahavira) x0 + 22.+d6x
6x 9y+ t=is 15also
= 15a solu- 2k 38.
⋆⋆ 44.kShow 7609! that x = x + ⋆⋆
citron 3x
fragrant wood
5 apple.
apples is 101 coins. Find
9y
the cost of (mod
a m).
gather coconuts for 0food. Theyt decide is39.
also19
45. 1010!
a solu-
to divide them 7777 ⋆ 39
23. CHAPTER
next
15x + example
21y =6 39 Systems
demonstrates. of Linear
24. Congruences
28x + 91y = 119 marooned on a desert d island. During the day they
23. A 15x +
23.person
tion
citron
21y
ofbought
and
= 39
theacongruence,
wood apple.
some 12-cent where 24.
(Mahavira) d =28x
stamps and+
(a, m). 91y =15-
some 119 The Find
tion of up
linear
The
the in the congruence
the
linear
congruence,
gather lastmorning
threewhere
congruence
coconuts
ax ≡retire
and
digits
for dax
c (mod
of=≡
food. each
(a, cfor theisnight.
b)
number.
m).
(mod
They
solvable
b)
decide is to While
solvableif and
divide
theif
Find andthe last three digits of each num
them
25. 8 cent+
14–19.
48x
25. A48x
stamps.
The 84yFind
+ 84y= The incongruent
the
144
following = 144
postal
example clerk solutions
told her the
identifies ofthe total
eachdigitalcost
congru- root
14–19.
only
of
Findthe if
others
only the
r
product
n |c,
are and
rntheasleep,
|c,
ifincongruent ofthe
and twin solutions
one
the primes,
sailor
solutions
solutions
are
gets given
up and
are the
of ⋆each
by
given x
divides
congru-
= x =+x0the+
xthem
by While0
023. (mod person
M); that
bought x1 ≡ 12-cent
is, some x0 (modstamps M). Thus, and some any two (−1)
15- solutions
⋆ 40.nb up
4 nb2076 inof the linear
morning system
and retire for
41. 17 1776
night. ⋆ 40. 42076
AMPLE 4.2726. are was $5.50.
1776x + 1976y
ence Is that = 4152possible?
+in Exercises 7–12. ⋆ 41
Using
except
26.congruent the
1776x
cent for Pollard
the
stamps. pair
1976y The rho
3=postal
andmethod,
4152M,5.so clerkthefactor
told herthethe integer
is total 3893.
cost ence into
(−1)
inM. t, equal
where
Exercises piles, =with
rnasleep,
7–12. oneUsing
b). left over, this which
fact, he throws
solve each
24. 20. A piggy bank
modulo
contains nickels
Using the congruence −23y ≡ −7 (mod 63), 20. and
solution
dimes for a
unique
total solve
modulo r nout
others
for
t, are
where r(a,
n =one b).! Using
(a,sailor gets up
thisand fact,divides
solve them
each
Find nthethe
rcongruence lastmonkey.
nonzero He ≡ hides
digit in(mod his share,
the puts theofre-
Find9 thewas
Findthe
value
least
the
ofLDE
$5.50.
residues
least63x
$3.15.
Is that
residues
Find
possible?
modulo
the= modulo
m that are invertible for Using
possible that areofinvertible
mnumber nickels for
linear the congruence.
linear into equal
congruence.
−23y
piles, with −7
one left decimal
63), which
over, value
solve he throws each.the last nonzero digit in the d
Find
SOLUTION
24. A piggy −
bank contains 23y −7. the maining
(Hint:
LDE 63x Use
−for coconuts
23y3 Exercises
=and −7. together,
17–20 in and goes
Section back
3.3.) to sleep.
XAMPLE 5.5eachProve value
eachThe
and
of following
that
value
dimes.
m.the
of m.digital rootnickels
examples of the and dimes
product
illustrate this offor twin
theorem.a total
primes,
⋆ 46. other outthan 376the(mod monkey.5,1000)
is 8.He hides his share, puts the (Hint:
re- Use Exercises 17–20 in Secti
We have
value n=
of 3893.Find
$3.15. Choosing
the x0 =number 2 and of f (x) = x2⋆ + 1, ⋆1024x
Later
we100! a≡second
generate sailor
the gets1000)
sequence up, divides the pile into five
Using congruences, solve eachpossible
LDE. nickels 46. 1024x
maining ≡ 376 (mod
564 coconuts together, and goes back to⋆ sleep.
⋆ 42. ⋆
25. five
27. 10 A fruit basket contains apples28. andsixoranges. Each ap- Using congruences,
47. ⋆2076x
equal ≡ solve
shares each 1776)
(mod
with
564 one
LDE.coconut left43.over376!which he dis- 42. 100! ⋆ 43
{x k }:and
27.
PROOF
ple
fivedimes.
costs 65¢ and each orange
28. six
45¢, for a total of
47. 609!
⋆ 44. 2076x
Later a ≡
second (mod
sailor 1776)
gets up, divides
⋆ 45. 1010! the pile into five
21. 3x + 4y = 5 22. 6x + 9y = 15 21. 3x + 4ycards = 5equal for the monkey. 22. Later 6xthe + 9y remaining
= 15over sailors
⋆ 44. 609!
re- ⋆ 45
XAMPLE 6.2 !Using 25. A fruit
Every the CRT,
prime basketsolve
3 contains
is of Sun-Tsu’s
the apples and
form 6k puzzle:
−1 oranges. Each ap-
or 6k +1 (see Exercise 80 in shares
Section with4.1), oneso coconut
we left which !he dis-
$8.10. Find
23.!15x + 21y = 39 the> minimum possible number
24. 28x + 91y = 119 of apples peat=linear the !
ple costs 5, 26, 65¢
677, and 2849, each3790, orange 45¢,2113, for a total 23. of 15x + 554, The
21y 39 process. congruence Find24. the≡
ax 28xsmallest
c+ (mod91y possible
b) is solvable
= 119 number if and
can
in thetake the
basket. twin primes to be 6k2824, − 1 and 6k 3392, + 1. Their 1850, product
of
3263,
cards
coconuts = (6k for 3708,
in
the1)(6k
− the
monkey.
... +
original 1)Later= the remaining sailors
pile.
The re-linear congruence ax ≡ c (mod
48x + 84y
25. 2$8.10. Find= xthe144minimum
≡ 1 3),possible x ≡ number
2 of
5), apples and x only
≡ 3peat if r n |c, 7) and
the process. Findthatthe solutions are given
the smallest possible number by x = x
only0 +if r |c, and the solutions are
36keach −Fibonacci
1 ≡ 0 − 1LDE. ≡ 8 (mod 9). So the digital 25.
(mod (mod root48x +
ofProve
the84y =
product n144
(mod n
Solve
26. in 1776x
the + 1976y = 4152
basket. (−1) each. b is 8. (Notice (−1) nb
Next, we compute (x − x , n) for each 26.
value 1776xof k+ ≥ of
1976y
1 t,
coconuts
until = where
4152
a
!n r
nontrivial =
in nthe original
(a, b).
gcd Using
pile. this fact, solve each
26. SOLUTION
the digital root of 3 ·LDE. 5 is27. 6 and
2k not 8.)
k
41. Prove
The rn LDE ai xi = c is solvable ! if and only if rn t, where rn = (a, b). Using
144x +
Solve each = 23
89yFibonacci 233x − 144y = 19 each.
appears:
Find the least residues modulo m that are invertible for linear congruence.
′m
Find the least residuesi=1
a2 , . LDE
modulo
. . , an )|c.
! n m that are invertible for linear congruence.
28. Since
each
Verify
26. 144x the
value
that+moduli
of
x89y=m.= 5− 23m4t,1= y =3,−10 m 2+
27. =233x5, and
12t +
− 3t 144y , 3z ==19 57each
−are value
pairwise⋆41.
(a1 ,The
of m.
relatively prime, ai xi by= cthe is solvable if and only if
CRT, the′ is− 46. 1024x ≡ ! 376
n i=1 (mod 1000) ⋆ 46. 1024x ≡ 376 (mod 1000)
6t − 2t(x 2 linear
a xsolution
1 , n) system =of(21,thehas LDE a unique
3893) 6x + = 8y 1 solution.
+ 12z′ = (x410To − xfind n)it,
2 , 42. =first
If
⋆ 47. (2823,
the we
LDE
, a2≡
find
,3893)
thex=
. , aain(modiM=1 1c, isMsolvable,
2, then it has infi-
27.
28. five
Mfor3 ,any
Verify that x = 5 − 4t, y = −10 28. + six12t + 3t , z = 5 − 2076x
(a 1 . .564 )|c. 1776) ⋆ 47. 2076x ≡ 564 (mod 1776)
y (x,integers
y−, and x , n) t yand
3 in
′
=t the. proof
(2147, 3893) of the = theorem.
1 (x 27. − xfive , n) = (543, 3893) i=1 ! n= 128. six
6t1−62t2′ is3a solution of the LDE 6x + 8y + 12z8 = 104 nitely
42. If the many LDE solutions. ai xi = c is solvable, then it has infi-
! (x EM
for any 10 − XMx5 ,,E n) t=and R(3236,
M3t:′ .
C 3893) I S= 1 E (x S12 !−5.1 = (884,
x6 , n) (Hint: Use3893) = 17 !
1 ,integers
To find 2 and
i=1
induction.)
nitely many solutions.
e or False. !Thus, 17|3893 and 3893 = 17 · 229. Determine (Hint: Use induction.) !
M 3whether
· 5 · 7 each number is divisible by 11. !
M1 = = = 35
integer divisible by
! 5 is odd. 19. m
43,979
1 3 20. 548,152 !
integer divisible by 11 is odd. 21. M
502,458
3·5·7 22. 1,928,388
a palindrome. M2 = = = 21
Using
m2 casting5out nines, identify each computation as
 2 ≡x21 ≡ a a≡ (mod ≡ (mod n) and n) and n ! a,n then ! a, then n is napis −ap1 −
prime. prime.
1Is this Is this true true or false?or false?If it If is ittrue,
is true,
can can
low low that
Thethat xfollowing (mod 1 (mod pq), pq),
example where where p and
illustrates q are
p and q distinct
this are distinct
proof. true even
true if
even if
p|n, was
p|n, established
was established in 1874
in 1874by Catalan.)
by Catalan.)
we prove
we prove it? If it is not, it? If it is not, can
can weTheorem
7.4 Euler’s we produce
produce a counterexample?345
! ! " a" counterexample? We will continue this this
We will continue
primes? primes? p − p1 − 1 r r
discussion ≡ (−1) 0 ≤ 0r <
of discussion
11. 11.
Let Let a bea abesolution a solution the
of the congruence innext
incongruence
the thexnext ≡x2section.
2section. 1≡ 1
26. 26. ≡ (−1) (mod p), where
(mod p), where ≤ p.r < p.
r r
AMPLE 7.4 Let That
(mod(mod p m). is,
= 7Show m). and Show a =that
that m12. −m aBy Lemma
is aalso
− a solution.
is also 7.2, the least residues
a solution.
⋆ 27.⋆ 27. Let of pLet=1pm· = +m
12, n+ 2 3, +where
n· 12, 3,3where · m,
12,nm, ≥ n0.≥Then 0. Then [m! + [m!(m++(m +
m (mod m (mod
assical Milestones
ee ClassicalWithout 4 ·
Milestones
Without 12,
usingusing 5 · 12,
Wilson’s 6
Wilson’s · 12
theorem, modulo
ϕ(m)
atheorem, E
rverify
7 EX are
· ·that
1 r2verify · rϕ(m)XEa
that
(p−1)! ER
permutation
≡ r1≡r2−1
(p−1)! RC
·≡· ·−1 C Iof
rϕ(m) (mod SI
the SE
1)!][n!
integers
m)
+
1)!][n! ES(n + +1S(n7.2
1)!]
+
through ≡7.2
1)!] (−1)≡ 6,(−1)so p) (A.
p) Cusumano,
(A. Cusumano,
(1 · 12)(2 · 12)(3 · 12)(4 · 12)(5 · 12)(6 · 12) ≡ 1 · 2 · 3 2005)
· 4 · 2005)
5 · 6 (mod 7). That is,
p) for p) each
forwould p. p.
each
mat’s little (mod (mod
theorem,
UNIT-III we is like to examine its converse: r2 · If 63! ≡ 63!−1
Fermat’s little6!12Since 6≡
theorem, each 6! we ri would
(mod relatively
7). Since
like to(6!, prime 7) =
examine to1, m, this
its 1yields
(rconverse: · · r12
ϕ(m)If628.
, m)
≡ Using
128. (mod 1;Exercise
= Using 7).Exercise
so, 21, show
by Theorem 21, show that
4.6,!that ≡ (mod
−1 (mod 71).71).
! a,nthen
nand Compute
n
12. is
3
12.Compute
a prime.
3 the 13.remainder
theIs 5
13.remainder
this 5 when
true when
or
14. the
false?
7
14. first
the
7 integer
first
If it
15. integer
is 13is
true,
15. divided
13 iscandivided 26. There 26. There are infinitely
are infinitely manymany values of nofsuch
values n suchthat that
! a, then11
a n is ≡
ϕ(m) 1 (modIsm).
a prime. this true or false? If it is true, can Verify Verify that +
n+1 [((p
that
n+1 n− −17.
[((p n1)/2)!]
−(E. 1)/2)!]2 2
≡1976)!
−1≡ 1976)
−1 (mod
(mod p) for p) foreacheach
not, by the by second.
the second. p|2 p|2 3 + 3 − 17. Just,
(E. Just,
t is can
not, we produce
canProve
weProve each,each,
produce
CHAPTER
awhere
counterexample?
awherep isQuadratic
11counterexample? pa prime.
is a prime. We will We continue
coupled
Congruences will continue this this
prime primep. p.
section. 1. 7 1001Fermat’s,1001
17 little theorem, 2. 30 2020 ,2020
19 with the congruence properties we studied in a nonnegative
next section. 1. 7The , 17
following example 2. 30
illustrates , 19 Euler’s theorem. Let p Letbe panybe oddany primeodd and aand
prime any any nonnegative integer.
integer.
16. 16.
Let1976 pLet be1976
podd. be odd. ThenThen 2(p − 2(p 3)!−≡3)! −1
5555 ≡ 5555−1 (mod
(mod p). p). 29. 5
29. 5 30. 13
30. n13 31. 17 17
31. 32. 32. 29 29
3. Chapter
15 3. 15
PROOF
, 234, provides
, 23 an 4. 43
efficient 4. 43 k , 31
recipek , 31 to evaluate the remainder
Prove the
Prove when
following.
the following.a is divided
(p −(p1)(p
17. 17. − 1)(p − 2)−· ·2) · (p· ·− · (pk)−≡k)(−1) ≡ (−1) k! (mod k! (mod p), where
p), where 33. 33.
R R C C I Find
SIby By≤p,
the Ek1Euler’s
where
ones Sones digit p7.2!digit
a and
p.criterion,
in the nthe≥base-seven
inbase-seven p − 1,expansion as the following
of each exampleMake Makea conjecture
demonstrates. a conjecture using Exercises
using Exercises 29–32. 29–32.
E
AMPLE 7.19
1Find
Let S m
<thep.
≤
=
kE <
24 S
and 7.2
a any integer
expansion
relatively prime
of each
to 34.
27. There
24.
p−1
Does
127. Does
34. 1 p−1
+are
your p−1
2 your
+ 2
eight
p−1
+conjecture
· · positive
conjecture ·++· (p hold
· · +−holdfor
1)
(pin-
p−1
− p =
for
1) p−1
≡p−1
2, =3,≡2,(mod
or
−13,7?or p)7? p)
(mod
decimal
18. 12
18.decimal
Let number.
pLet bepodd. number.
be odd. ThenThen 12 · 3122 ···3·2(p· ·− · (p2)− 2 ≡ 2(−1)(p+1)/2
2) ≡ (−1)(p+1)/2⋆ 28. 35.⋆ 35. p
Establish pp
128.+Establish
12 + thep conjecture
+2· · ·+the
+· (p· − (p
conjecture
· +
p in p
Exercise
1) −≡1)0in(mod ≡ 0 33.
p) 33.
Exercise
(mod p)
tegers ≤ p). 24 and relatively ≡prime to 24, namely,
(p−1)/2
p)1, 5, 7, 11, 13, 17, 19, and 23; so
5101
5. Find
(mod 5. (mod5the p).
101 (−1/p) 6. 24 12 1111
6.1947 121111
(−1) (mod17. 29.+
p + (a
+ 1)p #
p−1
+ 2)(ap−1
p + · ·p· + (a + p − 1)p ≡ −a
· (a + p − 1)p ≡(mod
er
AMPLE 7.5
is divided26.
divided There
26. Thereare
= remainder
8. infinitely
Thus,
are by
infinitely
when
many Euler’smanyvalues is
theorem,
valuesofdivided
n2 ofsuch a 8 by≡ that
such1 that ⋆ 29.
36.24).
(a
ProveIn
1)
(aparticular,
that
# + let
+
2)a+=· ·77.
≡ 1≡ p). (L.
−a (mod
Talbot,
p) p)
19. ϕ(24)
Let
7. 19. 2076
pLet be p odd.
2076 be Then
odd. Then 2 2 · 42 22 ·
· ·4 · 2 · 3434
·−· 1) −2
3434 ≡1) ≡ n
(p+1)/2 (mod
(p+1)/2 ⋆ 36. Prove that (1 (1p/n)+ p/n) (mod1 (mod p). (L. Talbot,
29
p|27. 29 n+1 + n+1 3
=+
n − 17.
7 ·311, n (E. Just, 8. 37(p
1976)
=8.(−1)
= 1,
(p
37 (−1)
(p−1)/2
8
(−1)
since
(−1) (p−1)/2
= ±1 n=1
an=1
Since p|2 77 p).
p). − (77,17. (E. 24) Just, 1976) so 77 11.3≡Quadratic 1 (mod 24). Let p1995)
Reciprocity be pany
Let be prime,
any prime, anya positive 521integer,
any positive and xand
integer, an xarbi-
an arbi-
Solve13
(mod(mod
each each
SOLUTION
Solve linearlinear congruence. congruence. ! 1995)
20. p20.
Let ALet be We
positive
Apany can
positiveodd confirm
integer
prime
integer n ≥
and this
n2
be any odd prime and=a any nonnegative integer. a≥ isusing
any
2 a isprime the 1
nonnegative
a primefundamental
if ifand p
if is of
only
integer.
and the
if
only properties
form
if trary 4k of
integer
+
trary 1 congruence:
≥
integer 0. Prove
≥ 0. each.
Prove each.
9. 8x
Prove (n 9.≡(n
−
the
Prove 8x 3•
2)! First,
≡2)!
following.
≡
(mod
−
the 1(mod11)notice
3following.
≡(mod1 (mod 11)n). that n).10.both 10. ≡
15x 37977 (mod
−1
15x ≡and
24 7≡ if(mod13)
77297
p is
(mod13)are
of the form 4k!also,
17)primes; + "! " ≡ 1 (mod 4) and
p 3 3797
11. 26x ≡ 12 7297 12 ≡ 17) 1 (mod 12.
17) 4). 12. 43x ≡
Therefore, 17 ≡by 23)
5 the law24) 30.
of quadratic 30. ≡p 0 (mod≡ 0 (mod p), where p), where 0 < k0< <p. k < p.
of
sion each
of each27.! 1
11.! 26x
p−1
CHAPTER + 2
≡ (mod
p−1 11 +
(mod
Quadratic
· · · + − 1) p−1
Congruences
!43x ≡
≡ −1
7717
(mod (mod (mod
p)
23) k reciprocity,
k ! !
Therefore,
27. 1 p−1 +2 p−1 + · · · + (p − 1) 1 ≡if−1
(p p−1 (mod p≡ (mod 1 (mod p) 4)31. Let p > 3. Then ap ≡ ap (mod 6p). Do not use Theo-
Compute
28. p + 2the
1Compute p +least the
· · · +residue
least residue
− 1) ofp each.
≡ of0 =
each.−1 p) 31. Let p > 3. Then a ≡ a (mod ! 6p). Do not use Theo-
Therefore,
p p
28. 1 + 2 + · · · + (p(3797/7297) (p
p + (ap+ 2)p + · ·p· + (a + p −
p(mod
− 1) ≡ 0 (mod
p =≡
1947
ifp) p ≡ −1
(7297/3797)
1947 (mod 4) rem 7.8. rem (G. 7.8.Duckworth,
(G. Duckworth, 1985)1985)
29. PROOF
13. (a213.
29.+ 1)
340 340
(mod + 1) 341) + (a + 2) + · · · + (a24 +1) p −≡1) −a p7≡ −a (mod
(mod p) p) 17)
2(a (mod 341) (mod 32. Using induction, prove that p ≡ ap (mod p).
athat
By
14. 14 11 16Euler’sAccording
+ 17+
16 10criterion,
10 (mod to187) this corollary,77 −1
= is
8 (3500/3797) 8a quadratic = (2 2 32. 3Using
residue · 5 of
· p
7/3797)
induction,
if and only prove if p ≡ a ≡ a (mod p). p
≡≡1x5and 24)So33. Using
14. 11 (mod
17 187)
Let pBut, be18any prime,
bybeFermat’s a any little positive
theorem, integer, 16 and
7integer, an(modarbi- 17). the binomial theorem, prove that (a + b) ≡ p
≡ p − 1 (mod p) 2is solvable3 if and ponlyppif pp≡ 1 (mod 4). For prove that (a + b) ≡
33. Using the binomial theorem,
Let p any
12 prime, a any
2 positive (mod x an arbi-
15. 13 1 (mod
15. 13 + 18 19 4);
+ that
(mod
19 12 (mod is,
247) x 247)
trary
7.27.2
integer
trary integer
Since Fermat’s
≥
2≡1 0. Prove
≥(mod 0. Prove
Little
each.
24),each.Theorem 8 ≡ 58 (p−1)/2 ≡=(5(2 2 )4/3797)(5
≡ x124p) ≡ 22 1 /3797)(7/3797)
a + b
24),a as+not.
(mod p).
b (mod p).
! "!5Fermat’s
example, x2 ≡ 12(−1/p) Little
(mod 77 ≡Theorem
13) is solvable,
(−1) but
(mod ≡ (mod
(mod 1123) is
expected. !
b)p+≡b)p ≡
d 13) Verify peach.
Verify "
each. 7 1947
= 7 16·121+11
2 = (7 16 121
) 34. · 7 Using
34.
3
Fermat’s
Using Fermat’slittle little
theorem, theorem, proveprove that (a that+(a
≡ 0 (mod
30. 30. ≡ 0 (mod p
Corollary 11.2
p), where can 0< now be used
= to evaluate Legendre p p symbols of the form
(11.11)
) 23)
od 17 +p), where =k(−1) 0<<p.k < p.
(p−1)/2 (2 /3797)(5/3797)
since (−1) a +a= (p−1)/2 (7/3797)
bp ±1
+(modbp (mod p). p).
16. (12 k +215) k +1715) as≡ 17 12≡ 12On 15+
17 17 (mod
1517
October 17)18,17) 1640, Fermat wrote a letter to Bernhard Frenicle
31.
16.
(−a (12 /p), the p
a23≡
following On October
example
! (mod 121 18,
shows. 1640,
11 11Fermat 35. wrote
Using a letter
induction, to Bernhard
proveprove that (x de
Frenicle +(xBessy
dep Bessy
1) +≡
(1605–
p (1605–
1)px ≡+xp1 + 1
17. Let 31. p+Euler’s 3.p23Then a23 6p).for≡ Do not
1finding ·puse
7atnot Theo-
≡use 7French 17) 35. Usinginvolvinginduction, ex- that
>21)
Let theorem
3. Then pis(mod
a1675),23
≡ useful
a21 6p). Do remainders (modof
Theo- numbers large
(16
17. (16 + >21)≡
By Duckworth, 16
23 ≡
Theorem 11.4, +
16 21 + (mod
(mod
1675), 23
an(2 an223)
(mod 1
official
/3797) if
= 1;
23)
official is of
the
at thethe form
French (mod
furthermore, 4k
mint +mint1
who was
who was
(5/3797) a gifted student
a gifted student
= (3797/5) = of number theory.
of number theory.
=p−1 p).
18. rem
ponents
Find
18. Find
7.8. the (G.
rem 7.8. (G.
even
primes
the primes ifp Duckworth,
the
such pdivisor
In
1985)
that
such his (2 1985)
is (2
letter,
that composite,
−1−p−1 1)/p ifFermat
Fermat
− p is
is
1)/p provided
of
is athe
a communicated
perfect form
perfect the4kdivisor + 3(mod
the following
p).
is relatively result: prime If p tois a prime and p ! a,
(2/5) = −1, by In his
Theorem
p letter, 11.6; (7/3797) communicated
= 36.
(3797/7) Let the
g(t) = =following
t
(3/7)p − t.p= Thenresult:
−1; there-
g(x +If p
a) + a) ≡prime
≡is a
g(x) and
p) forpp)! for
a,
32. But
Using 2induction, proveand that(−9/83).so≡!
athat (mod(mod
AMPLE 11.6 theEvaluate
32.
cube. Using
7cube.
base. ≡The (−4/41)
induction,
−2 following
(mod prove
17), example 7aa11(mod
p ≡illustrates
≡a1.(7 p).
(mod 2 )5 p). · 7this.≡ (−2) 5 · 7 36.≡Let −32 g(t) · 7=≡ t 2 − ·t.7Then ≡ 14g(xbut g(x)
15
33. (mod
Using
33. Using fore,
the binomial by
the binomial equation then
theorem, p|a
then
(11.11),
theorem,
p−1
p|a
proveprove −
p−1 −
11.3
(3797/7297)
1thatif(a Fermat
p≡ 1.
that Fermat
+ (a p
Quadratic
1 (mod
b) did=
+≡b) 4) p not
did
1 · provide
not
Reciprocity
≡ (−1) 3 (−1)
provide
every a proof
=
positive a proof
1. of
[Thus
integer
every positive integer a.
this
of the
a. result
this con-result
521 enclosed
but enclosed a note
a note
17). =(mod
Let apLetpand
+pabppqand
SOLUTION + bebqpdistinct
gruence
(mod be x2p).
p).distinct
(mod ≡1947
promising
primes, 3797
primes, and
promising a,
−1that
and a, he
and
b,7297)that
if
b, would
pnand
he arbitrary
is≡ would
also
−1
n send sendalong
solvable.]
arbitrary
(mod 37.
4) alongaLet
37.proof,
apLetbe pprovided
proof, a be provided
prime,
a prime, it was
and it and
aand not
was a!!! too
not
band long.
be btoo
anybe long. This
integers
any result
Thissuch
integers result
such
positive
Thus, when
integers. Prove
24each. is divided by 17, the premainder is 14.
AMPLE 7.20 34. Using
Find
positive
34. Using • First,
Fermat’s
the remainder
integers. notice
Fermat’s little Prove that
theorem,
when
little each. both
245
theorem, 3797
1040
proveprove that and
is divided(athat 7297
+ b) (a by are
+≡b) primes;
p
18.≡ also,
that a ≥3797
b ≥ ≡
0. 1
Prove
that a ≥ b ≥ 0. Prove that(mod that 4) and
•p + bpp (mod (−4/41) = (4/41)(−1/41), by property (2) ! " ! "
19. aLet aAccording
ap ≡+ 7297 p (mod
apb(mod ≡ q)
p). 1to(mod thisacorollary,
p). q4). Therefore, −1 is
byathe quadratic
apqlaw ≡apqof≡quadratic
residue ofreciprocity,
p if and only if p ≡
19. Let a ≡ a and q) and≡aaq (mod ≡ a (mod p). Then p).pThen pa ! pa " a ! a "
35. Using
(mod 2example p ≡ pbut
1SOLUTION
35.
(mod The
Using induction,
4); following
that
induction, is, prove
x ≡ that
prove p − 1 is
=
that
(x +
(mod a simple
1)
(−1/41)+p) is
1) x ≡ +
solvable
by x pinteresting
1property
+ if
1 and (3) application
only if p ≡ 1 of(mod the≡ lawFor
4). of(mod p).
pb pb b≡ b (mod p).
a (mod pq). pq). (x
ap). (mod
Unit IV
quadratic
example,
(mod pq
a20. −apq
20. Since (mod p
a245 x
p).
−aap≡−
2 q≡ 12 (mod
reciprocity
+11 aq≡ +0a (mod
and 13)
(3797/7297) Theorem
is
pq)245 solvable,
1040 =11.6. but
(7297/3797)
≡ Corollary x 2 ≡ 22 (mod 23) is not.
1040
pperfect
is a perfect36. =− tp − t.ta11.2
p Then
(mod ≡ 018),
+(mod =
≡ pq) 1,≡ (mod by 11 (mod 11.218). Since (11, 18) = 1, by
21. Let 36.
If21.apg(t)
Euler’s
Let
Corollary
≡ b pg(t)
theorem,
= p), −then
11
t.ϕ(18)
can g(x
Thena ≡ now
≡ b a)(mod
g(x
11
+
6be ≡
g(x)
a) used
p).
1
g(x) to(modp)
18).
forp) for
evaluate Therefore, Legendre (Putnam symbols
1040 Mathematics
= (11 6of)173the · 11form
Competition,
2Competition,
≡ 1977)1977)
every p 2every
p
p
(mod
a ≡ b integer
Ifpositive p
positive
(mod p), a.
integer
then a ≡ b (mod
pa. p
(mod p).
=2(3500/3797) = (22 ·11 53(Putnam
· 7/3797) Mathematics
MPLE 11.19 22. 16
(−a •
1IfShow
a If
173 ·≡be athat
/p),
13 bp ≡ as
≡(mod bp+
1!
13 the following
2! +
p), then a+ ≡
3!then
(−9/83)
18). example =
· ·ab·p+≡(modn! bpis(modshows.
pnever
(9/83)(−1/83) ). p2a).remainder
square, where n > 3. p − 1 method, find
dbitrary
n arbitrary37.
23. Let
22.
37.
q−1
p23. pLet + q pap−1 prime,
be≡
(mod
(mod
a 1prime, andp),
(mod aandandThus,
pq) a band be thebany be=
desired
integers
any (2 such such
2integers
/3797)(5 3 Using
is 13.the
UsingPollard
/3797)(7/3797) the Pollard p − 1 method, afind
! nontrivial
a nontrivial factorfactor
of of
q−1
p≥ b ≥ + 0. p−1
q Prove ≡ 1that (mod pq) = (−1/83)
that q thata p ≡a p≥+b q≥(mod 0. Prove each.
24.+pqq +
24. pPROOF (by qp ≡ contradiction) pq) that each.
AMPLE 11.6 Evaluate 5 (−4/41) ! p +"qand (mod ! pq)
(−9/83).
" = (22 /3797)(5/3797) 3
(7/3797) (11.11)
pq
Then pq
a ≡a ≡ 25. 30|(n Let Using
N − =
25. 30|(n − n) (R. S. n)51! (R.
+
Lemma S.
2!
pa
!
Hatcher,
+ 3!
7.5, "
+
paHatcher,a the · !
1970)
· · +" =
following
a 1970) n!.
−1 Assume corollary that deduces
N = 38.
x 2 2323
for
Fermat’s
38. some
2323 positive
little theorem integer 39.
from !
7967
x.
39. 7967
17 ≡ ≡ (mod p).
(mod p).
11.22 The Legendre Symbol 511
Since ntheorem.
Euler’s
! SOLUTION > 3, N pb> 5. pb Then b (N/5) b 2
By Theorem 11.4, (2 /3797) = 1; furthermore, (5/3797) = (3797/5) = = (x /5) = 1. !
! !

Since N ≡ 1! + 2! + 3! + 4! ≡ 3 (mod 5), (N/5) = (3/5). But (3/5) = (5/3) =
Another
(Putnam (2/5) = −1,(−4/41)
Mathematics
• (Putnam by Theorem
interesting
Competition,
Mathematics
4986 11.6;
application
1977) of Theorem
= (4/41)(−1/41),
Competition, 1977) =by(3797/7)
(7/3797)11.4 and =
Corollary
property = is−1;
11.2
(2)(3/7) thatthere-
they
AMPLE 11.15
OLLARY 7.3 Verify
(Fermat’s
(2/3) that
=fore,
−1, 9973|(2
so equation
Little =+
Theorem)
(N/5) −1,1).which p isbea acontradiction.
Let(3797/7297) prime = and a Thus,
any
· (−1) N= cannot
integer
3 (−1) suchbethat
a perfect
! a.
p con-
2 ). can bep−1used byto establish (11.11),
the existence
(−1/41) of infinitely 1many primes of 1.
the[Thus
form the
4n + 1,
Using the Pollard
square,
Using
Then athewhere
≡ p1−n(mod
Pollard1>pmethod,
2−3.1p). find a=
(Notice
method, nontrivial
that
find is afactor
square
aNnontrivial by of if nof= 0,(3)
property
factor 1, or 3.) !
gruence x ≡ 3797 (mod 7297) is also solvable.]
each.18
as the following example shows (see Section 3.4). !
each.
SOLUTION = 1, by Corollary 11.2

Notice
38. 2323
38. 2323 that 9973 is 39. a prime
7967 and is ≡ 5 (mod 8). So, by Theorem 11.6, (2/9973) =
39. 7967
AMPLE 11.7 •Prove that there areexample,
infinitelya=many primes of4986 the forma 4n +application
1.
−1. Thus, by Euler’s criterion,bit
The
The following
following (−9/83)
example is acomplicated,
(9/83)(−1/83)
simple ≡but
(2/9973) is also
≡ −1fine
2 interesting application
(mod 9973),
soofof the law
the
9973|(2 law of
4986of+
! !
quadratic
19
quadratic
1). reciprocity. In addition
reciprocity and Theorem to
= (−1/83) Theorem
11.6. 11.4, it employs two additional facts: !
PROOF (by contradiction)
Assume
• The product
that there of two integers
is only −1 of
a =finite the form
number of 5k + 1primes,
such is also say,
of thep1same
, p2 , . form. !
. . , pk . Let
AMPLE 11.19 Show• that
If p 1!
is +
an 2! +
odd
2 3! +
prime · · =
̸ · +5, n! is
then never
(5/p) a =square,
1 if
N = (2p1 p2 · · · pk ) + 1. Since N is odd, it must have an odd prime where
and only n >
if p 3.
≡ ±1 (mod 5).
factor p. Then
In this example, we could 2use properties of congruence and arrive at the same
N
20 ≡ 0
Try (mod
to p), so
confirm (2p 1
both. p 2 ·
See· · p k ) ≡
Exercises
4986 −1 (mod
21 and p).
29.
conclusion
PROOF by showingapplication
(by contradiction)
Another interesting that 2 ≡
of −1 (mod 9973),
Theorem 11.4 andbutCorollary
this would involve
11.2 is thattedious
they
can
and
Let N time-consuming
= 1! + 2! + 3! +computations.
· · · + n!. The
Assume dual
that power
N = x 2 of
be used to establish the existence of infinitely many primes of the form Theorem
for some 11.6
positive and 4nEuler’s
integer
+ 1,x.
Prove
MPLE 11.20 as
Since that
criterion there
n > makes
3, N >
the following are
5.infinitely
our lotmany
job shows
Then
example a (N/5) primes
easier.
= (x
(see
2 /5) =
Section 1.the form 10k − 1.
of3.4).
Returning to+Theorem

Since N ≡ 1! 2! + 3! +11.6,4! ≡we can restate
3 (mod 5), (N/5) the formula
= (3/5).for (3/5)in=a(5/3)
But(2/p) compact=
PROOF
way, =
(2/3) as −1,
the following result
so (N/5) = −1,shows.
which
is a contradiction. Thus, N cannot be a perfect
AMPLE 11.7 Prove
Let N that there
=where
5(n!) 2−are infinitely many primesNofisthe ofifform 4n + 1. − 1. Let p be a prime
square, n >1,3.where
(Noticen> 1. Clearly,
that N is a square the
n =form
0, 1, 10k
or 3.) !
factor of N. Clearly, p must be odd. Since p|N, 5(n!)2 ≡ 1 (mod p), so (5(n!)2 /p) =
2 −1)/8
Let p be an
OLLARY 11.6 PROOF odd prime. Then2 (2/p) = (−1) (p .
(1/p) =(by contradiction)
1; that is, (5/p)((n!) /p) = (5/p) = 1. Thus, p ≡ ±1 (mod 5), so p is of the
Assume that there is only a finite number of such primes, say, p1 , p2 , . . . , pk . Let
The pfollowing
= (2p 2 example, a bit complicated, is also a fine application of the law of
N PROOF 1 2 · · · pk ) + 1. Since N is odd, it must have an odd prime factor p. Then
N ≡ 0 (mod p), so (2p1In
quadratic reciprocity. p2addition
· · · pk )2 ≡to −1
Theorem
(mod p). 11.4, it employs two additionalp2facts: −1
We consider the four cases as in the preceding proof. If p ≡ 1 (mod 8), then =
! • The " product of two integers of the form 5k + 1 is also of the2same form. ! 8 "
p−1 p −1 p+1
• If p(p is +
an 1)
oddis prime =
̸ 5, then = 1 if and
an even integer; if p ≡ −1 (mod 8), then
(5/p) only if p ≡ ±1 (mod= 5).
8 8 8
(p −Try
1)tois confirm
also an both.
even See Exercises
integer. Thus, 21if pand
≡ ±129. (mod 8), then (−1)(p −1)/8 = 1 =
2

(2/p), by Theorem 11.6.


 DEPARTMENT OF MATHEMATICS
OSMANIAUNIVERSITY
M.Sc. (Mathematics)
MM –201 Semester II
Advanced Algebra
Paper I
Unit I

Algebraic extensions of fields: Irreducible polynomials and Eisenstein criterion- Adjunction of

roots- Algebraic extensions-Algebraically closed fields (Pages 281 to 299)

Unit II

Normal and separable extensions: Splitting fields- Normal extensions- Multiple roots- Finite fields-
Separable extensions (Pages 300 to 321)

Unit III

Galois theory: Automorphism groups and fixed fields- Fundamental theorem of Galois theory-
Fundamental theorem of Algebra (Pages 322 to 339)

Unit-IV

Applications of Galoes theory to classical problems: Roots of unity and cyclotomic polynomials-
Cyclic extensions- Polynomials solvable by radicals- Ruler and Compass constructions. (Pages
340-364)

Text Books:

[1] Basic Abstract Algebra- S.K. Jain, P.B. Bhattacharya, S.R. Nagpaul.

Reference Book:Topics in AlgrbraByI. N. Herstein

 M.Sc. Mathematics

Advanced Algebra

MM 251 Paper I Semester II

Practical Questions

1. (i)  p ( x)  1  x  .....  x p 1 is irreducible over Q. Where p is a prime.

(ii) Show that x 3  3x  2 

Z
x  is irreducible over the field Z .
7 7
2. Show that the following polynomials are irreducible over Q
(i) x3  x 1 (ii) x 4  3 x 2  9 (iii) x 4  8
Z
3. Show that there exists an extension of E of with nine elements having all
3

the roots of x 2  x  1 
Z
x 
3
4. (i) Show that there is an extension E of R having all the roots of 1  x 2
(ii) Let f i ( x)  F x  for i= 1, 2, . . . . . . .m then there exists an extension E of
F in which each polynomial has root
5. Show that 2 and 3 are algebraic over Q and find the degree of Q 2 over Q  
 
and Q 3 over Q.
(iii) 
Find a suitable number a such that Q 2 , 5  Q (a ). 
6. Show that the degree of the extension of the splitting field of x 3  2  Q ( x) is 6
7. Let p be a prime then f ( x)  x p  1  Q( x) has a splitting field Q  where   1
and  p  1. Also Q  : Q  p  1
1
8. Show that the splitting field of f x   x  2  Qx  over Q is Q (2 , i ) and its
4 4

degree of extension is 8
9. If the multiplicative group F  of non zero elements of a field F is cyclic then F is
Finite
10. The group of automorphisms of a field F with p n elements is cyclic of order n and
generated by  where  ( x)  x p , x  F
Q( )
11. The group G ( ) where  5  1 and   1 is isomorphic to the cyclic group of
Q
order 4
 12. Let E  Q (3 2 ,  ) where  3  1,   1 let  1 be the identity automorphism of E and
Let  2 be an automorphism of E such that  2 ( )   2 and  2 (3 2 )   (3 2 ). If
G  { 1 ,  2 } then EG  Q(3 2 2 )
13. If f  x   F (x) has r distinct roots in its splitting field E over F then the Galois
E
group G   of f (x) is a subgroup of the symmetric group S r .
F
14. The Galois group of x 4  2  Q x  is the octic group.
15. The Galois group of x 4  1  Q( x) is Klein four group

 Z 
16. 8 ( x ) and x  1 have the same Galois group namely    {1, 3, 5, 7}, the Klein’s
8

 8 
four group.
17. If a field F contains a primitive nthroot of unity then the characteristic of F is Zero
or a prime P that does not divide n
18. Show that the following polynomials are not solvable by radicals over Q
(i) x  10 x  15x  5 (ii) x  9 x  3 (iii) x  4 x  2
7 5 5 5

19. It is impossible to construct a cube with a volume equal to twice the volume of a
given cube by using ruler and compass only.

20. A regular n-gon is constructible if and only if  n  is a power of 2. (equivalently the

2
angle is Constructible.)
n
 DEPARTMENT OF MATHEMATICS
OSMANIA UNIVERSITY
M.Sc. Mathematics
MM –202 Semeste II
Advanced Analysis
Paper II
Unit I

Algebra of sets- Borel sets- Outer measure- Measurable sets and Lebesgue measure- A non-
measurable set- Measurable functions- Little word’s three principles.

Unit II

The Rieman integral- The Lebesgue integral of a bounded function over a set of finite measure-
The integral of a non-negative function- The general Lebesgue integral.

Unit III

Convergence in measure- Differentiation of a monotone functions- Functions of bounded variation.

Unit-IV

Differentiation of an integral- Absolute continuity- The Lp-spaces- The Minkowski and Holder’s
inequalities- Convergence and completeness.

Text Books:[1] Real Analysis (3rd Edition)(Chapters 3, 4, 5 )

by

H. L. Royden

Pearson Education (Low Price Edition)

 M.Sc.Mathematics

Advanced Analysis
Paper II
MM252 Practical Questions Semester II
1. (i). Prove that the interval [0,1] is not countable.
∗( ) = 1.
( ii). If is the set of all irrational numbers in [0,1]. Prove that
∗( ) = 0. Prove that ∗( ∗
2.(i). If ∪ )= ( ).

(ii). Prove that if a −algebra of subsets of ℝcontains intervals of the form ( , ∞)then it contains
all intervals.

3. Show that a set is measurable if and only if for each > 0there exists a closed set and an open
set such that ⊆ ⊆ and ∗ ( − ) < .

4. (i). Show that if and are measurable then ( ∪ )+ ( ∩ )= ( )+ ( )

( ii). Suppose { } is an ascending collection of measurable sets. Prove that

= lim ( )
→

5. Suppose and are any sets. Prove that

(i). ∩ =

( ii). ∪ = + −

(iii). =1−

6. Let have measure zero. Show that if is a bounded function on then is measurable and
∫ = 0.

7. Let { } be a sequence of non negative measurable functions that converge to pointwise on .Let
≥ 0 be such that ∫ ≤ for all . Show that ∫ ≤ .

8. Let be a non negative measurable functions on .

Prove that ∫ = 0if and only if = 0a.e on .

9. Let{ } be a sequence of non negative measurable functions on that converges pointwise on to

.Suppose ≤ on for each ,show thatlim → ∫ =∫ .
10. Suppose { } is a sequence of measurable functions on that converges pointwise on a.e. on to .

Suppose there is a sequence { } of non negative measurable functions on that converges

pointwise on a.e. on to and dominates { } on in the sense that | | ≤ on ∀.

If lim → ∫ =∫ prove that lim → ∫ =∫ .

11. Prove that pointwise convergence implies convergence in measure.

12. Construct a sequence of measurable functions which converges in measure but not point wise.

13. Suppose , are functions of bounded variation in [a,b]. Show that + and for any scalar are

also functions of bounded variation on [ , . ]

Also prove that i. ( + )≤ ( )+ ( )

ii. ( )=| | ( )

14. Prove that the greatest integer function is a function of bounded variation on [ , ]

15. Show that continuous and bounded variation of a function are two independent concepts.

16. Show that the sum and difference and product of two absolutely continuous functions are also
absolutely continuous.

17. Let be absolutely continuous on [ , and] be absolutely continuous on [ , with

] ≤ ≤ .
Prove that is absolutely continuous on [ , ]

18. Suppose is absolutely continuous on [ , and

] = { : ( ) = 0}. Prove that ( ) =0

Note. is absolutely continuous on with ( ) = 0 ∀ ∈ implies is constant on E which implies

( ) =0

19. Let be an absolutely continuous monotone function on [0,1] and is a set of measure zero. Prove
that ( h) as measure zero.

20. (i). Show that ‖ + ‖ ≤‖ ‖ +‖ ‖

( ii). If ∈ , ∈ then prove that + ∈ ∈

 DEPARTMENT OF MATHEMATICS
OSMANIA UNIVERSITY

M.Sc.-Mathematics
MM-203 Semester II
Theory of Ordinary Differential Equations
Paper-III
UNIT-I
Linear differential equations of higher order: Introduction-Higher order
equations-A Modelling problem – Linear Independence- Equations with
constant coefficients Equations with variable coefficients- Wronskian-
Variation of parameters- Some
Standard methods.
UNIT-II
Existence and uniqueness of solutions: Introduction -preliminaries-
successive approximations – Picard’s theorem – continuation and
dependence on intial conditions – existence of solutions in the large –
existence and uniqueness of solutions of systems-fixed point method.
UNIT-III
Analysis and methods of non-linear differential equations:-Introduction –
Existence theorem –Extremal solutions-Upper and Lower solutions-
Monotone iterative method and method of quasi linearization- Bihari’s
inequality, Application of Bihari’s inequality
UNIT-IV
Oscillation theory for linear Differential Equation of Second order:- The
adjoint equation-Self adjoint linear differential equation of second order-
Abel’s formula- the number of zeros in a finite interval- The sturm
separation theorem- the sturm comparison theorem –the sturmpicone the
Bocher Osgood theorem-A special pair of solution-Oscillation on half axis.

Text Book :

1) Text book of Ordinary Diffferential Equations

byS.G.Deo, V. Lakshmikantham, V.Raghavendra

2) An Introduction to the Theory of Ordinary Differential Equations by V.

Dharmaiah, , PHI Publishers.

3) An Introduction to the theory of Ordinary Differential Equation

by Walter Leighton
 M.Sc. Mathematics
Theory of Ordinary differential equation
Paper III
MM 253 Semister II
Practical Questions

f ( x )  0
1. Define the functions f and g on [-1,1] by  if x  [1, 0] ;
g ( x  1) 
f ( x)  sin x 
 if x  [0 ,1] then prove that f and g are linearly independent on [-1
g ( x)  1  x 
,1].
2. Solve Euler equitation by assuming a solution of the form xt   t r
(i ) t 2 x  5tx   4 x  0
(ii ) t 2 x   9tx   25 x  0
3. (a) Show that the equation x  px  qx  r , where p , q andr are continuous
d2 f
function on R and p exists on R , reduce to  Qf  R by the transformation
dt 2

1 
xt   exp[  Pdt ] f t  where Q  q  p   p 2 and R  r exp   Pdt 
1 1 1
2  2 4 2 

(b) Solve x  (cot t ) x  6 x  0 given that one of the solution is 2  3 sin 2 t

(c) Find the solution of the equation x  x  1 which vanishes when t  0 and tends
to a finite limit as t  

1
4. (a) Consider the equitation t 2 x  tx  x  t. Show that 1 t   t and  2 t   t are
2
solutions of the homogeneous equation. Use the variation of parameters method
t3 C
to show that a solution of the given equation is xt    C1t  2
8 2t

(b) Use the method of variation of Parameter to find a general solution of

(i ) x  x  cos t (ii) x  x  e t
 5. (a) Find the particular solution by using the method of undetermined
coefficientof (i ) x  25x  2 sin 2t (ii ) x   4 x  2 sin t  1  3t 2  4e t

(b) Consider the equitation (1  t 2 ) x   2tx   2 x  0 , 0  t  1 Given that 1 t   t is

a solution, Find the second linearly independent solution.

6. Find the Lipschitz constant and a bound for f t , x  in the region indicated. Also
find an interval of local existence of solutions of IVP x  f t , x , xt 0   x0 for the
following problems

(i) f (t , x)  t sin x, x(0)  0, t   , x  1 (ii) f t , x   e t (1  x) 1 , x(0)  0, x  , t  1

3
4

7. Show that the following function satisfying the Lipschitz condition in the
rectangle indicated and find the Lipschitz constant.

cos t 1
(i) f (t , x)  ( x  x 2 ) , x  1, t  1  (ii) f (t , x)  sin( xt ); x  1, t  1
2 2

8. Show that the following function do not satisfy theLlipschitz condition in the
et 1
region indicated (i) f (t , x)  2
, f (t , 0)  0 , x  , t  2
x 2
sin n
(ii) f (t , n)  , f (0, x)  0 , x   , t  1
t
9. Calculate the successive approximation for IVPs
(i) x  g (t ) ; x(0)  0 (ii) x  x , x(0)  1 (iii) x  tx, x(0)  1
10. Consider the IVP x  t  x , x(0)  0 , 0  t  a , x  b Show that
2 2

b  
(i) Solution x(t ) exists at 0  t  min a , 
a  b2  
2

b 1 a
(ii) The maximum value of 2 is for a fixed
a b 2
2a
1 1
(iii) h  min(a, 2a ) is largest when a 
2
11. Deduce Gronwall’s inequality from Bihari’s in equality.
 f , v, g  
f , v  C R  , R  g  C 0,  ; 0,   and g ( x)
12. Let the function be defined as
be non decreasingin x and be sub additive, i.e.,
t
g (u , v)  g (u )  g (v), h  C[ R  , R  ]
and if f (t )  h(t )   v(s) g ( f (s))ds, t  t 0 then
t0

 t 

1
Show that f (t )  h(t )  G  G ( c )  v (t ) dt , t 0  t  T Where C is a Constant and
 t0 
G, G 1 , T are as given in Bihari’s Inequality.
13. State and Prove Application of Bihari’s Inequality.
14. Find Upper and Lower Solution of IVP’s
1
(i) x  x 2 , x(0)  0, t  0 (ii) x  x 2 , x(0)  1
15. Find the minimal and maximal solution of IVPs
2 1
(i) x  3x 3 , x(0  0) (ii) x  x 2 , x(0)  0
16. Represent following equation in to self adjoint form
(i) y   3 y   2 y  0 (ii ) x 2 y   xy   ( x 2  n 2 ) y  0
(iii ) (1  x 2 ) y   2 xy   (n 2  n) y  0
17. Find a function Z (x) such that
d d
(i) Z ( x)( y   y) 
(k ( x) y   m( x) y) (ii) Z ( x)( y   3 y   2 y)  (k ( x) y   m( x) y)
dx dx
18. (a) Given (n+1) is a solution of y 
  2( x  1) y   2 y  0 ,Find the general Solution

(b) Find the general solution of differential equation x y   xy   y  0 by

2

guessing one of its Solution

19. Which of the following differential equation possess more rapidly oscillating
solution in the interval (1, )
 
(i ) x 2 y   xy   y  0, y   y  0 (ii) y   ( x  1) y  0, y   ( h  x 2 y  0
20. (a) Show that all solution of x y   k y  0 ( p  0, K  0 are the real cons tan ts )
p 2 2

1
vanish infinitely often an (1, ) iff p  2 , K  n
2
(b)

Show that all solution of equation x y   x y  0 (q  0 a real constant) are
q q

Oscillatory on 1, 
 DEPARTMENT OF MATHEMATICS
OSMANIA UNIVERSITY
M.Sc. Mathematics
MM 204 Semester II
Topology
Paper IV
UNIT I

Topological Spaces: The Definition and examples- Elementary concepts- Open bases and
open subbases- Weak topologies.

UNIT II

Compactness: Compact spaces- Products of spaces- Tychonoff’s theorem and locally

compact spaces- Compactness for metric spaces- Ascoli’s theorem.

UNIT III

Separation: T1- spaces and Hausdorff spaces- Completely regular spaces and normal spaces-
Urysohn’s lemma and the Tietze extension theorem- The Urysohn imbedding theorem.

UNIT-IV

Connectedness: Connected spaces- The components of a spaces- Totally disconnected

spaces- Locally connected spaces.

Text Books:

[1] Introduction to Topology and Modern Analysis (Chapters 3,4,5,6)

By

G.F. Simmon’s

Tota Mc Graw Hill Edition

 TOPOLOGY

MM 254 Paper IV Semester II

Practical Questions
1. Let and be two topologies on a non- empty X, then show that - T1  T2 is also a
topology on X. Does this hold for unions Justify.

2. Let x be a non- empty set and consider the class of subsets of X consisting of the empty
set  and all sets whose complements are countable. Is this a topology on X ?

3. Let X be a topological space. Then any closed subset of X is the disjoint of its boundary and
its interior.

4. Let f:X ----Y be a mapping of one topological space into another and let there be given an
open base in X and open sub base with its generated open base in Y. Then f is continuous
the inverse image of each basic open set is open the inverse image of each sub basic open
set is open

5. Let f: X ---- Y be a mapping of one topological space into another. Then prove that f is open

the image of each basic open set is open

6. Prove the converse of Heine – Borel Theorem.i.e. envy compact subspace of the real line is
closed and bonded.

7. Show that a continuous real function of defined on a compact space X attains its infinium and
its supremum.

8. Define product topology and give an example.

9. Show that compact metric space is separable.

10. Show that a closed subspace of a complete metric space is compact if and only if it is totally
bounded.

11. Show that any finite T1 – Space is discrete.

12. Show that a closed subspace of a normal space is normal

13. Let X be a T1 – Space and show that X is normal if and only if each neighbourhood of a
closed set F contains closure of some neighbourhood of F

14. Prove that every metric space is normal.

15. Show that a sub space of a completely regular space in completely regular.
16. Show that a topological space is connected if any only if Ø and X are the only subsets of X
which are both open and closed.
17. Show that the space of all irrational numbers considered as a subspace of real line in totally
disconnected.
18. Show that closure of any connected space is connected is connected
19. Show that a discrete space having only one point is connected and nay discrete space having
more than one point is disconnected.
20. Define a Topology T on R such that (R, T) is disconnected.
 DEPARTMENT OF MATHEMATICS
OSMANIAUNIVERSITY
M.Sc.(Applied Mathematics )

Algebra
AM 101 Paper I Semester I

Unit I

Automaphisms- Conjugacy and G-sets- Normal series solvable groups- Nilpotent groups. (Pages
104 to 128 of [1] )

Unit II

Structure theorems of groups: Direct product- Finitly generated abelian groups- Invariants of a
finite abelian group- Sylow’s theorems- Groups of orders p2,pq . (Pages 138 to 155)

Unit III

Ideals and homomsphism- Sum and direct sum of ideals, Maximal and prime ideals- Nilpotent
and nil ideals- Zorn’s lemma (Pages 179 to 211).

Unit-IV

Unique factorization domains - Principal ideal domains- Euclidean domains- Polynomial rings
over UFD- Rings of traction.(Pages 212 to 228)

Text Books:

[1] Basic Abstract Algebra by P.B. Bhattacharya, S.K. Jain and S.R. Nagpanl.

Reference: 1] Topics in Algebra by I.N. Herstein.

 M.Sc (Applied Mathematics)

Algebra

AM 151 Paper I Semester I

Practical Questions

1. A finite group G having more than two elements and with the condition that
x 2  e for some x  G must have nontrivialautomorphism.
2. (i) Let G be a group Define a  x  ax, a , x G then the set G is a G-set
(ii) Let G be a group Define a  x  axa 1 a , x  G then G is a G-set.
3. An abelian group G has a composition series if and only if G is finite
4. Find the number of different necklaces with p beads p prime where the beads
can have any of n different colours
5. If G is a finite cyclic group of order n then the order of Aut G , the group of
automorphisms of G , is  (n), where  is Euler’s function.
6. If each element  e of a finite group G is of order2 then G  2 n and
G  C1  C 2  .... ..  C n where Ci are cyclic and C i  2.
Z
7. (i) Show that the group is a direct sum of H  {0 5 }and K  {0 2 4 6 8 }
 10 
 z 
(ii) Show that the group  ,   cannot be written as the direct sum of two
4  
Subgroups of order 2.
8. (i) Find the non isomorphic abelian groups of order 360
(ii) If a group of order p n contains exactly one sub group each of orders
p , p 2 , _ _ _ P n 1 then it is cyclic.
9. Prove that there are no simple groups of orders 63, 56, and 36
10. Let G be a group of order 108. Show that there exists a normal subgroup of
order 27 or 9.
11. (i) Let R be acommutative Ring wilth unity. Suppose R has no nontrivial ideals .Prove
that R is a field.
Z
(ii) Find all ideals in Z and in
10
12. (i) The only Homomorphism from the ring of integers Z to Z are the identity and
Zero Mappings.
(ii) Show that any nonzero homomorphism of a field F into a ring R is one-one.
A B A
13. For any tow ideals A and B in a Ring R (i) 
B A B
A B A B A B B A
(ii)     In particular if R  A  B then
A B A B A B A B
R R R
  .
A B A B
14. Let R be a commutative ring with unity in which each ideal is prime then R is a
field
15. Let R be a Boolean ring then each prime ideal P  R is maximal.
16. The commutative integral domain R  {a  b  5 / a , b Z } is not a UFD.
17. (i) The ring of integers Z is a Euclidean domain
(ii) The Ring of Gausion Integers R  {m  n  1 / m, n  Z} is a Euclidean domain
18. (i) Prove that 2   5 is irreducible but not prime in Z (  5 )
(ii) Show that 1  2  5 and 3 are relatively prime in Z (  5 )
19. Let R be a Euclidean domain . Prove the following
(i) If b  0 then  a    (b)
(ii) If a and b are associates then  (a)   (b)
(iii) If a b and  (a)   (b) then a and b are associates
20. Prove that every nonzero prime ideal in a Euclidean domain is maximal.
 DEPARTMENT OF MATHEMATICS
OSMANIA UNIVERSITY
M.Sc. (AppliedMathematics )
AM – 102 Semester I
Analysis
Paper-II
Unit I

Metric spaces- Compact sets- Perfect sets- Connected sets

Unit II

Limits of functions- Continuous functions- Continuity and compactness

Continuity and connectedness- Discontinuities – Monotone functions.

Unit III

Rieman- Steiltjes integral- Definition and Existence of the Integral- Properties of

the integral- Integration of vector valued functions- Rectifiable waves.

Unit-IV

Sequences and series of functions: Uniform convergence- Uniform convergence

and continuity- Uniform convergence and integration- Uniform convergence and
differentiation- Approximation of a continuous function by a sequence of
polynomials.

Text Books:

[1] Principles of Mathematical Analysis (3rd Edition) (Chapters 2, 4, 6 )

By Walter Rudin, Mc Graw-Hill Internation Edition

 M.Sc. (Applied Mathematics)
Analysis

AM 152 Paper –II Semester -I

Practical Questions

1. Construct a bounded set of real numbers with exactly three limit points
2. Suppose E1 is the set of all limit points of E. Prove that E1 is closed also prove that E and E
have the same limit points.
3. Let E0 demote the set of all interior points of a set E. Prove that E0 is the largest open set
contained in E Also prove that E is open if and only if E = E0
4. Let Xbe an infinite set.For p  X , q  X define

1 if p  q
d  p, q   
0 if p  q

Prove that this is a metric, which subsets of the resulting metric space are open, which
areclosed? Which are compact?

5. i) If A and B are disjoint closed sets in some metric space X, prove that they are separated
ii) Prove the same for disjoint open sets
iii)Fixa p  X and   o, Let A = { q  X : d ( p, q )   }
and B  {q  X :d ( p , q )   } prove that A and B are separated.

6. i) Suppose f is a real function on R which satisfies lim  f ( x  h)  f ( x  h)  o for every

ho

x  R Does this imply that f is continuous? Explain

ii) Let f be a continuous real function on a metric space X,let Z(f) = p  X : f ( p)  0

prove that z (f) is closed.

7. If f is a continuous mapping of a metric space X into a metric space Y .prove that

__ ____
f ( E )  f (E ) for every set E  X

8. Let f and g be continuous mapping of a metric space X into a metric space Y Let E be a dense
subset of X. Prove that
i) f(E) is dense in f(X)
ii) If g(p) =f(p)  p  E , Prove that g(p) =f(p)  p  X
9. Suppose f is a uniformly continuous mapping of a metric space X into a metric space Y and {
Xm} is a Couchy sequence in X prove that {f(Xm)} is Cauchy sequence in Y

10. Let I = [ 0 , 1 ] be the closed unit interval, suppose f is a continuous mapping of f into I. Prove
that f(x) = x for at least one x

11. Suppose  increases on [ a , b ] , a <xo <b,  is continuous at x0, f(x0) = 1 and f(x) =0 if x  xo
b
.Prove that f  R(  ) and  f d  0
a
b
12. Suppose f ≥0 and f is continuous on [ a , b] and  f ( x)dx  0 , Prove that f(x) =0  x € [ a , b]
a

13. If f(x) = 1or 0 according as x is rational or not .Prove that f  R on [ a , b] for any a,b,€R with
a<b.Also prove that f R(  ) on [ a , b] with respect to any monotonically increasing function
 on [ a , b]
14. Suppose f is a bounded real function on [ a , b] and f2€R on [ a , b]. Does it follow that f  R ?

Does the answer change if we assume that f3€R?

15. Suppose  1 and  2 are the curves in the complex plane defined on [0,2  ] by  1(t)= e it ,  2 (t )  e 2it

Show that the two curves have the same range

Also Show that  1 and 2 are rectifiable and find the curve length of  1 and 2

16. Discuss the uniform conversance of the sequence of functions {fn} where

sin nx
fn(x) = x real, n = 1,2,3....
n

17. Give an example of a series of continuous functions whose sum function may be discontinuous.
18. Discuss the uniform conversance of the sequence

1
fn(x)= x  0, n  1,2,3...
1  nx

19. Give an example of a sequence of functions such that

lim f n   lim f n

20. Prove that a sequence {fn} converse to f with respect to the metric of C(x) if and only if fn  f
uniformly on X
 DEPARTMENT OF MATHEMATICS
OSMANIA UNIVERSITY
M.Sc. (Mathematics)

AM – 103 Semester I
Mathematical Methods
Paper- III
Unit I
dy
Existence and Uniqueness of solution of = f(x,y). The method of successive approximation-
dx
Picard’s theorem- Sturm-Liouville’s boundary value problem.
Partial Differential Equations: Origins of first-order PDES-Linear equation of first-order-
Lagrange’s method of solving PDE of Pp+Qq = R – Non-Linear PDE of order one-Charpit
method- Linear PDES with constant coefficients.

Unit II

Partial Differential Equations of order two with variable coefficients- Canonical form
Classification of second order PDE- separation of variable method solving the one-dimensional
Heat equation and Wave equation- Laplace equation.

Unit III

Power Series solution of O.D.E. – Ordinary and Singular points- Series solution about an ordinary
point -Series solution about Singular point-Frobenius Method.
Lagendre Polynomials: Lengendre’s equation and its solution- Lengendre Polynomial and its
properties- Generating function-Orthogonal properties- Recurrance relations- Laplace’s definite
integrals for Pn (x)- Rodrigue’s formula.

Unit-IV
Bessels Functions: Bessel’s equation and its solution- Bessel function of the first kind and its
properties- Recurrence Relations- Generating function- Orthogonality properties.
Hermite Polynomials: Hermite’s equation and its solution- Hermite polynomial and its properties-
Generating function- Alternative expressions (Rodrigue’s formula)- Orthogonality properties-
Recurrence Relations.

Text Books:

[1] “Elements of Partial Differential Equations”, By Ian Sneddon, Mc.Graw-Hill

International Edition.
[2] “Text book of Ordinary Differential Equation”, By S.G.Deo, V. Lakshmi Kantham, V.
Raghavendra, Tata Mc.Graw Hill Pub. Company Ltd.
[3] “Ordinary and Partial Differential Equations”, By M.D. Raisingania,
S. Chand Company Ltd., New Delhi.
 M.Sc.Applied Mathematics
Mathematical Methods
AM 153 Paper III Semester I
Practical Questions

1. Compute the first three successive approximations for the solution of the initialvalue
dx
problem  x 2 , x(0)  1.
dt

2. Solve yp  2 yx  log q.

3. Solve yzp  zxq  xy with usual notations.

4. Explain Strum-Liouille’s boundary value problems.

 2u  2u  2u u u
5. Classify the equation  4  4  2  0.
x 2
xy y 2
x y

6. Solve r  t  2 s  0 with the usual notations.

7. Find the particular integral of the equation ( D 2  D ) Z  e 2 x  y .

8. Solve in series the equation xy"  y '  y  0 .

9. Solve y "  y  x using power series method.

10. Solve the Froenius method x 2 y "  2 x 2 y '  2 y  0 .

11. Solve in series 2 xy"  6 y '  y  0.

12. Prove that J  n ( x)  (1) n J n ( x) where n is an integer.

13. Prove that xJ n' ( x)  nJ n ( x)  xJ n 1 ( x ) .

14. Prove that H n ( x)  (1) n H n ( x).

15. Show that H 2 n 1 (0)  0.

16. Show that (2n  1) xPn ( x)  (n  1) Pn 1 ( x)  nPn 1 ( x ).

u u
17. Solve  ; with u ( x,0)  4e  x using separation of variable method.
x y

18. Find the surface passing through the parabolas Z  0, y 2  4ax and Z  1, y 2  4ax and
satisfying the equation xr  zp  0 .

19. Find the surface satisfying t  6 x 2 y containing two lines y = 0 = z and y = 2 = z .

20. Reduse the equation x 2 r  y 2t  px  qy  x 2 in the canonical form.

 DEPARTMENT OF MATHEMATICS
OSMANIA UNIVERSITY
M.Sc. (Applied Mathematics)
AM 104 Semester I
Mechanics
Paper IV
Unit I

Newton’s Law of Motion: Historical Introduction, Rectilinear Motion:

Uniform Acceleration Under a Constant Force, Forces that Depend on
Position: The Concepts of Kinetic and Potential Energy, Dynamics of systems
of Particles:- Introduction - Centre of Mass and Linear Momentum of a
system- Angular momentum and Kinetic Energy of a system, Mechanics of
Rigid bodies- Planar motion:- Centre of mass of Rigid body-some theorem of
Static equilibrium of a Rigid body- Equilibrium in a uniform gravitational
field.

Unit II

Rotation of a Rigid body about a fixed axis, Moment of Inertia:- calculation of

moment of Inertia Perpendicular and Parallel axis theorem- Physical
pendulum-A general theorem concerning Angular momentum-Laminar
Motion of a Rigid body-Body rolling down an inclined plane (with and
without slipping).

Unit III

Motion of Rigid bodies in three dimension-Angular momentum of Rigid body

products of Inertia, Principles axes-Determination of principles axes-
Rotational Kinetic Energy of Rigid body- Momentum of Inertia of a Rigid
body about an arbitrary axis- The momental ellipsoid - Euler’s equation of
motion of a Rigid body.

Unit IV

Lagrange Mechanics:-Generalized Coordinates-Generalized forces-Lagrange’s

Equations and their applications-Generalized momentum-Ignorable
coordinates-Hamilton’s variational principle-Hamilton function-Hamilton’s
Equations- Problems-Theorems.

Text Book:

[1] G.R.Fowles, Analytical Mechanics, CBS Publishing, 1986.

 M.Sc.(Applied Mathematics)
Mechanics
AM 154 Paper IV Semester I
Practical Questions

1. Discuss the motion of particle sliding down a smooth inclined plane at an

angle θ to the horizontal.
2. Discuss the centre of mass of Solid homogeneous sphere of radius a.
3. Discuss the centre of mass of Hemispherical shell of radius a.
4. Discuss the centre of mass of Quadrant of uniform circular lamina of radius b.
5. Find the centre of mass of area bounded by a parabola y=x2/b and line y=b.
6. Point the moment of inertia of following:
a. Rectangular lamina about a line passing through centre and normal to it,
b. Rectangular parallelepiped,
c. Circular wire and disk,
d. Elliptic disk,
e. Hollow sphere about a diameter, Solid sphere about a diameter.
7. Point the moment of inertia of a hollow sphere about diameter, its external and
internal radii being a and b.
8. Find the moment of inertia of a uniform circular cylinder of length b and
radius a about an axis through the centre and perpendicular to the central axis.
9. A circular hoop of radius a swing as a physical pendulum about a point on the
circumference. Find the period of oscillation for small amplitude if the axis of
rotation is (a) normal to the plane of the hoop and (b) in the plane of the hoop.
10. Find the acceleration of a uniform circular cylinder rolling down an inclined
plane.
11. Find the direction of the principle axis in the plane of rectangular lamina of
sides a and b at a corner.
12. Find the principle moments of inertia of a square plate about a corner.
13. Find the directions of principle axes for the above problem.
14. Find the inertia tensor for a square plate of side l and mass m in a coordinate
system OXYZ where O is at corner and X and Y are along the two edges. Also
find angular momentum and kinetic energy of rotation.
15. A thin uniform rectangular plate is of mass m and dimension 2a x a. Choose
coordinate system OXYZ such that the plate lies in the XY plane with origin
at the corner, the long dimension being along the X axis. Find the following:
a. The moments and products of inertia,
b. The moment of inertia about the diagonal through the origin,
c. The angular momentum about the origin if the plate is spinning with angular
rate w about the diagonal through the origin,
d. The kinetic energy in part c.
16. Derive the governing equation for 1D damped harmonic oscillation.
17. Find the governing equation for single particle in central field.
18. Find the governing equation for a particle sliding on a movable inclined plane.
19. A mass suspended at the end of a light spring having spring constant k is set
into vertical motion. Use the Lagrange equation to find the equation of motion.
20. Find the acceleration of a solid uniform sphere rolling down a perfectly rough
fixed inclined plane.
 DEPARTMENT OF MATHEMATICS
OSMANIA UNIVERSITY
M.Sc. (Applied Mathematics)
AM –201 Semester II
Advanced Algebra

Paper I
Unit I

Algebraic extensions of fields: Irreducible polynomials and Eisenstein criterion-

Adjunction of roots- Algebraic extensions-Algebraically closed fields (Pages 281 to 299)

Unit II

Normal and separable extensions: Splitting fields- Normal extensions- Multiple roots- Finite
fields- Separable extensions (Pages 300 to 321)

Unit III

Galois theory: Automorphism groups and fixed fields- Fundamental theorem of Galois
theory- Fundamental theorem of Algebra (Pages 322 to 339)

Unit-IV

Applications of Galoes theory to classical problems: Roots of unity and cyclotomic

polynomials- Cyclic extensions- Polynomials solvable by radicals- Ruler and Compass
constructions. (Pages 340-364)

Text Books:

[1] Basic Abstract Algebra- S.K. Jain, P.B. Bhattacharya, S.R. Nagpaul.

Reference Book:Topics in AlgrbraByI. N. Herstein

 M.Sc Applied mathematics
Advanced Algebra
AM 251 Paper I Semester II
Practical Questions
1. (i)  p ( x)  1  x  .....  x p 1 is irreducible over Q. Where p is a prime.

(ii) Show that x 3  3x  2 

Z
x  is irreducible over the field Z .
7 7
2. Show that the following polynomials are irreducible over Q
(i) x3  x 1 (ii) x 4  3 x 2  9 (iii) x 4  8
Z
3. Show that there exists an extension of E of with nine elements having all
3

the roots of x 2  x  1 
Z
x 
3
4. (i) Show that there is an extension E of R having all the roots of 1  x 2
(ii) Let f i ( x)  F x  for i= 1, 2, . . . . . . .m then there exists an extension E of
F in which each polynomial has root
5. Show that 2 and 3 are algebraic over Q and find the degree of Q 2 over Q  
 
and Q 3 over Q.
(iii) 
Find a suitable number a such that Q 2 , 5  Q (a ). 
6. Show that the degree of the extension of the splitting field of x 3  2  Q ( x) is 6
7. Let p be a prime then f ( x)  x p  1  Q( x) has a splitting field Q  where   1
and  p  1. Also Q  : Q  p  1
1
8. Show that the splitting field of f x   x 4  2  Qx  over Q is Q (2 4 , i ) and its
degree of extension is 8
9. If the multiplicative group F  of non zero elements of a field F is cyclic then F is
Finite
10. The group of automorphisms of a field F with p n elements is cyclic of order n and
generated by  where  ( x)  x p , x  F
 Q( )
11. The group G ( ) where  5  1 and   1 is isomorphic to the cyclic group of
Q
order 4
12. Let E  Q (3 2 ,  ) where  3  1,   1 let  1 be the identity automorphism of E and
Let  2 be an automorphism of E such that  2 ( )   2 and  2 (3 2 )   (3 2 ). If
G  { 1 ,  2 } then EG  Q(3 2 2 )
13. If f  x   F (x) has r distinct roots in its splitting field E over F then the Galois

group G 
E
 of f (x) is a subgroup of the symmetric group S r .
F
14. The Galois group of x 4  2  Q x  is the octic group.
15. The Galois group of x 4  1  Q( x) is Klein four group

 Z 
16. 8 ( x ) and x  1 have the same Galois group namely    {1, 3, 5, 7}, the Klein’s
8

 8 
four group.
17. If a field F contains a primitive nthroot of unity then the characteristic of F is Zero
or a prime P that does not divide n
18. Show that the following polynomials are not solvable by radicals over Q
(i) x  10 x  15x  5 (ii) x  9 x  3 (iii) x  4 x  2
7 5 5 5

19. It is impossible to construct a cube with a volume equal to twice the volume of
a given cube by using ruler and compass only.

20. A regular n-gon is constructible if and only if  n  is a power of 2. (equivalently the

2
angle is Constructible.)
n
 DEPARTMENT OF MATHEMATICS
OSMANIA UNIVERSITY
M.Sc.(Applied Mathematics)
AM –202 Semeste II Advanced
Analysis
Paper II
Unit I

Algebra of sets- Borel sets- Outer measure- Measurable sets and Lebesgue measure- A
non-measurable set- Measurable functions- Little word’s three principles.

Unit II

The Rieman integral- The Lebesgue integral of a bounded function over a set of finite
measure- The integral of a non-negative function- The general Lebesgue integral.

Unit III

Convergence in measure- Differentiation of a monotone functions- Functions of bounded

variation.

Unit-IV

Differentiation of an integral- Absolute continuity- The Lp-spaces- The Minkowski and

Holder’s inequalities- Convergence and completeness.

Text Books:[1] Real Analysis (3rd Edition)(Chapters 3, 4, 5 )

by

H. L. Royden

Pearson Education (Low Price Edition)

 M.Sc. Applied Mathematics
Advanced Analysis
AM252 Paper II SemesterII
Practical Questions

1. i. Prove that the interval [0,1] is not countable.

∗( ) = 1.
ii. If is the set of all irrational numbers in [0,1]. Prove that
∗( ) = 0. Prove that ∗( ∗
2. i. If ∪ )= ( ).

ii. Prove that if a −algebra of subsets of ℝcontains intervals of the form ( , ∞)then it contains all
intervals.

3. Show that a set is measurable if and only if for each > 0there exists a closed set and an open
set such that ⊆ ⊆ and ∗ ( − ) < .

4. i. Show that if and are measurable then ( ∪ )+ ( ∩ )= ( )+ ( )

ii. Suppose { } is an ascending collection of measurable sets. Prove that

= lim ( )
→

5. Suppose and are any sets. Prove that

i. ∩ =

ii. ∪ = + −

iii. =1−

6. Let have measure zero. Show that if is a bounded function on then is measurable and
∫ = 0.

7. Let { } be a sequence of non negative measurable functions that converge to pointwise on .Let
≥ 0 be such that ∫ ≤ for all . Show that ∫ ≤ .

8. Let be a non negative measurable functions on .

Prove that ∫ = 0if and only if = 0a.e on .

9. Let{ } be a sequence of non negative measurable functions on that converges pointwise on to
.Suppose ≤ on for each ,show that lim → ∫ =∫ .

10. Suppose { } is a sequence of measurable functions on that converges pointwise on a.e. on to .

Suppose there is a sequence { } of non negative measurable functions on that converges

pointwise on a.e. on to and dominates { } on in the sense that | | ≤ on ∀.

If lim → ∫ =∫ prove that lim → ∫ =∫ .

11. Prove that pointwise convergence implies convergence in measure.

12. Construct a sequence of measurable functions which converges in measure but not point wise.

13. Suppose , are functions of bounded variation in [a,b]. Show that + and for any scalar are

also functions of bounded variation on [ , . ]

Also prove that i. ( + )≤ ( )+ ( )

ii. ( )=| | ( )

14. Prove that the greatest integer function is a function of bounded variation on [ , ]

15. Show that continuous and bounded variation of a function are two independent concepts.

16. Show that the sum and difference and product of two absolutely continuous functions are also
absolutely continuous.

17. Let be absolutely continuous on [ , and] be absolutely continuous on [ , with

] ≤ ≤ .
Prove that is absolutely continuous on [ , ]

18. Suppose is absolutely continuous on [ , and

] = { : ( ) = 0}. Prove that ( ) =0

Note. is absolutely continuous on with ( ) = 0 ∀ ∈ implies is constant on E which implies

( ) =0

19. Let be an absolutely continuous monotone function on [0,1] and is a set of measure zero. Prove
that ( h) as measure zero.

20. i. Show that ‖ + ‖ ≤ ‖ ‖ +‖ ‖

ii. If ∈ , ∈ then prove that + ∈ ∈

 DEPARTMENT OF MATHEMATICS
OSMANIA UNIVERSITY
M.Sc.Applied Mathematics

AM203 Semester II Complex Analysis

Paper- III

UNIT-I

Regions in the Complex Plane -Functions of a Complex Variable - Mappings -Mappings by the
Exponential Function- Limits - Limits Involving the Point at Infinity - Continuity -
Derivatives -
Cauchy–Riemann Equations -Sufficient Conditions for Differentiability - Analytic Functions
-
Harmonic Functions -
Uniquely Determined Analytic Functions - Reflection Principle - The
Exponential Function -The Logarithmic Function -Some Identities Involving Logarithms -Complex
Exponents -
Trigonometric Functions -Hyperbolic Functions

UNIT-II

Derivatives of Functions w(t) -
Definite Integrals of Functions w(t) - Contours -Contour Integrals -

Some Examples -Examples with Branch Cuts -
Upper Bounds for Moduli of Contour Integrals –
Anti derivatives -Cauchy–Goursat Theorem -Simply Connected Domains- Multiply Connected
Domains
-Cauchy Integral Formula -An Extension of the Cauchy Integral Formula -Liouville’s
Theorem and the Fundamental Theorem of Algebra -Maximum Modulus Principle

UNIT-III

Convergence of Sequences - Convergence of Series - Taylor Series -Laurent Series -Absolute and
Uniform Convergence of Power Series- Continuity of Sums of Power Series - Integration and
Differentiation of Power Series - Uniqueness of Series Representations-Isolated Singular Points -
Residues -
Cauchy’s Residue Theorem - Residue at Infinity - The Three Types of Isolated
Singular Points - Residues at Poles -
Examples -
Zeros of Analytic Functions -Zeros and Poles -
Behavior of Functions Near Isolated Singular Points

UNIT-IV

Evaluation of Improper Integrals -Improper Integrals from Fourier Analysis - Jordan’s Lemma -
Indented Paths - - Definite Integrals Involving Sines and Cosines - Argument Principle -Rouche ́’s
Theorem -Linear Transformations -The Transformation w = 1/z - Mappings by 1/z -Linear
Fractional Transformations -An Implicit Form -
Mappings of the Upper Half Plane

Text: James Ward Brown, Ruel V Churchill, Complex Variables with applications

M.SC. Applied Mathematics

 Complex Analysis
AM253Semester-II
Paper-III
Practical Questions
1
In each case, determine the singular points of the function and state why the function
is analytic everywhere except at those points:
2z + 1 z3 + i z2 + 1
(a) f (z) = ; (b) f (z) = ; (c) f (z) = .
z(z2 + 1) z2 − 3z + 2 (z + 2)(z2 + 2z + 2)
2
Show that u(x, y) is harmonic in some domain and find a harmonic conjugate v(x, y)
when
(a) u(x, y) = 2x(1 − y); (b) u(x, y) = 2x − x 3 + 3xy 2 ;
(c) u(x, y) = sinh x sin y; (d) u(x, y) = y/ (x 2 + y 2 ).

3
Find all values of z such that
√
(a) ez = − 2; (b) ez = 1 + 3i ; (c) exp(2z − 1) = 1.

4 Ans. (a) z = ln 2 + (2n + 1)πi (n = 0, ± 1, ± 2, . . .);

Let the function f (z) = u(x, y) + i v(x, y) be analytic in some domain D . State why
the functions

U(x, y) = eu(x,y) cos v(x, y), V (x, y) = eu(x,y) sin v(x, y)

are harmonic in D and why V (x, y) is, in fact, a harmonic conjugate of U(x, y).
5
Show that
π ln 2
(a) (1 + i ) i = exp − + 2nπ exp i (n = 0, ± 1, ± 2, . . .);
4 2
(b) (− 1) 1/ π = e(2n+ 1)i (n = 0, ± 1, ± 2, . . .).
6
Let C denote the line segment from z = i to z = 1. By observing that of all the points
on that line segment, the midpoint is the closest to the origin, show that

dz √
≤ 4 2
C z4

without evaluating the integral.

7
Show that if C is the boundary of the triangle with vertices at the points 0, 3i , and − 4,
oriented in the counterclockwise direction (see Fig. 48), then

(ez − z) dz ≤ 60.
C

y
3i

–4 O x FIGURE 48
8
Let C be the unit circle z = ei θ (− π ≤ θ ≤ π). First show that for any real constant a,

eaz
dz = 2πi.
C z

Then write this integral in terms of θ to derive the integration formula

π
ea cos θ cos(a sin θ) dθ = π.
0

9
Find the value of the integral of g(z) around the circle |z − i | = 2 in the positive sense
when
1 1
(a) g(z) = 2 ; (b) g(z) = 2 .
z + 4 (z + 4)2
10
Show that for R sufficiently large, the polynomial P (z) in Theorem 2, Sec. 53, satisfies
the inequality
|P (z)| < 2|an ||z| n whenever |z| ≥ R.
11
Obtain the Maclaurin series representation
∞
z4n+ 1
z cosh(z2 ) = (|z| < ∞ ).
(2n)!
n= 0

12
Obtain the Taylor series
∞
(z − 1) n
ez = e (|z − 1| < ∞ )
n!
n= 0

for the function f (z) = ez by

13
In each case, show that any singular point of the function is a pole. Determine the
order m of each pole, and find the corresponding residue B.
3
z2 + 2 z exp z
(a) ; (b) ; (c) .
z− 1 2z + 1 z2 + π 2
14
Evaluate the integral
cosh πz
dz
C z(z2 + 1)
when C is the circle |z| = 2, described in the positive sense.
15
Show that
z − sinh z i
(a) Res 2 = ;
z= πi z sinh z π
exp(zt) exp(zt)
(b) Res + Res = − 2 cos (πt)
z= πi sinh z z= − πi sinh z

16
Evaluate
∞
cos x dx
(a > b > 0).
−∞ (x 2 + a2 )(x 2 + b2 )
−b −a
17
Derive the integration formula
∞
cos(ax) − cos(bx) π
dx = (b − a) (a ≥ 0, b ≥ 0).
0 x2 2

Then, with the aid of the trigonometric identity 1 − cos(2x) = 2 sin2 x, point out how
it follows that
∞
sin2 x π
dx = .
0 x2 2
18
Evaluate 1 − a
π
cos 2θ dθ
(− 1 < a < 1)
0 1 − 2a cos θ + a2
2
19
Suppose that a function f is analytic inside and on a positively oriented simple closed
contour C and that it has no zeros on C. Show that if f has n zeros zk (k = 1, 2, . . . , n)
inside C, where each zk is of multiplicity mk , then
n
zf ′ (z)
dz = 2πi mk zk .
C f (z)
k= 1
20
Determine the number of zeros, counting multiplicities, of the polynomial
(a) z4 + 3z3 + 6 ; (b) z4 − 2z3 + 9z2 + z − 1; (c) z5 + 3z3 + z2 + 1
inside the circle |z| = 2.
Ans. (a) 3 ; (b) 2 ; (c) 5.
 DEPARTMENT OF MATHEMATICS
OSMANIA UNIVERSITY
M.Sc: (APPLIED MATHEMATICS)
AM-204 SEMESTER-II
FLUID MECHANICS

Paper IV

Unit-I:
General Orthogonal Curvilinear Coordinates: Defination Kinematics of fluids in
motion: Real fluids and ideal fluids – velocity of a fluid at a point – Lagrangian and Eulerian
methods - stream lines, path lines and streak lines – steady and unsteady flows – The velocity
potential – the vorticity vector – Local and particle rates of change – Acceleration of fluid -
The Equation of Continuity (Vector and Cartesian form) – conditions at a rigid boundary.

Unit-II:
Equations of Motion of Fluid: Euler’s equations of motion (Vector and Cartesian form) –
Lagrange's equations of Motion - Equation in one dimensional flow problems: Bernoulli's
Theorem - Applications of the Bernoulli Theorem - Kelvins circulation theorem.
Motion in two dimension: velocity potential – physical meaning of velocity potential.
Stream function - physical meaning of velocity stream function.

Unit-III:
Some Two Dimensional Flows: The complex potential – Irrotational motion – stream
function – Source, Sinks and Doublets and their Images – General theory of Irrotational –
Milne Thomson Circle Theorem – Applications of circle theorem. The Magnus effect – The
Therorem of Blasius.

Unit-IV:
Irrotational Motion in Two Dimensions: Two-dimensional irrotational motion produced by
motion of circular cylinder , two coaxial cylinders. Equations of motion of a circular
cylinder-Ellliptic coordinate - Motion of an Elliptic cylinder – Thoerem of Kutta-Joukowski -
Irrotational Motion in three dimensions: Motion of a sphere through a liquid at rest at
infinity – Liquid streaming past a fixed sphere – Equations of motion of a sphere

Text Books:
1. FRANK CHORLTON, “Textbook of Fluid Dynamics” , CBS-Publishers, New
Delhi, India.
2. W.H.BESANT and A.S.RAMSEY, “A Treatise on Hydro-Mechanics (Part-II)”,
CBS-Publishers, New Delhi, India.
3. S.W.YUAN, “Foundation on Fluid Mechanics”, Prentice-Hall India Ltd. NewDelhi.
4. M.D.RAISINGHANIA, “Fluid Dynamics” S.Chand& Company, New
 M.Sc.(Applied Mathematics)

FLUID MECHANICS

MM 254 Paper IV Semester II

Practical Questions

PRACTICALS:

1. Find Arc length, Gradient and Divergence in Orthogonal coordinates.

2. The Laplacian and Curl operators in Orthogonal Coordinates.
3. The Cylindrical and Spherical coordinates in Orthogonal Coordinates.
4. For two-dimensional flow the velocity components are given in Eulerian system by
u  A( x  y )  Bt and v  C ( x  y )  Dt , where A,B,C and D are constants. Find the
displacement of a fluid particles in the Lagrangian system.
5. Show that tan + cot = 1is a possible form for the bounding surface of a
liquid, and find an expression for the normal velocity.
6. The quantity of liquid occupies a length 2 of a straight tube of uniform small bore
under the action of a force to a point in the tube varying as the distance from that
point. It is required to determine the motion and the pressure.
7. In a region bounded by a fixed quadrantal arc and its radii, deduce the motion due to a
source and an equal sink situated at the ends of one of the bounding radii. Show that
the stream line leaving either end at an angle with the radius is sin( + ) =
sin( − ) .
8. At the point in an incompressible fluid having spherical polar coordinates ( , , ),
the velocity components are [2 cos , sin , 0], where M is constant.
Show that the velocity is of the potential kind. Find the velocity potential and the
equations of the streamlines.
( )
9. Test whether the motion specified by = ( =const.) is a possible motion for
an incompressible fluid. If so, determine the equations of the streamlines. Also test
whether the motion is of the potential kind and if so determine the velocity potential.
10. For an incompressible fluid, = [− , (, 0]=const.). Discuss the nature of the
flow.
11. Bernoulli’s Equation – The Pitot tube.
12. Bernoulli’s Equation – The Venturi tube.
13. Find the equations of the streamlines due to uniform line sources of strength
through the points (− , 0), ( , 0)and a uniform line sink of strength 2 through
the origin.
14. Describe the irrotational motion of an incompressible liquid for which the complex
potential is = log.

Applications of the Circle Theorem:

15. Obtain the complex potential for Image of a line source in a circular cylinder
16. Obtain the complex potential for Uniform flow past a stationary cylinder.
17. A circular cylinder is placed in a uniform stream, find the forces acting on the
cylinder.
18. A source and sink of equal strength are placed at the points (± , 0)within a fixed
circular boundary + = . Show that the streamlines are given by −
( −4 )−4 = ( − ).
19. The space between two infinitely long coaxial of radii a and b (b>a) respectively, is
filled with homogeneous liquid of density  . The inner cylinder is suddenly moved
with velocity U perpendicular to the axis, the outlet one being kept fixed. Show that
the resultant impulsive pressure on a length lof the inner cylinder is
 b2  a2 
a 2l  2 U
2 
b a 
20. A circular cylinder of radius a is moving with velocity U along the axis of x. Show
that the motion produced by the cylinder in a mass of fluid at rest is given by the
a 2U
complex function w 
( z  Ut )