{"title":",原始函数和泊松函数","authors":"P. Pollack, C. Pomerance","doi":"10.1215/00192082-8591576","DOIUrl":null,"url":null,"abstract":"The primorial $p\\#$ of a prime $p$ is the product of all primes $q\\le p$. Let pr$(n)$ denote the largest prime $p$ with $p\\# \\mid \\phi(n)$, where $\\phi$ is Euler's totient function. We show that the normal order of pr$(n)$ is $\\log\\log n/\\log\\log\\log n$. That is, pr$(n) \\sim \\log\\log n/\\log\\log\\log n$ as $n\\to\\infty$ on a set of integers of asymptotic density 1. In fact we show there is an asymptotic secondary term and, on a tertiary level, there is an asymptotic Poisson distribution. We also show an analogous result for the largest integer $k$ with $k!\\mid \\phi(n)$.","PeriodicalId":56298,"journal":{"name":"Illinois Journal of Mathematics","volume":" ","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2020-01-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Phi, primorials, and Poisson\",\"authors\":\"P. Pollack, C. Pomerance\",\"doi\":\"10.1215/00192082-8591576\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The primorial $p\\\\#$ of a prime $p$ is the product of all primes $q\\\\le p$. Let pr$(n)$ denote the largest prime $p$ with $p\\\\# \\\\mid \\\\phi(n)$, where $\\\\phi$ is Euler's totient function. We show that the normal order of pr$(n)$ is $\\\\log\\\\log n/\\\\log\\\\log\\\\log n$. That is, pr$(n) \\\\sim \\\\log\\\\log n/\\\\log\\\\log\\\\log n$ as $n\\\\to\\\\infty$ on a set of integers of asymptotic density 1. In fact we show there is an asymptotic secondary term and, on a tertiary level, there is an asymptotic Poisson distribution. We also show an analogous result for the largest integer $k$ with $k!\\\\mid \\\\phi(n)$.\",\"PeriodicalId\":56298,\"journal\":{\"name\":\"Illinois Journal of Mathematics\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2020-01-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Illinois Journal of Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1215/00192082-8591576\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Illinois Journal of Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1215/00192082-8591576","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
The primorial $p\#$ of a prime $p$ is the product of all primes $q\le p$. Let pr$(n)$ denote the largest prime $p$ with $p\# \mid \phi(n)$, where $\phi$ is Euler's totient function. We show that the normal order of pr$(n)$ is $\log\log n/\log\log\log n$. That is, pr$(n) \sim \log\log n/\log\log\log n$ as $n\to\infty$ on a set of integers of asymptotic density 1. In fact we show there is an asymptotic secondary term and, on a tertiary level, there is an asymptotic Poisson distribution. We also show an analogous result for the largest integer $k$ with $k!\mid \phi(n)$.
期刊介绍:
IJM strives to publish high quality research papers in all areas of mainstream mathematics that are of interest to a substantial number of its readers.
IJM is published by Duke University Press on behalf of the Department of Mathematics at the University of Illinois at Urbana-Champaign.