Chinese Remainder Theorem In Hindi
The Chinese Remainder Theorem is a result in number theory that deals with the solution of a system of simultaneous congruences. It states that given a certain number of congruences with pairwise coprime moduli, there exists a unique solution to the system that satisfies all the congruences. The theorem has a wide range of applications, particularly in cryptography and computer science.
#chineseremaindertheorem
#chineseremaindertheoreminhindi
Пікірлер: 21
nicely explained ..........keep it up🙌
Really nice video sir💯✌
After watching many videos, I have understood this video very well, thank you so much sir. ❤❤❤❤❤❤
Easy to understand 😊 thanks for making it simple
@livemathematica
Жыл бұрын
Happy to help
Mind ich blowing explanation ❤thank you sir berry much😊
Amazing 👌
🔥🔥🔥🔥🔥🔥
🔥🔥🔥🔥
Sahi hai 💯🙏
Sooo good sir❤
Excellent explanation sir❤❤
Nice
Thank you Sir..
Can't understand last step how to get that 23 value
🛐🛐🔥
Please sir primitive root 17 ki theorem bta do
❤from🇵🇰
Last mai 23 kaise aaya ?
@Urvashiiy
Ай бұрын
simply, 233 ko divide kr do 105 se
Isse ghatiya kuch nai 😮