Mahbubur Rahman’s Reviews > Friendly Introduction to Number Theory > Status Update

Divisibility and the Greatest Common Divisor:

Do you know why the Euclidean method works in finding GCD between two numbers? And it is an efficient algorithm to find GCD (Greatest Common Divisor.)

I am made a proof in my notebook after reading this chapter. To be honest I didn't know why this method worked. It's interesting.

Pythagorean Triples and the Unit Circle:
This is amazing, we can find Pythagorean triples from even using a rational number. I didn't know that.

Sums of Higher Powers and Fermat’s Last Theorem:

Try solving this equation, a^4+b^4=c^4
Try to figure out if there any solution of a, b, and where they are non-zero integers. It's true when the exponent is >3... interesting

Pythagorean Triples and the Unit Circle:
This is amazing, we can find pythagorean tripples from even using a rational number. I didn't know that.

Sums of Higher Powers and Fermat’s Last Theorem:

Do you know that this is a nerd thing to crack?
Try solving this equation, a^4+b^4=c^4
Try to figure out if there any solution of a, b anc where they are non-zero intergers. Its true when the exponent is >3... interesting

`Just amazing` that's what I can say after reading only 16 pages. I have not known many interesting theory. For example, Prime Number of 4 modulo 1 is always the sum to two square number; also those exciting relations in Primitive Pythagorean Triple. I am so excited to reveal those beauty page by page. Love it!

I miscalculated the page number yesterday.