Tag Archives: not p-adic Hodge theory

Students rule

GR complained to me a few weeks ago that this blog is too technical. Here, then, is something very untechnical. Problem. Show that for all integers . (Here denotes the GCD as usual.) This is a well-known cheeky question in elementary … Continue reading

Posted in Uncategorized | Tagged | Leave a comment

An after-dinner mint

Suppose is a prime congruent to 1 mod 3, so the equation has a solution. How do you find explicitly? One answer: choose of order 3, and set .  There is a much more general version of this, which can be explained … Continue reading

Posted in Uncategorized | Tagged , , | Leave a comment