Python Tutorials - Program To Find out the GCD of Two Positive Numbers

[@smestartup8561]

Thanks you for your clear step-by-step explanation on Euclidean algorithm using small case, 64 & 48. I could understand "why 'a' should be returned " clearly and the recursive function a little bit more. I have subscribed!! I hope you and your beloved ones staying healthy and happy.

[@AmulsAcademy]

Thank you so much :) Stay happy Stay Healthy :)

[@kwekoweprince5077]

You are AMAZING!!! You explained it perfectly!!!!! I subscribed

[@AmulsAcademy]

Thank you :)

[@mamagrace6208]

subscribed as well.

[@debojitmandal8670]

@@AmulsAcademy mam I don't understand the explanation bcs when you used return why only a is getting printed i.e only if condition is getting printed and not the else condition

[@rorydaines3176]

@@AmulsAcademy You are seriously amazing, thank you for this.

[@kacpermokrzycki2144]

as a curiosity you can also write def GCD(a,b): return a if b==0 else GCD(b,a%b) if anyone is obsessed with shortcode :))

[@AmulsAcademy]

True :)

[@kellymirandalobo9353]

i really like the way you explain coding!! so clear and to the point! really thanks for the vid!

[@infinitygaming7192]

Easy method Def(num1,num2) Lis = [] For i in range (1,num1): If num1 % i ==0 and num2 % i ==0: Lis.append(i) Return lis[-1]

[@YouHaveToLoveMe]

zero division error

[@tlbb1216]

Your channel is fantastic! There's no word to describe my gratitude to you

[@AmulsAcademy]

Thank you :)

[@thetech685]

very good videos. i am a beginner coder and your tutorials really helped me out!!

[@AmulsAcademy]

Glad to hear that 😊

[@gonitbuzz]

Amazing tutorial. Take love from Bangladesh 🇧🇩

[@AmulsAcademy]

Thank you 😊

[@abductingfear1098]

Wow that was me who completed 1k likes on this video Btw you deserve much more than that. Really loved it ❤

[@AmulsAcademy]

Thank you so much :)

[@subhashpurushothaman3831]

Wow...what's that...Your voice is so cute...Of course you explained it perfectly...your voice added more flavor to your explanation skill.......

[@AmulsAcademy]

Thank you :)

[@maelonheplorn8893]

ngl this comment is creepy as hell

[@jaguargaming1410]

I understood it very well, every step was explained in detailed manner .

[@TheMasterswordish]

Thanks Amul, this helped me enormously.

[@AmulsAcademy]

Glad to hear that!

[@balambhavanisankar1924]

I just addicted to ur voice

[@AmulsAcademy]

Thank you :)

[@KamalSanjay-]

There is no words to describe ur explanation, u r excellent sister☺️

[@saurabhsinghdhami1166]

Amazing explanation!!!! And beautiful voice:)

[@AmulsAcademy]

Thank you :)

[@jathebest2835]

That was a great explanation..👏 Thank you from Korea!

[@NeerajSingh-hu9ut]

Thanks for the simple and pre-concept explanation. Thanks again !

[@pavithraraji7175]

The way you explained is awesome 🤩🙌

[@AmulsAcademy]

Thank you so much 😀

[@singisbling2500]

Great😊 explanation ❤ for your lovely voice 🤗🙏

[@AmulsAcademy]

Thanks a lot 😊

[@adityan5302]

Hat's-Off Ma'am, Amazing!! Will remember for life time

[@TheDominock]

I had a terrible stop at this point. Thank you very much.

[@AmulsAcademy]

Welcome :)

[@SubhaShini-zd2wt]

Guys a simple program which you can try for GCD a=int(input ("enter greater no")) b=int(input ("enter smaller no")) while r>0: r=a%b a=b b=r print (a)

[@niloyrahman3344]

great...greater...greatest....programmer...I have ever seen ..take love from me.

[@AmulsAcademy]

Thank you :)

[@anthonyfes]

Great explanation Mam!

[@AmulsAcademy]

