2014
DOI: 10.19026/rjms.6.5271
|View full text |Cite
|
Sign up to set email alerts
|

On Some Algebraic Properties of the Euclidean Algorithm with Applications to Real Life

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 4 publications
0
1
0
Order By: Relevance
“…The Chinese remainder theorem is widely used for computing with large integers, as it allows replacing a computation for which one knows a bound on the size of the result by several similar computations on small integers. According to Alhassan et al [4], one of the most useful results of number theory is the Chinese Remainder Theorem. In essence, the CRT says it is possible to reconstruct integers in a certain range from their residues modulo a set of pairwise relatively prime moduli.…”
Section: Introductionmentioning
confidence: 99%
“…The Chinese remainder theorem is widely used for computing with large integers, as it allows replacing a computation for which one knows a bound on the size of the result by several similar computations on small integers. According to Alhassan et al [4], one of the most useful results of number theory is the Chinese Remainder Theorem. In essence, the CRT says it is possible to reconstruct integers in a certain range from their residues modulo a set of pairwise relatively prime moduli.…”
Section: Introductionmentioning
confidence: 99%