Related papers: Positive spoof Lehmer factorizations

We establish an analogue of the Goldbach conjecture for Laurent polynomials with positive integer coefficients.

We study connections between linear equations over various semigroups and recursively enumerable sets of positive integers. We give variants of the universal Diophantine representation of recursively enumerable sets of positive integers…

This note presents the basic mathematical structure of a new integer factorization method based on systems of linear Diophantine equations.

We give a reformulation of the Lehmer conjecture about algebraic integers in terms of a simple counting problem modulo p.

This paper finds all Lucas numbers which are the sum of two Jacobsthal numbers. It also finds all Jacobsthal numbers which are the sum of two Lucas numbers. In general, we find all non-negative integer solutions $(n, m, k)$ of the two…

Using elementary number theory we study Diophantine equations over the rational integers of the following form, $y^2=(x+a)(x+a+k)(x+b)(x+b+k)$, $y^2=c^2x^4+ax^2+b$ and $y^2=(x^2-1)(x^2-\alpha^2)(x^2-(\alpha+1)^2).$ We express their integer…

We prove sharp estimates in a shrinking target problem for the action of an arbitrary subgroup $\Gamma$ of $SL_2(\mathbb{Z})$ on the 2-torus. This can also be viewed as a non-commutative Diophantine approximation problem. The methods…

Diophantine approximation is the problem of approximating a real number by rational numbers. We propose a version of this in which the numerators are approximately related to the denominators by a Laurent polynomial. Our definition is…

In this paper, we determine the primitive solutions of the Diophantine equation $(x-d)^2+x^2+(x+d)^2=y^n$ when $n\geq 2$ and $d=p^b$, $p$ a prime and $p\leq 10^4$. The main ingredients are the characterization of primitive divisors on…

We provide a new algorithm for tabulating composite numbers which are pseudoprimes to both a Fermat test and a Lucas test. Our algorithm is optimized for parameter choices that minimize the occurrence of pseudoprimes, and for pseudoprimes…

We propose a generic algorithm for computing the inverses of a multiplicative function under the assumption that the set of inverses is finite. More generally, our algorithm can compute certain functions of the inverses, such as their power…

In this paper, we solve Diophantine equation in the tittle in nonnegative integers m,n, and a. In order to prove our result, we use lower bounds for linear forms in logarithms and and a version of the Baker-Davenport reduction method in…

We build upon probabilistic models for Boolean Matrix and Boolean Tensor factorisation that have recently been shown to solve these problems with unprecedented accuracy and to enable posterior inference to scale to Billions of observation.…

Recursive formulas are derived for the number of solutions of linear and quadratic Diophantine equations with positive coefficients. This result is further extended to general non-linear additive Diophantine equations. It is shown that all…

We present two types of polynomials related to the Mittag-Leffler function namely the fractional Hermite polynomial and the Mittag-Leffler polynomial. The first modifies the Hermite polynomial and the second one is a refashioned Laguerre…

We make an analytical proof for Lehmer's totient conjecture. Lehmer conjectured that there is no solution for the congruence equation $n-1\equiv 0~(mod~\phi(n))$ with composite integers,$n$, where $\phi(n)$ denotes Euler's totient function.…

We discuss the problem of finding optimal exponents in Diophantine estimates involving one real number and, in some cases where such an exponent is known, present some properties of the corresponding extremal numbers.

Assume a polynomial-time algorithm for factoring integers, Conjecture~\ref{conj}, $d\geq 3,$ and $q$ and $p$ are prime numbers, where $p\leq q^A$ for some $A>0$. We develop a polynomial-time algorithm in $\log(q)$ that lifts every…

An important unsolved question in number theory is the Lehmer's totient problem that asks whether there exists any composite number $n$ such that $\varphi(n)\mid n-1$, where $\varphi$ is the Euler's totient function. It is known that if any…

We propose a numerical integrator for determining low-rank approximations to solutions of large-scale matrix differential equations. The considered differential equations are semilinear and stiff. Our method consists of first splitting the…