Related papers: Many $p$-adic odd zeta values are irrational
We apply the theory of disconjugate linear recurrence relations to the study of irrational quantities in number theory. In particular, for an irrational number associated with solutions of three-term linear recurrence relations we show that…
We study the series $\psi_s(z):=\sum_{n=1}^{\infty} \sec(n\pi z)n^{-s}$, and prove that it converges under mild restrictions on $z$ and $s$. The function possesses a modular transformation property, which allows us to evaluate $\psi_{s}(z)$…
Starting from an A-stable rational approximation to $\rm{e}^z$ of order $p$, $$r(z)= 1+ z+ \cdots + z^p/ p! + O(z^{p+1}),$$ families of stable methods are proposed to time discretize abstract IVP's of the type $u'(t) = A u(t) + f(t)$. These…
We give two generalizations, in arbitrary depth, of the symmetry phenomenon used by Ball-Rivoal to prove that infinitely many values of Riemann $\zeta$ function at odd integers are irrational. These generalizations concern multiple series…
We consider the problem of classifying all positive-definite integer-valued quadratic forms that represent all positive odd integers. Kaplansky considered this problem for ternary forms, giving a list of 23 candidates, and proving that 19…
We prove that for any twist rigid compact $p$-adic analytic group $G$, its twist representation zeta function is a finite sum of terms $n_{i}^{-s}f_{i}(p^{-s})$, where $n_{i}$ are natural numbers and $f_{i}(t)\in\mathbb{Q}(t)$ are rational…
The fundamental proposal in this article is that logical formulas of the form (f <-> ~f) are not contradictions, and that formulas of the form (t <-> t) are not tautologies. Such formulas, wherever they appear in mathematics, are instead…
In number theory, we know Legendre's formula $ v_p(n!) = \sum_{k \ge 1} \lfloor \frac{n}{p^k} \rfloor $, which calculates the $p$-adic valuation of the factorial, i.e. the exponent of the greatest power of a prime $p$ that divides $n!$.…
We prove a number of results regarding odd values of the Ramanujan $\tau$-function. For example, we prove the existence of an effectively computable positive constant $\kappa$ such that if $\tau(n)$ is odd and $n \ge 25$ then either \[…
Given a squarefree positive integer $d$, we want to find integers (or rational numbers with denominators not divisible by large primes) $a_0,a_1,a_2,\ldots$ such that for sufficiently large primes $p$ we have $\sum_{k=0}^{p-1}a_k\equiv…
For each odd prime $p$, we prove the existence of infinitely many real quadratic fields which are $p$-rational. Explicit imaginary and real bi-quadratic $p$-rational fields are also given for each prime $p$. Using a recent method developed…
We present a short, self-contained, and purely combinatorial proof of Linnik's theorem: for any $\varepsilon > 0$ there exists a constant $C_\varepsilon$ such that for any $N$, there are at most $C_\varepsilon$ primes $p \leqslant N$ such…
In this note, using entirely algebraic or elementary methods, we determine a new asymptotic lower bound for the number of odd values of one of the most important modular functions in number theory, the Klein $j$-function. Namely, we show…
We give a sufficient and necessary condition for a p-adic integer to have p-th root in the ring of p-adic integers. The same condition holds clearly for residues modulo p^k. We give a proof that Fermat's last theorem is false for p-adic…
Let K/Q be Galois, and let eta in K* whose conjugates are multiplicatively independent. For a prime p, unramified, prime to eta, let np be the residue degree of p and gp the number of P I p, then let o\_P(eta) and o\_p(eta) be the orders of…
We prove that any positive rational number is the sum of distinct unit fractions with denominators in $\{p-1 : p\textrm{ prime}\}$. The same conclusion holds for the set $\{p-h : p\textrm{ prime}\}$ for any $h\in\mathbb{Z}\backslash\{0\}$,…
We address the problem of the stability of the computations of resultants and subresultants of polynomials defined over complete discrete valuation rings (e.g. Zp or k[[t]] where k is a field). We prove that Euclide-like algorithms are…
Let $k$ be a given positive odd integer and $p$ an odd prime. In this paper, we shall give a sufficient condition when a prime $p$ divides the order of the groups $K_{2k}(\mathbb{Z}[\zeta_m+\zeta_m^{-1}])$ and $K_{2k}(\mathbb{Z}[\zeta_m])$,…
We study the values of the zeta-function of the root system of type $G_2$ at positive integer points. In our previous work we considered the case when all integers are even, but in the present paper we prove several theorems which include…
Assuming the Riemann Hypothesis, we show that for $k>0$ $$ \frac{1}{T}\text{meas}\Big\{t\in [T,2T]:|\zeta(1/2+{\rm i} t)|>(\log T)^k\Big\}\leq C_k \frac{(\log T)^{-k^2}}{\sqrt{\log\log T}}, $$ where $C_k=\exp(e^{ck})$ for some absolute…