This article examines several methods for determining the Least Common Multiple (LCM) and Greatest Common Divisor (GCD) among natural numbers. The essence of each method, their application steps, as well as their advantages and disadvantages, are analyzed. Special attention is given to the Euclidean algorithm, the method through divisors, and the factorization method. Theoretical knowledge is reinforced through relevant examples, and recommendations that serve to develop students' mathematical thinking are provided.
Methods of Finding the LCM and GCD of Numbers
DOI:
Keywords:
LCM
GCD
mathematical algorithm
Abstract
Downloads
Download data is not yet available.
References
B.S. Abdullayeva, A.V. Sadikova, N.A. Khamedova, N.M. Mukhitdinova, M.I. Toshpulatova. Theory of the Course of Elementary Mathematics. “Tafakkur Bostoni” Publishing House, Tashkent, 2018 – 496 pages.
Qurbonov R., Qosimova G. (2021). Operations on Numbers and Their Properties. — Tashkent: TDPU Publishing House.
To‘xtasinov A. R. (2018). Introduction to Mathematical Analysis. — Tashkent: “Science and Technologies” Publishing House.
Yusupov B. B. (2015). Fundamentals of Discrete Mathematics. — Tashkent: Publishing House of the National University of Uzbekistan.
Ministry of Higher and Secondary Specialized Education of the Republic of Uzbekistan. (2019). Mathematics: Textbook (for undergraduate level). — Tashkent.
Qurbonov R., Qosimova G. Methodology of Teaching Mathematics in Primary Education. — Tashkent: TDPU Publishing House, 2021.
Hardy G. H., Wright E. M. An Introduction to the Theory of Numbers. — Oxford University Press, 2008.
Internet sources: