more numb’-th’y exercisen

March 24, 2014 in Grading, TeX

let p be an odd prime &
let g & g’ be primitive
roots (mod p).

any Primitive Root, h, satisfies
(mod );
since (mod )
[this uses “h is primitive”],
we can conclude that
(mod ).

etcetera. forget it.
the handwritten stuff
is beautiful though.
is too hard.
it’s not so bad in the real editor,
of course.

oh, ps. (gg’)^[(p-1)/2]
is now seen to be congruent
to 1… and so is not a
primitive root (which, on
the day, was to’ve been shown).

Advertisement