<?xml version="1.0" encoding="UTF-8"?>
<!-- generator="wordpress.com" -->
<urlset xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
	xsi:schemaLocation="http://www.sitemaps.org/schemas/sitemap/0.9 http://www.sitemaps.org/schemas/sitemap/0.9/sitemap.xsd"
	xmlns="http://www.sitemaps.org/schemas/sitemap/0.9"
	xmlns:news="http://www.google.com/schemas/sitemap-news/0.9"
	xmlns:image="http://www.google.com/schemas/sitemap-image/1.1"
	>
<url><loc>https://akickinthediscovery.com/2026/09/11/newbie-at-number-theory-part-10-primitive-roots/</loc><news:news><news:publication><news:name>A Kick in the Discovery </news:name><news:language>en</news:language></news:publication><news:publication_date>2026-09-11T19:14:00+00:00</news:publication_date><news:title>Newbie at Number Theory (Part 10): Primitive Roots</news:title><news:keywords>Uncategorized, math, Induction, Inductive Hypothesis, Fun, proof, Numbers, Number Theory, Fundamental, Blog, Algebra, Group, Number Thoery, Euler, Fermat, Lagrange, Lagrange&#039;s Theorem, Groups, Group Theory, Modular Arithmetic, Integers, Natural Numbbers, Natural Numbers, A Kick in the Discovery, Integer, Integer Solution, Intuition, Examples, Prime Numbers, Fundamental Theorem of Arithmetic, Mathematics, Mod, Modular, Modular Addition, Modular Multiplication, Modular Division, Fermat&#039;s Little Theorem, Newbie at Number Theory, a^p-1 = 1 mod p, a^p-1 = 1 (mod p), Article, Order, Euler Totient, Euler&#039;s Totient Function, ax = b mod n, ax = b (mod n), Inequality, Proofs, Proof by Contradiction, Beautiful Math, Beautiful Maths, Be Kind. Be Curious. Be Compassionate. Be Creative. And Have Fun!, Be Kind., Be Curious., Be Compassionate., Be Creative., And Have Fun!, Gauss, be, Number, Primitive, Primitive Root, Polynomials, Euler&#039;s Criterion, Gauss&#039;s Theorem, Euler&#039;s Theorem, Generators, Exponemtiation, Exponents, ord(n), Observations, Fundamental Theorem of Algebra</news:keywords></news:news></url></urlset>
