Displaying similar documents to “The positivity problem for fourth order linear recurrence sequences is decidable”

On terms of linear recurrence sequences with only one distinct block of digits

Diego Marques, Alain Togbé (2011)

Colloquium Mathematicae

Similarity:

In 2000, Florian Luca proved that F₁₀ = 55 and L₅ = 11 are the largest numbers with only one distinct digit in the Fibonacci and Lucas sequences, respectively. In this paper, we find terms of a linear recurrence sequence with only one block of digits in its expansion in base g ≥ 2. As an application, we generalize Luca's result by finding the Fibonacci and Lucas numbers with only one distinct block of digits of length up to 10 in its decimal expansion.

Algebra of Polynomially Bounded Sequences and Negligible Functions

Hiroyuki Okazaki (2015)

Formalized Mathematics

Similarity:

In this article we formalize negligible functions that play an essential role in cryptology [10], [2]. Generally, a cryptosystem is secure if the probability of succeeding any attacks against the cryptosystem is negligible. First, we formalize the algebra of polynomially bounded sequences [20]. Next, we formalize negligible functions and prove the set of negligible functions is a subset of the algebra of polynomially bounded sequences. Moreover, we then introduce equivalence relation...

On the correlation of families of pseudorandom sequences of k symbols

Kit-Ho Mak, Alexandru Zaharescu (2016)

Acta Arithmetica

Similarity:

In an earlier paper Gyarmati introduced the notion of f-correlation for families of binary pseudorandom sequences as a measure of randomness in the family. In this paper we generalize the f-correlation to families of pseudorandom sequences of k symbols and study its properties.