Thank you 😊

[@bikramjitmondal8239]

You got a new subscriber. Great explanation

[@AmulsAcademy]

Thank you :)

[@happydudhe383]

It is a best channel to learn python 🥰

[@pectenmaximus231]

Absolutely amazing explanation. So clear. Thanks very much.

[@AmulsAcademy]

Glad it was helpful!

[@ArunKumar-il7hv]

Thanks mam your explanation was top notch

[@gokceozkonuk9300]

Thank you very much again for your detailed explaination!

[@AmulsAcademy]

Pleasure ❤️

[@marutikalyan6366]

Perfect explanation I subscribed ❤️

[@AmulsAcademy]

Thank you 😊

[@youarethecssformyhtml]

The easiest method is to divide the greatest number by the second one and then divide the greatest number by numerator of the result. Don't ask me how but it actually works and so efficient 😀

[@kanishkakaushik1868]

Thanks amulya .

[@AmulsAcademy]

Pleasure :)

[@C.J.JOSEPH]

Ur video contained so much explanation thank u 😘💕

[@AmulsAcademy]

Thank you :)

[@deadpool4422]

Ma'am when i wrote >>> math.gcd(64,48) , you tell it will come 16 but in mines it is 1, can you tell the problem???

[@vikashvinod3936]

Mam , how did it run multiple times in function call?

[@haritika96]

Ma'am mine method for calculating GCD/HCF is correct or not ? Num1 = int(input("Enter the first number : ")) Num2 = int(input("Enter the second number : ")) factors = [] for fact in range(Num1,0,-1): if Num1 % fact == 0 and Num2 % fact == 0: factors.append(fact) print("HCF of ",Num1,"and",Num2,"is : {}".format(max(factors)))

[@AmulsAcademy]

Yes it will work :) But you didn't check for the smallest input,. when you enter the first value as bigger value, for loop will execute more times than required . The H.C.F can only be less than or equal to the smallest number, so no need to check till bigger number. :)

[@Akash-lp1kc]

Nice work..

[@AmulsAcademy]

Thank you :)

[@p.lakshmisairam7220]

ur explanation before writing code is awesome ....is there any paid course of yours i would like to join ...thank you madam

[@dharshinimagesh9591]

mam ,pl explain this hi mam , i understand this program but according to the if "loop" it should get the values " 2,3 or 4" as GCD coz it divides 48,36 equally how it gets 12 as GCD . n1 = 48 n2 = 36 #find smaller if(n1>n2): smaller = n2 else: smaller = n1 #getting hcf i = 1 while(i

[@AmulsAcademy]

greatest common divisor of 48 and 36 is 12. common divisor of 48 and 36 is 1 2 3 4 6 12 In this greatest is 12 so GCD is 12. In the program while loop will run until i

[@dharshinimagesh9591]

@@AmulsAcademy oh ok . i got it now 😃. thank u very much mam .

[@pradumnyarokade9935]

Ma'am how 2 find Gcd of big no. As like 3997 & 2947

[@AmulsAcademy]

I think you are asking manually how to find out the gcd of bigger numbers. There are some mathematical shortcuts you need search that, you can google it. :)

[@satyamsinha1559]

Uff.. tmhara voice ♥️👌 ..nice explanation though.. very helpful

[@AmulsAcademy]

Thanks a lot 😊

[@sahukarisidhivinayaka2093]

Mam in first case i.e 4%18 you got 4. Can you please explain how did you get that?

[@somyachawla5422]

What if we remove return statement from ComputeGCD

[@AmulsAcademy]

Try :)

[@zeeshanhussain7213]

Ma'am, You're awesome, Thanks for the video...

[@AmulsAcademy]

My pleasure 😊

[@zeeshanhussain7213]

Amulya's Academy 🥰😘

[@digiviewacademy6389]

Graet Video.very simple and clear expanation thank you very much

[@thuantranvan3164]

If a and b are complex numbers, how can I find gcd. Please help me

[@vinuk540]

