Computer Science, asked by blollglokl, 2 months ago

GCD defined as the Greatest Common Divisor between two numbers is calculated by

the continued division method. (i.e., Divide the larger number by the smaller, the

remainder then divides the previous divisor. The process is repeated till the remainder is

zero. The last divisor gives the GCD). Write a program to input two numbers and display

the Greatest Common Divisor by using scanner class.

Sample Input: Enter two numbers

45 85

Sample Output: GCD of two numbers is. ​

Answers

Answered by vijay000893
1

Answer:

ulrsirsruksruksursdaykykraryakryakykeayaekuea

Answered by jatinder586
1

Answer:

In the fig. if LM II CB and LN II CD, prove that

AM

MB

=

AN

ND

Similar questions