算术级数中的平方全原始根

Q4 Mathematics

Moscow Journal of Combinatorics and Number Theory Pub Date : 2020-08-07 DOI:10.2140/moscow.2020.9.187

V. Laohakosol, T. Srichan, Pinthira Tangsupphathawat

{"title":"算术级数中的平方全原始根","authors":"V. Laohakosol, T. Srichan, Pinthira Tangsupphathawat","doi":"10.2140/moscow.2020.9.187","DOIUrl":null,"url":null,"abstract":"An asymptotic estimate for the number of positive primitive roots which are square-full integers in arithmetic progressions is derived. The employed method combines two techniques and is based on the character-sum method involving two characters; one character is to take care of being a primitive root, based on a result of Shapiro, and the other character is to take care of being square-full, based on a result of Munsch.","PeriodicalId":36590,"journal":{"name":"Moscow Journal of Combinatorics and Number Theory","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2020-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.2140/moscow.2020.9.187","citationCount":"0","resultStr":"{\"title\":\"Square-full primitive roots in arithmetic progressions\",\"authors\":\"V. Laohakosol, T. Srichan, Pinthira Tangsupphathawat\",\"doi\":\"10.2140/moscow.2020.9.187\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An asymptotic estimate for the number of positive primitive roots which are square-full integers in arithmetic progressions is derived. The employed method combines two techniques and is based on the character-sum method involving two characters; one character is to take care of being a primitive root, based on a result of Shapiro, and the other character is to take care of being square-full, based on a result of Munsch.\",\"PeriodicalId\":36590,\"journal\":{\"name\":\"Moscow Journal of Combinatorics and Number Theory\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-08-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.2140/moscow.2020.9.187\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Moscow Journal of Combinatorics and Number Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2140/moscow.2020.9.187\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Moscow Journal of Combinatorics and Number Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2140/moscow.2020.9.187","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}

引用次数: 0

摘要

导出了算术级数中平方全整数正基根个数的渐近估计。所采用的方法结合了两种技术，并基于涉及两个字符的字符和方法；一个字符是基于Shapiro的结果来处理原始根，另一个字符则是基于Munsch的结果，来处理平方满。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Square-full primitive roots in arithmetic progressions

An asymptotic estimate for the number of positive primitive roots which are square-full integers in arithmetic progressions is derived. The employed method combines two techniques and is based on the character-sum method involving two characters; one character is to take care of being a primitive root, based on a result of Shapiro, and the other character is to take care of being square-full, based on a result of Munsch.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Moscow Journal of Combinatorics and Number Theory Mathematics-Algebra and Number Theory

CiteScore

0.80

自引率

0.00%

发文量