Linear Congruence in Number Theory Lecture 25

congruence
a congruence b modulo n
find the remainder with the help of congruence
| number theory |
#numbertheory
#congruency
number theory,
greatest common divisor,
g c.d.,
|number theory | Euclid algorithm | #numbertheory

examples of greatest common divisor ,
greatest common divisor in hindi,
greatest common divisor Euclidean algorithm,

I hope you are very happy to watch my YouTube channel. You are also get more videos of analysis branch. Please subscribe my YouTube channel and press the Bell button for more videos.

number theory,

number theory,
division algorithm,
diophantine equation,
solution of diophantine equations,
euclidean algorithm,
common divisor,
definition of greatest common divisor,
relatively prime numbers,
Euclid's Lemma,
common multiple,
number theory,
least common multiple,
solution of linear diophantine equations,
prime numbers and their distributions,
fundamental theorem of arithmetic,
twin primes,
Euclid's theorem,
mersenne number,
perfect square,
congruence of numbers,
Euclidean numbers,
Bertrand's conjecture,
Goldbachcs conjecture,
Dirichelts theorem,
number theory,
congruence is an equivalence relation,
congruence,
theorems of congruence,
residue modulo m,
set of residue,
complete residue system,
reduced residue system,
chinese remainder theorem,
number theory,
Number theory,
congruent and incongruent solution,
linear congruence,
polynomial congruence,
Lagrange's theorem,
fermat's theorem,
Wilson theorem,
converse of Wilson theorem,
Pseudo prime,
bsc maths,
bsc mathematics,
msc maths,
higher mathematics,
mathematics,
post graduation maths,
best class of maths,
graduation maths,
b tech maths,
bscmaths,
Bsc Maths,
Ajay,
Ajay Kushwaha,
maths modulo,
Euler's function and Euler's theorem,
properties of phi function,
arithmetic function,
csir net,
upsc math,