nice and clear explanation,thank you

[@AmulsAcademy]

Thank you :)

[@jyoti3427]

Mam thankyou so much for your nice explanation 🙏

[@moments_with_frds]

Good explanation 👍👍

[@ambadaschankhore2714]

it's fantastic way to define exact mean of math & Programming concepts ....Really Good for your knowledge & teaching terms.

[@AmulsAcademy]

Thank you :)

[@hashikooshing7411]

simply amazing individual.....

[@AmulsAcademy]

Thank you :)

[@linkmageful]

is this the recursive form?

[@AmulsAcademy]

Yes:)

[@komaljaswani7497]

Hi! Can you please make a video on the question: If a list in python has mix of strings & numbers, how will you make separate lists of strings & numbers? I saw ord() for getting ASCII code in python & chr() for converting ASCII codes to characters somewhere & tried to use them to get answer of this question but it did not work!! :(

[@HarshitaChattopadhyay]

Mam can u pls do LCM of 2 numbers programs pls...

[@vijayjakune7409]

NICE VOICE GREAT EXPLAINATION KEEP IT UP :)

[@AmulsAcademy]

Thank you :)

[@C.J.JOSEPH]

And what is the algorithm for this gcd program, can u please tell me.

[@AmulsAcademy]

Euclid's algorithm :)

[@HieuNguyen-zj5so]

Great explain ... Thank you so much

[@AmulsAcademy]

You are welcome! : )

[@latestupdates6836]

super explained in very simpleway

[@manikandand2541]

mam do u have any udemy course ....if soo plz share the link.....

[@AmulsAcademy]

No :)

[@manikandand2541]

@@AmulsAcademy hoo its ok

[@SatendraYadav-cs1yh]

Excellent explain

[@AmulsAcademy]

Glad it was helpful!

[@saqulainkhan6717]

Really great.Thank you🙏🙏

[@AmulsAcademy]

Pleasure 😊

[@mamagrace6208]

Thanks for explaining it so cleary

[@AmulsAcademy]

You're welcome! :)

[@csathishsagar516]

Sister mi voice tone👌 and good explanation

[@charangummadi6863]

❤️👍👍 well explanation

[@AmulsAcademy]

Thank you 😊❤️

[@shotokproductions9162]

Hi Amulya how to develop logics like this and did each program logic needs base and recursive cases

[@linkmageful]

is that the recursive code?

[@AmulsAcademy]

No you can write program without recursion also(iterative approach). But for some problems using recursion is best choice because of its simplicity. There are many articles on "how to think recursively in python". You can refer that. :)

[@AmulsAcademy]

Yes:) @linkmageful

[@shotokproductions9162]

will it possible to have all your code in mail?

[@astrovishwalingam7299]

Your voice is so cute thanks for you

[@praneethaluru2601]

list1=[] list2=[] for i in range(2,n1): if n1%i==0: print(i, end=',') list1.append(i) print(" ") for j in range(2,n2): if n2%j==0: print(j, end=',') list2.append(j) list3=[] for i in list1: for j in list2: if i==j: list3.append(i) print("HCF is",max(list3)) Is this ok?

[@KandhaMaaran-10]

Thankyou so much mam.......

[@AmulsAcademy]

Pleasure :)

[@gangabhavanisayana8600]

Output showing ComputeGCd not defined

[@reshmik4619]

Thank you so much mam🤗😁

[@AmulsAcademy]

Most welcome 😊

[@amalraj4667]

I need help Mam. I want the code for LCM

[@AmulsAcademy]

I will make a video on that soon :)

[@dianacampbell6336]

@@AmulsAcademy Hi, we are still waiting :)

[@veeraregalla2460]

Explain how to read values seperated by comma

[@hiteshchaudhari8698]

You are awesome mam

[@AmulsAcademy]

Thank you 😊

[@mdfarhan0203]

def gcd_function(a,b): big=max(a,b) small=min(a,b) # print(big) # print(small) reminder=big%small while reminder!=0: big=small small=reminder reminder=big%small print(small) number=10 number1=20 print(gcd_function(number,number1))

