Status Updates From A Friendly Introduction to ...
A Friendly Introduction to Number Theory by
Status Updates Showing 1-30 of 51
Michael Wiedner
is on page 11 of 448
Question 1.1? WRONG.
Me? STUPID.
I at least got the other 2 questions correct, even though I remembered the answers from when I first did them in class. 🙎♀️
— Sep 14, 2026 06:50AM
Add a comment
Me? STUPID.
I at least got the other 2 questions correct, even though I remembered the answers from when I first did them in class. 🙎♀️
Michael Wiedner
is on page 10 of 448
Question 1.1 is severely humbling me. 3 metro rides have been spent noodling.
The question is asking to find triangle numbers that are also squares. I'm taking a geometric approach that I can hopefully back into formal logic
— Sep 10, 2026 11:19AM
Add a comment
The question is asking to find triangle numbers that are also squares. I'm taking a geometric approach that I can hopefully back into formal logic
Michael Wiedner
is on page 10 of 448
I'M DOING IT. I'm determined to prove my brain isn't permanently cooked by AI and I am still capable of big boy maf 💪 🤓
— Sep 01, 2026 04:02PM
1 comment
Mahbubur Rahman
is on page 36 of 264
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 have made a proof in my notebook after reading this chapter. To be honest I didn't know why this method worked. It's interesting.
— Mar 27, 2022 09:14AM
Add a comment
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 have made a proof in my notebook after reading this chapter. To be honest I didn't know why this method worked. It's interesting.
Mahbubur Rahman
is on page 36 of 264
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.
— Mar 27, 2022 09:13AM
Add a comment
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.
Mahbubur Rahman
is on page 28 of 264
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
— Mar 27, 2022 07:13AM
Add a comment
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
Mahbubur Rahman
is on page 28 of 264
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
— Mar 27, 2022 07:11AM
Add a comment
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
Mahbubur Rahman
is on page 16 of 264
`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!
— Mar 17, 2022 12:46PM
Add a comment
Mahbubur Rahman
is on page 2 of 264
I miscalculated the page number yesterday.
— Mar 17, 2022 09:31AM
Add a comment











