Related papers: A Prime Power Equation

Let Q be a non-singular quadratic form with integer coefficients. When Q is indefinite we provide new upper bounds for the least non-trivial integral solution to the equation Q=0. When Q is positive definite we provide improved upper bounds…

Motivated by the connection to the pair correlation of the Riemann zeros, we investigate the second derivative of the logarithm of the Riemann zeta function, in particular the zeros of this function. Theorem 1 gives a zero-free region.…

The Riemann hypothesis, one of the most important open problems in pure mathematics, implies the most profound secret of prime numbers. One of the most interesting approaches to solve this hypothesis is to connect the problem with the…

We study tensor powers of rank 1 sign-normalized Drinfeld A-modules, where A is the coordinate ring of an elliptic curve over a finite field. Using the theory of vector valued Anderson generating functions, we give formulas for the…

The series for the zeta function does not converge on the critical line but the function \[G(t)=\sum_{n=1}^\infty \frac{1}{n^{\frac12+it}}\frac{t}{2\pi n^2+t}\] satisfies $Z(t)=2\Re\{e^{i\vartheta(t)}G(t)\}+O(t^{-\frac56+\varepsilon})$. So…

Given any non-polynomial $G$-function $F(z)=\sum\_{k=0}^\infty A\_k z^k$ of radius of convergence $R$, we consider the $G$-functions $F\_n^{[s]}(z)=\sum\_{k=0}^\infty \frac{A\_k}{(k+n)^s}z^k$ for any integers $s\geq 0$ and $n\geq 1$. For…

Fix a positive prime power $q$, and let $\mathbb{F}_q[t]$ be the ring of polynomials over the finite field $\mathbb{F}_q$. Suppose $A \subseteq \{f \in \mathbb{F}_q[t]\colon\text{deg}~ f \le N\}$ contains no pair of elements whose…

Study of the level curve for the real part of $\eta(s)=0$ with $\eta(s)=\pi^{-s/2}\Gamma(s/2)\zeta^\prime(s)$ gives a new classification of the zeros of $\zeta(s)$ and of $\zeta^\prime(s)$. We conjecture that for type 2 zeros, $\liminf…

A $C^1$ prime indicator $\mathcal{P}\colon\mathbb{R}\to\mathbb{R}$ is constructed by applying the Fej\'er identity to the sine-quotient encoder of trial division. For integers $n\ge 2$, $\mathcal P(n)=0$ holds exactly for odd primes;…

Let $q$ be an odd prime and $B = \{b_{j}\}_{j=1}^{l}$ be a finite set of nonzero integers that does not contain a perfect $q^{th}$ power. We show that $B$ has a $q^{th}$ power modulo every prime $p \neq q$ and not dividing $\prod_{b\in B}…

In this article we derive, using the Lagrange inversion theorem and applying twice the Fa\`a di Bruno formula, an expression of the minimum of the Gamma function $\Gamma$ as an expansion in powers of the Euler-Mascheroni constant $\gamma$.…

We investigate the Waring-Goldbach problem of representing a positive integer $n$ as the sum of $s$ $k$th powers of almost equal prime numbers. Define $s_k=2k(k-1)$ when $k\ge 3$, and put $s_2=6$. In addition, put $\theta_2=\frac{19}{24}$,…

We consider a finite group $G$ with a normal subgroup $N$ so that all elements of $G \setminus N$ have prime power order. We prove that if there is a prime $p$ so that all the elements in $G \setminus N$ have $p$-power order, then either…

Using the methods of the "form factor program" exact expressions of all matrix elements are obtained for several operators of the quantum sine Gordon model: all powers of the fundamental bose field, general exponentials of it, the energy…

Let G be a finite connected graph. The Kirchhoff polynomial of G is a certain homogeneous polynomial whose degree is equal to the first betti number of G. These polynomials appear in the study of electrical circuits and in the evaluation of…

By considering the prime zeta function, the author intended to demonstrate in that the Riemann zeta function zeta(s) does not vanish for Re(s)>1/2, which would have proven the Riemann hypothesis. However, he later realised that the proof of…

In our recent paper we gave an efficient algorithm to calculate "small" solutions of relative Thue equations (where "small" means an upper bound of type $10^{500}$ for the sizes of solutions). Here we apply this algorithm to calculating…

Permutations can be represented as linear combinations of natural numbers with different powers. In this paper, its coefficient matrix and inverse matrix is derived, and the results show the coefficient matrix is a lower triangular matrix…

A graph $G$ is defined encapsulating the number theoretic notion of the Fundamental Theorem of Arithmetic. We then provide a graph theoretic approach to the fundamental results on the coprimality of two natural numbers, through the use of…

Let $r \ge 2$ be an integer and let $A$ be a finite, nonempty set of nonzero integers. We will obtain a lower bound for the number of squarefree integers $n$, up to $x$, for which the products $\prod_{p \mid n} (p+a)$ (over primes $p$) are…