I How to motivate the study of Fermat's Little Theorem

matqkks
Messages
280
Reaction score
5
What is the best way to introduce Fermat’s Little Theorem (FLT) to students?

What can I use as an opening paragraph which will motivate and have an impact on why students should learn this theorem and what are the applications of FLT? Are there any good resources on this topic?
 
Mathematics news on Phys.org
Who are the students and what do they study? This term is not very specific in American English.
 
First year undergraduate doing an elementary number theory course and this is there first proof based course.
 
How about a test for prime numbers needed for RSA? Class field theory would probably be a bit early.
 
Okay I will have to look up RSA. The only thing I was aware of was that it used to large primes to make a product n=pq and security is dependent on factorising this large product. Thanks for this.
 
matqkks said:
Okay I will have to look up RSA. The only thing I was aware of was that it used to large primes to make a product n=pq and security is dependent on factorising this large product. Thanks for this.
I think Shor's algorithm uses little Fermat and yes, RSA needs large primes, so I'm sure Shor is already too slow. But it's a start and a reason for why the primes have to be large! Probability algorithms based on ERH are likely a bit over the edge.
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top