Código QR (código de barras bidimensional)

Generalization of Recent Method Giving Lower Bound for N(o)(T) of Riemann's Zeta-Function

Let h(s) = π(-s/2)τ(s/2). Then, h(s)ζ(s) ∼ h(s)H(s) + h(1 - s)H(1 - s) where H(s) = Σ(1 - (log n)/log t/2π)n(-s), n ≤ t/2π, led to N(o)(T) ≥ N(T)/3. Here the extension to H(s) ∼ Σ P (1 - (log n)/log t/2π) n(-s) is made where P(x) is a polynomial such that P(0) = 0 and P(x) + P(1 - x) = 1. The earlie...

Fuld beskrivelse

Na minha lista:
Bibliografiske detaljer
Udgivet i:Proc Natl Acad Sci U S A
Hovedforfatter: Levinson, Norman
Format: Artigo
Sprog:Inglês
Udgivet: National Academy of Sciences 1974
Fag:
Online adgang:https://ncbi.nlm.nih.govhttps://pmc.ncbi.nlm.nih.gov/articles/PMC434311/
https://ncbi.nlm.nih.govhttps://pubmed.ncbi.nlm.nih.gov/16592186/
https://ncbi.nlm.nih.govhttps://doi.org/10.1073/pnas.71.10.3984
Tags: Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!