等差数列上的数字和函数

Q4 Mathematics

Moscow Journal of Combinatorics and Number Theory Pub Date : 2019-09-19 DOI:10.2140/moscow.2020.9.43

Lukas Spiegelhofer, T. Stoll

{"title":"等差数列上的数字和函数","authors":"Lukas Spiegelhofer, T. Stoll","doi":"10.2140/moscow.2020.9.43","DOIUrl":null,"url":null,"abstract":"Let $s_2$ be the sum-of-digits function in base $2$, which returns the number of non-zero binary digits of a nonnegative integer $n$. We study $s_2$ alon g arithmetic subsequences and show that --- up to a shift --- the set of $m$-tuples of integers that appear as an arithmetic subsequence of $s_2$ has full complexity.","PeriodicalId":36590,"journal":{"name":"Moscow Journal of Combinatorics and Number Theory","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2019-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.2140/moscow.2020.9.43","citationCount":"0","resultStr":"{\"title\":\"The sum-of-digits function on arithmetic progressions\",\"authors\":\"Lukas Spiegelhofer, T. Stoll\",\"doi\":\"10.2140/moscow.2020.9.43\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let $s_2$ be the sum-of-digits function in base $2$, which returns the number of non-zero binary digits of a nonnegative integer $n$. We study $s_2$ alon g arithmetic subsequences and show that --- up to a shift --- the set of $m$-tuples of integers that appear as an arithmetic subsequence of $s_2$ has full complexity.\",\"PeriodicalId\":36590,\"journal\":{\"name\":\"Moscow Journal of Combinatorics and Number Theory\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-09-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.2140/moscow.2020.9.43\",\"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.43\",\"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.43","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}

引用次数: 0

摘要

设$s_2$为以$2$为基数的数字和函数，它返回非负整数$n$的非零二进制位数的个数。我们研究了$s_2$和g个算术子序列，并证明了——直到移位——作为$s_2$的算术子序列出现的$m$-整数元组的集合具有完全复杂度。

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

查看原文本刊更多论文

The sum-of-digits function on arithmetic progressions

Let $s_2$ be the sum-of-digits function in base $2$, which returns the number of non-zero binary digits of a nonnegative integer $n$. We study $s_2$ alon g arithmetic subsequences and show that --- up to a shift --- the set of $m$-tuples of integers that appear as an arithmetic subsequence of $s_2$ has full complexity.

求助全文

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

来源期刊

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

CiteScore

0.80

自引率

0.00%

发文量