74. Problem Solving on Legendre Symbol

Problem Solving on Legendre Symbol
For Complete Course kindly visit the link below;
www.udemy.com/...
In this course we have Covered:,
Modular Arithmetic, Number Theory, Calculation of Modulus value, Solving a≡b(mod m), Commutative and Associative low Calculation of GCD by Euclidean algorithm, Greatest Common divisor, Diophantine equation, Inverse Modulus Calculation, The solution of ax≡b(mod m), Chinese Remainder Theorem, CRT, Modular Exponentiation, Distributive low, Little Fermat’s Theorem, Euler Totient Function, Euler's Theorem, Prime Factor, Prime Number Generation, Quadratic Residue, Legendre Symbol, Jacobi Symbol, Extended Euclidean algorithm, ax+by=c, Relative prime Number, Coprime Number, Φ (n), phi of n, Eratosthenes algorithm, Quadratic Residue, Solved Problems, Solved examples

[@SandeepKaur-kr1ps]

Thanku so much sir ji

[@KPfVy2ma]

11:46 1272 mod 43 =25 not mod 13 am I wrong ?

[@anshumanpal8078]

Awasome man

[@STORY_TELLER6]

Thanks

[@mathematicsbylokesh5302]

Very good sir ma tho bahut badiya smajaya apane

[@pankajprasar]

Legendare symbol (-461/383)

[@tanjinaaktar1146]

Best

[@R.B.GllR.B.G]

(mod13) is it right??(question Xll)

[@rameshbarata5124]

No

[@crossugo5738]

Good explanation, Vidya 👍

[@vanitanehe1477]

(37/101) solve kijiye na sir

[@Sanchita158]

mod13 kotha theke holo😢

[@mr.perfect9544]

Thank you