Related papers: Pell Numbers with Lehmer property

In this paper, we find all Fibonacci numbers which are products of two Pell numbers and all Pell numbers which are products of two Fibonacci numbers.

In this paper we extend the notion of Melham sum to the Pell and Pell-Lucas sequences. While the proofs of general statements rely on the binomial theorem, we prove some spacial cases by the known Pell identities. We also give extensions of…

The Mahler measure of a monic polynomial $P(x) = a_dx^d + a_{d-1}x^{d-1} + \dots + a_1x + a_0$ is defined as $M(P) := |a_d| \prod_{P(\alpha)=0} \max\{1, |\alpha|\}$, where the product runs over all roots of $P$. Lehmer's problem asks…

We prove that there are no Wieferich's primes $q=2p+1$ where $p \equiv 3 \pmod{4}$ is a prime number

We solve a Lehmer-type question about the Mahler measure of integer-valued polynomials.

Lehmer's totient problem asks if there exists a composite number $d$ such that its totient divide $d-1$. In this article we generalize the Lehmer's totient problem in algebraic number fields. We introduce the notion of a Lehmer number.…

We prove that neither a prime nor {an l-almost prime} number theorem hold in the class of regular Toeplitz subshifts. But, {when a quantitative strengthening of the regularity with respect to the periodic structure involving Euler's totient…

We give a new proof of the fact that Barker polynomials of even degree greater than 12, and hence Barker sequences of odd length greater than 13 do not exist. This is intimately tied to irreducibility questions and proved as a consequence…

We give a direct proof of the Cotlar-Stein lemma, which does not rely on the power trick.

A composite number $n$ is called a Lehmer number when $\phi(n) | n - 1$, where $\phi$ is the Euler totient function. Lehmer's totient problem asks if there exist any composite numbers $n$ such that $\phi(n)| n-1$? No such numbers are known.…

In this paper, we prove the non-existence of certain semistable Galois representations of a number field. Our consequence can be applied to some geometric problems. For example, we prove a special case of a Conjecture of Rasmussen and…

We present an elementary proof of Fermat's Last Theorem. No ancillary results are used, not even the most basic ones. The proof directly leads to a contradiction of the Fermat equation in the set of integers.

Bell's theorem is reformulated and proved in the pure mathematical terms of automata theory, avoiding any physical or ontological notions. It is stated that no pair of finite probabilistic sequential machines can reproduce in its output the…

A number has the "collective" property if the number is the greatest lower bound of a bounded, strictly decreasing sequence on the real line. We prove that numbers with the collective property constitute an empty set.

With the help of Kirchberg's and Selberg's theorems, we prove that the minimal tensor product of $B(H)$ with itself does not have the WEP (weak expectation property) of Lance.

In this paper, we study a class of sequences of polynomials linked to the sequence of Bell polynomials. Some sequences of this class have applications on the theory of hyperbolic differential equations and other sequences generalize…

We extend a result of Bump et al. to show that a large family of Sheffer sequences has their zeros - up to perhaps a finite number of exceptions - on a vertical line. We connect a particular such sequence to the Riemann zeta function via a…

In this article, we shall explore the constructions of Bernstein sets, and prove that every Bernstein set is nonmeasurable and doesn't have the property of Baire. We shall also prove that Bernstein sets don't have the perfect set property.

The conjecture of Lehmer is proved to be true. The proof mainly relies upon: (i) the properties of the Parry Upper functions $f_{house(\alpha)}(z)$ associated with the dynamical zeta functions $\zeta_{house(\alpha)}(z)$ of the…

Let $ \{L_n\}_{n\ge 0} $ be the sequence of Lucas numbers given by $ L_0=2, ~ L_1=1 $ and $ L_{n+2}=L_{n+1}+L_n $ for all $ n\ge 0 $. In the first paper, for an integer $d\geq 2$ which is square-free, we show that there is at most one value…