关于涉及欧拉积分函数的和

IF 0.6 4区 数学 Q3 MATHEMATICS
I. Kiuchi, Yuki Tsuruta
{"title":"关于涉及欧拉积分函数的和","authors":"I. Kiuchi, Yuki Tsuruta","doi":"10.1017/s0004972723000825","DOIUrl":null,"url":null,"abstract":"\n\t <jats:p>Let <jats:inline-formula>\n\t <jats:alternatives>\n\t\t<jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0004972723000825_inline1.png\" />\n\t\t<jats:tex-math>\n$\\gcd (n_{1},\\ldots ,n_{k})$\n</jats:tex-math>\n\t </jats:alternatives>\n\t </jats:inline-formula> denote the greatest common divisor of positive integers <jats:inline-formula>\n\t <jats:alternatives>\n\t\t<jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0004972723000825_inline2.png\" />\n\t\t<jats:tex-math>\n$n_{1},\\ldots ,n_{k}$\n</jats:tex-math>\n\t </jats:alternatives>\n\t </jats:inline-formula> and let <jats:inline-formula>\n\t <jats:alternatives>\n\t\t<jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0004972723000825_inline3.png\" />\n\t\t<jats:tex-math>\n$\\phi $\n</jats:tex-math>\n\t </jats:alternatives>\n\t </jats:inline-formula> be the Euler totient function. For any real number <jats:inline-formula>\n\t <jats:alternatives>\n\t\t<jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0004972723000825_inline4.png\" />\n\t\t<jats:tex-math>\n$x>3$\n</jats:tex-math>\n\t </jats:alternatives>\n\t </jats:inline-formula> and any integer <jats:inline-formula>\n\t <jats:alternatives>\n\t\t<jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0004972723000825_inline5.png\" />\n\t\t<jats:tex-math>\n$k\\geq 2$\n</jats:tex-math>\n\t </jats:alternatives>\n\t </jats:inline-formula>, we investigate the asymptotic behaviour of <jats:inline-formula>\n\t <jats:alternatives>\n\t\t<jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0004972723000825_inline6.png\" />\n\t\t<jats:tex-math>\n$\\sum _{n_{1}\\ldots n_{k}\\leq x}\\phi (\\gcd (n_{1},\\ldots ,n_{k})). $\n</jats:tex-math>\n\t </jats:alternatives>\n\t </jats:inline-formula></jats:p>","PeriodicalId":50720,"journal":{"name":"Bulletin of the Australian Mathematical Society","volume":"18 1","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2023-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"ON SUMS INVOLVING THE EULER TOTIENT FUNCTION\",\"authors\":\"I. Kiuchi, Yuki Tsuruta\",\"doi\":\"10.1017/s0004972723000825\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\\n\\t <jats:p>Let <jats:inline-formula>\\n\\t <jats:alternatives>\\n\\t\\t<jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" mime-subtype=\\\"png\\\" xlink:href=\\\"S0004972723000825_inline1.png\\\" />\\n\\t\\t<jats:tex-math>\\n$\\\\gcd (n_{1},\\\\ldots ,n_{k})$\\n</jats:tex-math>\\n\\t </jats:alternatives>\\n\\t </jats:inline-formula> denote the greatest common divisor of positive integers <jats:inline-formula>\\n\\t <jats:alternatives>\\n\\t\\t<jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" mime-subtype=\\\"png\\\" xlink:href=\\\"S0004972723000825_inline2.png\\\" />\\n\\t\\t<jats:tex-math>\\n$n_{1},\\\\ldots ,n_{k}$\\n</jats:tex-math>\\n\\t </jats:alternatives>\\n\\t </jats:inline-formula> and let <jats:inline-formula>\\n\\t <jats:alternatives>\\n\\t\\t<jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" mime-subtype=\\\"png\\\" xlink:href=\\\"S0004972723000825_inline3.png\\\" />\\n\\t\\t<jats:tex-math>\\n$\\\\phi $\\n</jats:tex-math>\\n\\t </jats:alternatives>\\n\\t </jats:inline-formula> be the Euler totient function. For any real number <jats:inline-formula>\\n\\t <jats:alternatives>\\n\\t\\t<jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" mime-subtype=\\\"png\\\" xlink:href=\\\"S0004972723000825_inline4.png\\\" />\\n\\t\\t<jats:tex-math>\\n$x>3$\\n</jats:tex-math>\\n\\t </jats:alternatives>\\n\\t </jats:inline-formula> and any integer <jats:inline-formula>\\n\\t <jats:alternatives>\\n\\t\\t<jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" mime-subtype=\\\"png\\\" xlink:href=\\\"S0004972723000825_inline5.png\\\" />\\n\\t\\t<jats:tex-math>\\n$k\\\\geq 2$\\n</jats:tex-math>\\n\\t </jats:alternatives>\\n\\t </jats:inline-formula>, we investigate the asymptotic behaviour of <jats:inline-formula>\\n\\t <jats:alternatives>\\n\\t\\t<jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" mime-subtype=\\\"png\\\" xlink:href=\\\"S0004972723000825_inline6.png\\\" />\\n\\t\\t<jats:tex-math>\\n$\\\\sum _{n_{1}\\\\ldots n_{k}\\\\leq x}\\\\phi (\\\\gcd (n_{1},\\\\ldots ,n_{k})). $\\n</jats:tex-math>\\n\\t </jats:alternatives>\\n\\t </jats:inline-formula></jats:p>\",\"PeriodicalId\":50720,\"journal\":{\"name\":\"Bulletin of the Australian Mathematical Society\",\"volume\":\"18 1\",\"pages\":\"\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2023-08-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Bulletin of the Australian Mathematical Society\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1017/s0004972723000825\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Bulletin of the Australian Mathematical Society","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1017/s0004972723000825","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

摘要

设$\gcd (n_{1},\ldots ,n_{k})$表示正整数的最大公约数$n_{1},\ldots ,n_{k}$,设$\phi $表示欧拉全数函数。对于任意实数$x>3$和任意整数$k\geq 2$,我们研究了 $\sum _{n_{1}\ldots n_{k}\leq x}\phi (\gcd (n_{1},\ldots ,n_{k})). $
本文章由计算机程序翻译,如有差异,请以英文原文为准。
ON SUMS INVOLVING THE EULER TOTIENT FUNCTION
Let $\gcd (n_{1},\ldots ,n_{k})$ denote the greatest common divisor of positive integers $n_{1},\ldots ,n_{k}$ and let $\phi $ be the Euler totient function. For any real number $x>3$ and any integer $k\geq 2$ , we investigate the asymptotic behaviour of $\sum _{n_{1}\ldots n_{k}\leq x}\phi (\gcd (n_{1},\ldots ,n_{k})). $
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.20
自引率
14.30%
发文量
149
审稿时长
4-8 weeks
期刊介绍: Bulletin of the Australian Mathematical Society aims at quick publication of original research in all branches of mathematics. Papers are accepted only after peer review but editorial decisions on acceptance or otherwise are taken quickly, normally within a month of receipt of the paper. The Bulletin concentrates on presenting new and interesting results in a clear and attractive way. Published Bi-monthly Published for the Australian Mathematical Society
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信