Lagrange's Theorem (Number of Solutions of a Polynomial Congruence)

preview_player
Показать описание
In this video, Lagrange's Theorem proof in context of congruences is given. The Theorem states a polynomial of degree n has almost n incongruent solution modulo p, p-prime.
Рекомендации по теме
Комментарии
Автор

MIND IT

Plz make video on gauss theorem

PrabhjotKaur-jket
Автор

Mam it's my humble request to you that please tell us about logic part of the theorem that what is the logic to prrof this theorem before starting to prove. because, in this way we will be able to develop logical ability to prove any theorem otherwise it looks like craming😢

AnkitKumar-crqs
Автор

3:57 what is need of writing r specifically?

Rsingh
Автор

X^phi(n) ≈ 1 (modn) has phi(p-1) possible nunbers for which p-1 can be order phi(n) but here it says p-1 numbers are solutions.can someone tell where i went wrong ?

revanthkalavala
Автор

nice explanations, although i still trying to grasp the Wilson's theorem.

AsBi
Автор

Madam method for solving polynomial congruences of degree 2 or more

sajidmunir
Автор

Ma'am please Lagrange ka converse b kar wa dain pleas

a-zhumblechannel