English
Related papers

Related papers: Primitive prime factors in second order linear rec…

200 papers

We have presented a multivariate polynomial function termed as factor elimination function,by which, we can generate prime numbers. This function's mapping behavior can explain the irregularities in the occurrence of prime numbers on the…

General Mathematics · Mathematics 2014-11-14 Vineet Kumar

Let b be an odd integer such that b=+/-1 (mod 8) and let q be a prime with primitive root 2 such that q does not divide b. We show that if (p(k)) is a sequence of odd primes, with 0<=k<=q-2 such that p(k)=2p(k-1)+b for all 1<=k<=q-2, then…

Number Theory · Mathematics 2009-08-20 Douglas S. Stones

Let $\{U_n\}_{n\geq 0}$ be a Lucas sequence. Then the equation $$|U_n|=m_1!m_2!\cdots m_k!$$ with $1<m_1\leq m_2\leq \cdots\leq m_k$ implies $n\in \{1,2, 3, 4, 6, 8, 12\}$. Further the equation $$|U_n|=D_{m_1}D_{m_2}\cdots D_{m_k}, \qquad…

Number Theory · Mathematics 2021-04-07 Shanta Laishram

We consider the primes which divide the denominator of the x-coordinate of a sequence of rational points on an elliptic curve. It is expected that for every sufficiently large value of the index, each term should be divisible by a primitive…

Number Theory · Mathematics 2007-05-23 Graham Everest , Igor E Shparlinski

Stewart reduced the problem of determining all Lucas and Lehmer sequences whose $n$-th element does not have a primitive divisor to solving certain Thue equations. Using the method of Tzanakis and de Weger for solving Thue equations, we…

Number Theory · Mathematics 2012-02-01 Paul M Voutier

If p is a prime, then the numbers 1, 2, ..., p-1 form a group under multiplication modulo p. A number g that generates this group is called a primitive root of p; i.e., g is such that every number between 1 and p-1 can be written as a power…

Logic in Computer Science · Computer Science 2022-05-25 Ruben Gamboa , Woodrow Gamboa

Let $\underline{a}$ and $\underline{b}$ be primitive sequences over $\mathbb{Z}/(p^e)$ with odd prime $p$ and $e\ge 2$. For certain compressing maps, we consider the distribution properties of compressing sequences of $\underline{a}$ and…

Information Theory · Computer Science 2014-01-24 Yupeng Jiang , Dongdai Lin

For any $k\geq 1$, we study the distribution of the difference between the number of integers $n\leq x$ with $\omega(n)=k$ or $\Omega(n)=k$ in two different arithmetic progressions, where $\omega(n)$ is the number of distinct prime factors…

Number Theory · Mathematics 2018-05-23 Xianchang Meng

Let $n$ be a positive square-free integer, where every odd prime factor of $n$ has form $8a\pm 1$. We determine when $n$ is non-congruent with second minimal $2$-primary Shafarevich-Tate group, in terms of the $4$-ranks of class groups and…

Number Theory · Mathematics 2021-11-24 Shenxing Zhang

A natural number $n$ is called semi-prime if it is a product of two primes or a square of a prime. We denote $\mathbb{P}_2$ the set of all semi-primes. Our goal is to prove that for fixed integer number $a$ and sufficiently large $x$ the…

Number Theory · Mathematics 2025-12-11 Do Duc Tam

We estimate from below the lower density of the set of prime numbers p such that p-1 has a prime factor of size at least p^c, where c lies in between 1/4 and 1/2. We also establish upper and lower bounds on the counting function of the set…

Number Theory · Mathematics 2017-04-13 Florian Luca , Ricardo Menares , Amalia Pizarro-Madariaga

It is well-known that for any distinct positive integers $k$ and $n$, the numbers $2^{2^k}+1$ and $2^{2^n}+1$ are relatively prime. In this paper we consider the situation when 1 is replaced by some positive integer $d>1$

Number Theory · Mathematics 2016-01-26 Tigran Hakobyan

In this paper, we provide some novel results concerning the behavior of $\frac{U_{kn}}{U_k}$ modulo ${U_n}$, where $(U_n)_{n\in\mathbb{N}}$ is the Lucas sequence of the first kind. As a consequence, we obtain some primality criteria which…

General Mathematics · Mathematics 2023-06-26 Konstantinos Gaitanas

We study some divisibility properties of multiperfect numbers. Our main result is: if $N=p_1^{\alpha_1}... p_s^{\alpha_s} q_1^{2\beta_1}... q_t^{2\beta_t}$ with $\beta_1, ..., \beta_t$ in some finite set S satisfies…

Number Theory · Mathematics 2007-07-31 Tomohiro Yamada

Let $p_n$ be $n$th prime, and let $(S_n)_{n=1}^\infty:=(S_n)$ be the sequence of the sums of the first $2n$ consecutive primes, that is, $S_n=\sum_{k=1}^{2n}p_k$ with $n=1,2,\ldots$. Heuristic arguments supported by the corresponding…

Number Theory · Mathematics 2018-04-13 Romeo Meštrović

In this paper we study mixed sums of primes and linear recurrences. We show that if m=2(mod 4) and m+1 is a prime then $(m^{2^n-1}-1)/(m-1)\not=m^n+p^a$ for any n=3,4,... and prime power p^a. We also prove that if a>1 is an integer, u_0=0,…

Number Theory · Mathematics 2009-01-29 Zhi-Wei Sun

Let $a$ and $b$ be relatively prime integers. Then the first Lucas sequence $\left(U_n\right)_{n\geq0}$ and the second Lucas sequence $\left(V_n\right)_{n\geq0}$ are defined respectively by $U_{n+2}=aU_{n+1}+bU_{n},\, U_0=0,\,U_1=1$ and…

Number Theory · Mathematics 2025-08-26 Hongjian Li , Huiming Xiao , Pingzhi Yuan

We explicitly describe the splitting of odd integral primes in the radical extension $\mathbb{Q}(\sqrt[n]{a})$, where $x^n-a$ is an irreducible polynomial in $\mathbb{Z}[x]$. Our motivation is to classify common index divisors, the primes…

Number Theory · Mathematics 2025-07-25 Hanson Smith

We show that the product of two consecutive Fibonacci (respectively Lucas) numbers is divisible by the sum of their indices if this sum is a prime number different from 5 and in the form (4r+1)(respectively (4r+3)).

Number Theory · Mathematics 2014-07-18 Vladimir Pletser

We speculate on the distribution of primes in exponentially growing, linear recurrence sequences $(u_n)_{n\geq 0}$ in the integers. By tweaking a heuristic which is successfully used to predict the number of prime values of polynomials, we…

Number Theory · Mathematics 2024-09-10 Jon Grantham , Andrew Granville