Home > College Algebra calculators > Euclid's Algorithm example

3. Euclid's Algorithm example ( Enter your problem )
  1. Examples
Other related methods
  1. Chinese Remainder Theorem
  2. Extended Euclidean Algorithm
  3. Euclid's Algorithm
  4. Modular multiplicative inverse
  5. Modulo
  6. Fast modular exponentiation

2. Extended Euclidean Algorithm
(Previous method)
4. Modular multiplicative inverse
(Next method)

1. Examples





1. Euclid's Algorithm for `35` and `20`

Solution:
Find HCF of 35,20

  
1
  
20|
35
 |
20
 
1
 |
 
 |
15
|
20
|
15
 
3
|
 
|
5
|
15
|
15
|
|
0


`:.` HCF of `35,20 = 5`


2. Euclid's Algorithm for `45` and `36`

Solution:
Find HCF of 45,36

  
1
  
36|
45
 |
36
 
4
 |
 
 |
9
|
36
|
36
|
|
0


`:.` HCF of `45,36 = 9`


3. Euclid's Algorithm for `60` and `36`

Solution:
Find HCF of 60,36

  
1
  
36|
60
 |
36
 
1
 |
 
 |
24
|
36
|
24
 
2
|
 
|
12
|
24
|
24
|
|
0


`:.` HCF of `60,36 = 12`


This material is intended as a summary. Use your textbook for detail explanation.
Any bug, improvement, feedback then Submit Here



2. Extended Euclidean Algorithm
(Previous method)
4. Modular multiplicative inverse
(Next method)





Share this solution or page with your friends.


 
Copyright © 2023. All rights reserved. Terms, Privacy
 
 

.