Posts Tagged ‘b610’

The Paper Menagerie – Wikipedia

November 21, 2024

https://en.wikipedia.org/wiki/The_Paper_Menagerie

The Ultimate Guide to Simplifying Fractions with the Ladder Method – Hooty’s Homeroom

September 15, 2024

The Ultimate Guide to Simplifying Fractions with the Ladder Method – Hooty’s Homeroom

https://hootyshomeroom.com/simplifying-fractions-using-the-ladder-method/

How Four Powerful Rulers Decided the Fate of a Continent – The New York Times

September 3, 2024

https://www.nytimes.com/2017/05/05/books/review/four-princes-henry-viii-francis-i-charles-v-suleiman-john-julius-norwich.html

HarvardX: CS50’s Introduction to Programming with Python | edX

August 17, 2024

https://www.edx.org/learn/python/harvard-university-cs50-s-introduction-to-programming-with-python

Understanding Relative Humidity and Dew Point | Renesas

March 3, 2024

https://www.renesas.com/us/en/blogs/understanding-relative-humidity-and-dew-point

Desmos | Graphing Calculator

February 26, 2024

https://www.desmos.com/calculator

Euler’s totient function (video) | Khan Academy

January 28, 2024

https://www.khanacademy.org/computing/computer-science/cryptography/modern-crypt/v/euler-s-totient-function-phi-function
Also, Euler phi function

Euler’s Totient Function and Euler’s Theorem

January 28, 2024

https://www.doc.ic.ac.uk/~mrh/330tutor/ch05s02.html

A generalization of Fermat’s little theorem: International Journal of Mathematical Education in Science and Technology: Vol 31, No 3

January 24, 2024

https://www.tandfonline.com/doi/abs/10.1080/00207390050032351#:~:text=Euler%20generalized%20Fermat’s%20Theorem%20in,modn)is%20not%20always%20valid.

Euler generalized Fermat’s Theorem in the following way: if gcd (x,n) = 1 then xφ(n) ≡ 1(modn), where φ is the Euler phi-function. It is clear that Euler’s result cannot be extended to all integers x in the same way Fermat’s Theorem can; that is, the congruence xφ(n)+1 ≡ x(modn)is not always valid.

3.8 The Euler Phi Function

January 24, 2024

https://www.whitman.edu/mathematics/higher_math_online/section03.08.html

If 𝑝� is a prime and 𝑎� is a positive integer, then
𝜙(𝑝^𝑎)=𝑝^𝑎−𝑝^(𝑎−1)