On arithmetic properties of integers with missing digits II: Prime factors

P. Erdős, Christian Mauduit, A. Sárközy

Research output: Contribution to journalArticle

19 Citations (Scopus)

Abstract

Prime factors of numbers with missing digits are studied. It is shown that, under certain conditions, this set satisfies an Erdos-Kac type theorem; it contains numbers with 'many' prime factors; it contains numbers whose greatest prime factor is 'large' (resp. 'small').

Original languageEnglish
Pages (from-to)149-164
Number of pages16
JournalDiscrete Mathematics
Volume200
Issue number1-3
Publication statusPublished - Apr 6 1999

Fingerprint

Prime factor
Digit
Integer
Erdös
Theorem

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

On arithmetic properties of integers with missing digits II : Prime factors. / Erdős, P.; Mauduit, Christian; Sárközy, A.

In: Discrete Mathematics, Vol. 200, No. 1-3, 06.04.1999, p. 149-164.

Research output: Contribution to journalArticle

@article{540ae7f0a7d04a80a74b9a52807ff5a2,
title = "On arithmetic properties of integers with missing digits II: Prime factors",
abstract = "Prime factors of numbers with missing digits are studied. It is shown that, under certain conditions, this set satisfies an Erdos-Kac type theorem; it contains numbers with 'many' prime factors; it contains numbers whose greatest prime factor is 'large' (resp. 'small').",
author = "P. Erdős and Christian Mauduit and A. S{\'a}rk{\"o}zy",
year = "1999",
month = "4",
day = "6",
language = "English",
volume = "200",
pages = "149--164",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1-3",

}

TY - JOUR

T1 - On arithmetic properties of integers with missing digits II

T2 - Prime factors

AU - Erdős, P.

AU - Mauduit, Christian

AU - Sárközy, A.

PY - 1999/4/6

Y1 - 1999/4/6

N2 - Prime factors of numbers with missing digits are studied. It is shown that, under certain conditions, this set satisfies an Erdos-Kac type theorem; it contains numbers with 'many' prime factors; it contains numbers whose greatest prime factor is 'large' (resp. 'small').

AB - Prime factors of numbers with missing digits are studied. It is shown that, under certain conditions, this set satisfies an Erdos-Kac type theorem; it contains numbers with 'many' prime factors; it contains numbers whose greatest prime factor is 'large' (resp. 'small').

UR - http://www.scopus.com/inward/record.url?scp=0000109619&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0000109619&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0000109619

VL - 200

SP - 149

EP - 164

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1-3

ER -