The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Linear recurrence sequences without zeros”

On sets which contain a qth power residue for almost all prime modules

Mariusz Ska/lba (2005)

Colloquium Mathematicae

Similarity:

A classical theorem of M. Fried [2] asserts that if non-zero integers β , . . . , β l have the property that for each prime number p there exists a quadratic residue β j mod p then a certain product of an odd number of them is a square. We provide generalizations for power residues of degree n in two cases: 1) n is a prime, 2) n is a power of an odd prime. The proofs involve some combinatorial properties of finite Abelian groups and arithmetic results of [3].

Common terms in binary recurrences

Erzsébet Orosz (2006)

Acta Mathematica Universitatis Ostraviensis

Similarity:

The purpose of this paper is to prove that the common terms of linear recurrences M ( 2 a , - 1 , 0 , b ) and N ( 2 c , - 1 , 0 , d ) have at most 2 common terms if p = 2 , and have at most three common terms if p > 2 where D and p are fixed positive integers and p is a prime, such that neither D nor D + p is perfect square, further a , b , c , d are nonzero integers satisfying the equations a 2 - D b 2 = 1 and c 2 - ( D + p ) d 2 = 1 .

Primefree shifted Lucas sequences

Lenny Jones (2015)

Acta Arithmetica

Similarity:

We say a sequence = ( s ) n 0 is primefree if |sₙ| is not prime for all n ≥ 0, and to rule out trivial situations, we require that no single prime divides all terms of . In this article, we focus on the particular Lucas sequences of the first kind, a = ( u ) n 0 , defined by u₀ = 0, u₁ = 1, and uₙ = aun-1 + un-2 for n≥2, where a is a fixed integer. More precisely, we show that for any integer a, there exist infinitely many integers k such that both of the shifted sequences a ± k are simultaneously primefree. This...

On sums of binomial coefficients modulo p²

Zhi-Wei Sun (2012)

Colloquium Mathematicae

Similarity:

Let p be an odd prime and let a be a positive integer. In this paper we investigate the sum k = 0 p a - 1 ( h p a - 1 k ) ( 2 k k ) / m k ( m o d p ² ) , where h and m are p-adic integers with m ≢ 0 (mod p). For example, we show that if h ≢ 0 (mod p) and p a > 3 , then k = 0 p a - 1 ( h p a - 1 k ) ( 2 k k ) ( - h / 2 ) k ( ( 1 - 2 h ) / ( p a ) ) ( 1 + h ( ( 4 - 2 / h ) p - 1 - 1 ) ) ( m o d p ² ) , where (·/·) denotes the Jacobi symbol. Here is another remarkable congruence: If p a > 3 then k = 0 p a - 1 ( p a - 1 k ) ( 2 k k ) ( - 1 ) k 3 p - 1 ( p a / 3 ) ( m o d p ² ) .

Congruent numbers with higher exponents

Florian Luca, László Szalay (2006)

Acta Mathematica Universitatis Ostraviensis

Similarity:

This paper investigates the system of equations x 2 + a y m = z 1 2 , x 2 - a y m = z 2 2 in positive integers x , y , z 1 , z 2 , where a and m are positive integers with m 3 . In case of m = 2 we would obtain the classical problem of congruent numbers. We provide a procedure to solve the simultaneous equations above for a class of the coefficient a with the condition gcd ( x , z 1 ) = gcd ( x , z 2 ) = gcd ( z 1 , z 2 ) = 1 . Further, under same condition, we even prove a finiteness theorem for arbitrary nonzero a .

On the quartic character of quadratic units

Zhi-Hong Sun (2013)

Acta Arithmetica

Similarity:

Let ℤ be the set of integers, and let (m,n) be the greatest common divisor of integers m and n. Let p be a prime of the form 4k+1 and p = c²+d² with c,d ∈ ℤ, d = 2 r d and c ≡ d₀ ≡ 1 (mod 4). In the paper we determine ( b + ( b ² + 4 α ) / 2 ) ( p - 1 ) / 4 ) ( m o d p ) for p = x²+(b²+4α)y² (b,x,y ∈ ℤ, 2∤b), and ( 2 a + 4 a ² + 1 ) ( p - 1 ) / 4 ( m o d p ) for p = x²+(4a²+1)y² (a,x,y∈ℤ) on the condition that (c,x+d) = 1 or (d₀,x+c) = 1. As applications we obtain the congruence for U ( p - 1 ) / 4 ( m o d p ) and the criterion for p | U ( p - 1 ) / 8 (if p ≡ 1 (mod 8)), where Uₙ is the Lucas sequence given by U₀ = 0, U₁ = 1 and...

On prime values of reducible quadratic polynomials

W. Narkiewicz, T. Pezda (2002)

Colloquium Mathematicae

Similarity:

It is shown that Dickson’s Conjecture about primes in linear polynomials implies that if f is a reducible quadratic polynomial with integral coefficients and non-zero discriminant then for every r there exists an integer N r such that the polynomial f ( X ) / N r represents at least r distinct primes.

Products of factorials modulo p

Florian Luca, Pantelimon Stănică (2003)

Colloquium Mathematicae

Similarity:

We show that if p ≠ 5 is a prime, then the numbers 1 / p ( p m , . . . , m t ) | t 1 , m i 0 f o r i = 1 , . . . , t a n d i = 1 t m i = p cover all the nonzero residue classes modulo p.