PERFECT, AMICABLE, AND FIBONACCI NUMBERS: THEORETICAL FOUNDATIONS AND PRACTICAL SIGNIFICANCE

Authors

  • Salamat Tajimuratovich Seytmuratov

    Nukus State Pedagogical Institute named after Ajiniyaz image/svg+xml

Keywords: number theory, perfect numbers, identity numbers, Fibonacci numbers, Euclid-Eyler theorem, Mersen prime numbers, algorithm, recursive sequence

Abstract

The article analyzes the mathematical definitions, basic properties, historical development, and significance in modern science and technology of perfect numbers, inhomogeneous numbers, and Fibonacci numbers, which are important concepts in number theory. The Euclidean-Euler theorem for obtaining perfect numbers, the interdependence of consistent numbers, and the recursive properties of the Fibonacci sequence are highlighted based on examples. Attention is also paid to the applications of these numbers in cryptography, the theory of algorithms, informatics, and nature.

References

1. Abduraxmonov A., Narmonov A., Narmuratov N. Matematika tarixi. – Toshkent: «Fan va texnologiya», 2016.

2. Чистяков В.Д. Старинные задачи по элементарной математике. – Минск: «Высшая школа», 1978.

3. Rosen K.H. Elementary Number Theory and Its Applications. 6th ed. – Pearson, 2011.

4. Euclid. Elements. Book VII–IX. – New York: Dover Publications, 1956.