Autor:	Wladyslaw Narkiewicz, Maciej Radziejewski
Rok vydání:	2010
Předmět:	Discrete mathematics Practical number General Mathematics Arithmetic function Asymptotic formula Table of divisors Refactorable number Prime (order theory) Mathematics
Zdroj:	Monatshefte für Mathematik. 164:75-85
ISSN:	1436-5081 0026-9255
DOI:	10.1007/s00605-010-0212-1
Popis:	An asymptotic formula is given for the number of integers n ≤ x which do not have divisors in a fixed arithmetical progression. This extends a previous result of Banks et al. (Forum Math 20:1005–1037, 2008) who considered the case of progressions with prime difference.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::90d5274ffdd4b790c4fea79489451837 https://doi.org/10.1007/s00605-010-0212-1 Zobrazit plný text záznamu Full text from SpringerLink