#### Filter Results:

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

In this article we formalize some number theoretical algorithms , Euclidean Algorithm and Extended Euclidean Algorithm [9]. Besides the a gcd b, Extended Euclidean Algorithm can calculate a pair of two integers (x, y) that holds ax + by = a gcd b. In addition, we formalize an algorithm that can compute a solution of the Chinese remainder theorem by using… (More)

- ‹
- 1
- ›