Speaker: Dr. Joshua Stucky, Georgia Institute of Technology
Title: “The distribution of gcd((n,\phi(n)))”
Abstract: Erd\H{o}s showed that the number of $n\leq x$ such that $gcd((n,\phi(n))=1$ is asymptotic to $x/\log\log\log x$. This was later improved by Pollack to a more precise asymptotic formula. In this talk, I will discuss the distribution of a family of multiplicative functions over the set of integers $(n,\phi(n))$, $n\leq x$. Along the way, I'll give some historical background and try to underscore the main sieve-theoretic ideas of my research. Graduate students and even advanced undergraduates are invited to join.

The Discrete Math Seminar (DMS) is intended for Kennesaw State faculty working in the various areas of algebra, number theory, and discrete mathematics to get together to discuss their current work or related questions. Seminars often involve advanced mathematical knowledge. However, the seminars are open to anyone interested in attending.

Stream URL