Currently displaying 1 – 12 of 12

Showing per page

Order by Relevance | Title | Year of publication

Towards Bauer's theorem for linear recurrence sequences

Mariusz Skałba — 2003

Colloquium Mathematicae

Consider a recurrence sequence ( x k ) k of integers satisfying x k + n = a n - 1 x k + n - 1 + . . . + a x k + 1 + a x k , where a , a , . . . , a n - 1 are fixed and a₀ ∈ -1,1. Assume that x k > 0 for all sufficiently large k. If there exists k₀∈ ℤ such that x k < 0 then for each negative integer -D there exist infinitely many rational primes q such that q | x k for some k ∈ ℕ and (-D/q) = -1.

Products of disjoint blocks of consecutive integers which are powers

Mariusz Skałba — 2003

Colloquium Mathematicae

The product of consecutive integers cannot be a power (after Erdős and Selfridge), but products of disjoint blocks of consecutive integers can be powers. Even if the blocks have a fixed length l ≥ 4 there are many solutions. We give the bound for the smallest solution and an estimate for the number of solutions below x.

On Alternatives of Polynomial Congruences

Mariusz Skałba — 2004

Bulletin of the Polish Academy of Sciences. Mathematics

What should be assumed about the integral polynomials f ( x ) , . . . , f k ( x ) in order that the solvability of the congruence f ( x ) f ( x ) f k ( x ) 0 ( m o d p ) for sufficiently large primes p implies the solvability of the equation f ( x ) f ( x ) f k ( x ) = 0 in integers x? We provide some explicit characterizations for the cases when f j ( x ) are binomials or have cyclic splitting fields.

Page 1

Download Results (CSV)