2010/09/21 by Paul Monsky, Monsky, Paul
Computer Science · Mathematics · #Analytic Number Theory Research #Computability, Logic, AI Algorithms #FOS: Mathematics #Number Theory (math.NT) #math.NT
paper · pdf · doi:10.48550/arxiv.1009.3990
4 pages
arxiv created 2010/09/21 · openalex publication_date 2010/09/21 · arxiv updated 2010/09/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
I present Franz Lemmermeyer's proof that if p is a prime congruent to 9 mod 16 then the class number of Q(p^(1/4)) is congruent to 2 mod 4.