The Riemann hypothesis as the parity of special binomial coefficients

DOI10.1134/S1064562422700247zbMATH Open1517.11112OpenAlexW4361758340MaRDI QIDQ6132479FDOQ6132479

Authors: Yu. Matiyasevich 

Publication date: 17 August 2023

Published in: Doklady Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1064562422700247

Recommendations

• Гипотеза Римана как чётность биномиальных коэффициентов
• On a theorem of Matiyasevich
• The simplest equivalent of the Riemann hypothesis
• On an equality equivalent to the Riemann hypothesis
• An arithmetic equivalence of the Riemann hypothesis

zbMATH Keywords

Riemann hypothesisbinomial coefficients

Mathematics Subject Classification ID

Bernoulli and Euler numbers and polynomials (11B68) Asymptotic results on arithmetic functions (11N37) Binomial coefficients; factorials; (q)-identities (11B65) Nonreal zeros of (zeta (s)) and (L(s, chi)); Riemann and other hypotheses (11M26)

Cites Work

• Title not available (Why is that?)
• Grandes valeurs de la fonction somme des diviseurs et hypothèse de Riemann
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Artin's Conjecture, Turing's Method, and the Riemann Hypothesis
• Title not available (Why is that?)
• Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x). II
• Introduction to modern number theory. Fundamental problems, ideas and theories. Transl. from the Russian
• Petites valeurs de la fonction d'Euler
• Universal diophantine equation
• Some arithmetical restatements of the four color conjecture
• Title not available (Why is that?)
• An Elementary Problem Equivalent to the Riemann Hypothesis
• Alan Turing. His work and impact
• Title not available (Why is that?)
• Title not available (Why is that?)
• On a combinatorial expression concerning Fermat's Last Theorem
• The complexity of Riemann's hypothesis
• Notes on Binomial Coefficients I-A Generalization of Lucas' Congruence†
• Mathematical significance of consistency proofs
• A necessary and sufficient condition for primality, and its source
• A class of primality criteria formulated in terms of the divisibility of binomial coefficients
• Equivalents of the Riemann Hypothesis
• The Riemann hypothesis in computer science
• A Relatively Small Turing Machine Whose Behavior Is Independent of Set Theory
• A binomial representation of the 3x + 1 problem

Cited In (1)

• Гипотеза Римана как чётность биномиальных коэффициентов

This page was built for publication: The Riemann hypothesis as the parity of special binomial coefficients

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6132479)