Wednesday, January 23, 2019

Real Number


Division of integers is an early math problem,
We can solve it by Euclid division algorithm.

Euclid division algorithm computes highest common factor,
In this we apply Euclid division lemma till we get no remainder.

Factorization of integer remain a challenge for mathematicians,
A composite number has always a unique factorization.

Fundamental Theorem of Arithmetic is crucial for integers,
In Euclid's Elements, it was recorded earlier.

Prime factorization is useful to find LCM and HCF ,
HCF times LCM of two numbers is the product of numbers themselves.

Locating irrationals on number line show beautiful geometry,
For a prime p, It is interesting to prove square root p irrationality.

Irrational numbers characterize by its decimal expansion,
Decimal expansion of rational terminates or non-terminating repetition.

Cantor worked on the enumeration of real and rational numbers,
Combinatorics has so many reward-able conjectures.







  • This poem is published in proceeding of  MTA (I) Inaugural Conference, HBCSE, TIFR, Mumbai, 2019
  • No comments:

    Post a Comment

    HappyPiDay

    --Please write a huge post. -- π