[@jd9452]

WOW, you are so good, Thank You so much for your help.

[@MDSHAHABUDDIN-ep4rc]

Thanks a lot mam!!

[@AmulsAcademy]

Pleasure 😊

[@streetnoober4011]

Crystal clear....🔮

[@sajankumar-ly1tm]

you are explain perfect ...!!!!!!

[@AmulsAcademy]

Thank you :)

[@fardoushemal2622]

I need your video about LCM

[@AmulsAcademy]

Noted :)

[@ramithap3710]

import math a = math.lcm(n1,n2) print(a)

[@srikanthchittampally3398]

How the program runs without using loop

[@manoj7207]

Thankyou so much

[@AmulsAcademy]

Pleasure :)

[@eswarisangeetha3730]

Give a detail information about merge sort sister

[@AmulsAcademy]

Sure:)

[@eswarisangeetha3730]

Thq sis

[@hrithikaraju]

Great, thanks😇

[@AmulsAcademy]

You're welcome 😊

[@kskbasha551]

Greatest common divisor in the sense greatest common factor right ?

[@ramkuncha3380]

if I take 3 values . it will execute or not.your explanation is super. sister I will give input in string and I want output into numbers .you will execute this programme

[@pradeepchauhan9184]

Good teaching....

[@AmulsAcademy]

for three values you need to use reduce, import functools def gcd(a,b): if(b==0): return a else: return gcd(b,a%b) a=int(input("Enter first number:")) b=int(input("Enter second number:")) c=int(input(":")) GCD=functools.reduce(gcd,(a,b,c)) print("GCD is: ") print(GCD) :)

[@AmulsAcademy]

Thank you:)

[@jaseerhussain2977]

good mam and example more porgramm

[@AmulsAcademy]

Thank you :)

[@ambujkhanduri5672]

How to make a program to find the LCM And how to make a program to find the second lowest numbers from given n numbers.

[@SumitKumar-ti4yf]

Why it is not necessary to mention a>b....How a%b works in this program even when a

[@AmulsAcademy]

when i take a= 4 b = 18 then here we can see a here we can see value is interchanged. first value becomes 18 and second value becomes 4, then it will execute the function. so no need to check whether a is greater then b or not :)

[@srisrisridher3597]

Super mam ❤️

[@AarthifTechBuild]

Hello Amulus,Thank You for the video you did on GCD I will always recommend you to my friend for your wonderful teaching And amulus just a small request apart from the GCD programme you did can u also do a video on Conversion from Hexadecimal to decimal it's a bottom hearted request pls do it for me

[@AmulsAcademy]

Sure:)

[@AarthifTechBuild]

Amuls Academy Amulus when can u do this video for me

[@AmulsAcademy]

Next week:)

[@WeShallOvercome]

thanks

[@AmulsAcademy]

Welcome :)

[@sahithibhimavarapu5103]

We didn't get output for this program

[@karanpreetsinghsekhon8076]

Great but I have do this with list so how I do that

[@davlatbekkobiljonov911]

Thank you!!

[@kvnagendra5354]

*I don't know ur name but tq yaar 💝💝*

[@AmulsAcademy]

Pleasure :) My name is Amulya.

[@pradumnyarokade9935]

Ma'am Is there another method to find 'x'

[@turjobormon8698]

Yes. You can use for or while loop.

[@collinsnwanze8502]

Thank you

[@infinitygaming7192]

I have a easy method we can do like this we put statemnt if num1%i ==0 and num2%i ==0 Then we will set range to (0,smallernum) And add this to a new list and last number will always be largest number so we will return lis[-1]

[@roddaganesh1729]

def gcd(n,m): if m==0: return n elif n==0: return m else: return(gcd(m,n%m)) n=int(input()) m=int(input()) k=gcd(n,m) print(k) i think this is the correct code

[@264bakshay9]

Challa bagundhi

[@AmulsAcademy]

Thank you 😊