Some formulae which match with the prime counting function infinitely often - Archive ouverte HAL
Article Dans Une Revue Notes on Number Theory and Discrete Mathematics Année : 2018

Some formulae which match with the prime counting function infinitely often

Résumé

Recently K. Gaitanas gave a formula which matches with the counting prime function for an infinite set of values of its argument. In this note, we give a construction of an infinite number of such formulae.

Mots clés

Prime numbers

Domaines

Théorie des nombres [math.NT]

Ex-Bibliothèque Télécom Bretagne (devenu IMT Atlantique)  : Connectez-vous pour contacter le contributeur

https://hal.science/hal-01759083

Soumis le : jeudi 5 avril 2018-09:51:26

Dernière modification le : mardi 17 septembre 2024-15:55:56

Consulter le texte intégral

Dates et versions

hal-01759083 , version 1 (05-04-2018)

Identifiants

Citer

Yannick Saouter. Some formulae which match with the prime counting function infinitely often. Notes on Number Theory and Discrete Mathematics, 2018, 24 (1), pp.1 - 4. ⟨10.7546/nntdm.2018.24.1.1-4⟩. ⟨hal-01759083⟩

Exporter

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

UNIV-BREST CNRS LAB-STICC_UBO ENIB LAB-STICC IMT-ATLANTIQUE INSTITUT-MINES-TELECOM
124 Consultations
0 Téléchargements

Altmetric

Partager

More