Find the gcd(252,595) and then find values of 'x & 'y' if, gcd(252,595) = 252x+595y.

preview_player
Показать описание
Number throry.
Greatest common divisor.
How to find g.c.d. of two integers?
What is g.c.d.?
Euclidian algorithm.
Division algorithm.

welcom to my you tube channel🙏

----------------------------------------------------------------------------

Division Algorithm :

Euclidian Algorithm :

How to find g.c.d. of two integers :

Keep supporting 🙏☺
Комментарии
Автор

Youtube pe etani videos dekhi but ye dekh ke samaj aaya😊

yogeshpathe
Автор

Tq so much mam
Mai bahut dino se aisi example dhund rhi thi

reenu
Автор

Bhout dout hai teacher you explain me this chapter ☺️☺️☺️🙏🙏

_ALLROUNDER_
Автор

Thank you so much ma'am please or video post kariye

KhusbuSharma-jjwq
Автор

nice video but any person watching on pc or laptop he could not see properly he\she rotate is neck to see the proper video

harshpal-drhp
Автор

Hamari University ka Teacher bhi samjhatea nahi hea

JagabandhuDas-ei
Автор

very complicated and i understood nothing.

michaelempeigne
Автор

Mam u save many Hours 😊😊😊😊😊😊😊😊😊😊😊😊😊😊😊😊😊😊😊😊😊😊😊😊😊😊😊

mrrobot
Автор

pahele camera thik se pakarna sikiye uske bad video banaiye

DuttaRajdeep
Автор

Thank u so much after searching for hours got one good video 🤍

shakthipriya