two ways to compute Riemanns prime counting function

Versión 1.0.0 (2,01 KB) por Thomas
one version which works (J2) and one which does not work (J1).
0.0
(0)
23 Descargas
Actualizado 29 mar 2021

Ver licencia

J1 and J2 compute Riemann's prime counting function. J1 does not converge properly in Li_sum. Please let me know, if you understand why this does not work - I could not resolve this.
J2 uses an alternative formula and provides good results.
Example:
run J2(100) to approximate the number of primes <= 200.

Citar como

Thomas (2025). two ways to compute Riemanns prime counting function (https://la.mathworks.com/matlabcentral/fileexchange/89564-two-ways-to-compute-riemanns-prime-counting-function), MATLAB Central File Exchange. Recuperado .

Compatibilidad con la versión de MATLAB
Se creó con R2019b
Compatible con cualquier versión
Compatibilidad con las plataformas
Windows macOS Linux
Etiquetas Añadir etiquetas

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Versión Publicado Notas de la versión
1.0.0