MHB What is the most motivating way to introduce primitive roots?

  • Thread starter Thread starter matqkks
  • Start date Start date
  • Tags Tags
    Primitive Roots
matqkks
Messages
280
Reaction score
5
I am teaching elementary number theory to first year undergraduate students. How do introduce the order of an integer modulo n and primitive roots? How do I make this a motivating topic and are there any applications of this area? I am looking at something which will have an impact.
 
Mathematics news on Phys.org
I would say build it up slowly, using concrete examples they can all understand. The simplest example would be clock arithmetic as time is surely something they must all deal with every day.

Though the students are undergraduates, let’s assume they are starting at the very basic level, with no prior knowledge of the subject whatsoever. Start by asking them the simplest of questions, say: “It is 9 o’clock now and I have an appointment in 5 hours’ time. What time is my appointment?” Most of them should have no difficulty working out the answer themselves. Now ask them a slightly more complicated one: “If it’s 9 o’clock now, what time will it be in 50 hours’ time?” Now they have to subtract a multiple of 12 rather than just 12. Explain to them that this is the principle of modulo-12 arithmetic.

Now tell them we can do modular arithmetic in numbers other than 12. For example, if they have to calculate not just the time but the time of the day (i.e. whether it’s a.m. or p.m.) then they’re working modulo 24 rather than 12. Another example would be modulo 7 for days of the week: “It’s Monday today; what day of the week will it be in 100 days’ time?” Give them a few similar examples to work out for themselves. They should begin to grasp the connection between the arithmetics of modulo 12, 24 and 7.

Once they have the right feel for the topic, it’s time for serious work. Define modular arithmetic formally, derive the basic laws (if $a\equiv b\pmod n$ and $c\equiv d\pmod n$ then $a+b\equiv c+d\pmod n$, and so on) and establish other important results. This should gradually build up to increasingly complex topics in modular-arithmetic number theory.
 
Last edited:
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