Transforming recurrent sequences by using the binomial and invert operators.
Barbero, Stefano, Cerruti, Umberto, Murru, Nadir (2010)
Journal of Integer Sequences [electronic only]
Similarity:
Barbero, Stefano, Cerruti, Umberto, Murru, Nadir (2010)
Journal of Integer Sequences [electronic only]
Similarity:
Pan, Jiaqiang (2010)
Journal of Integer Sequences [electronic only]
Similarity:
Cossali, G.E. (2003)
Journal of Integer Sequences [electronic only]
Similarity:
Lenny Jones (2012)
Acta Arithmetica
Similarity:
Hans Carstens (1975)
Fundamenta Mathematicae
Similarity:
Manfred Peter (2002)
Acta Arithmetica
Similarity:
David Boyd (1979)
Acta Arithmetica
Similarity:
Francesco Amoroso, Evelina Viada (2011)
Acta Arithmetica
Similarity:
Pinthira Tangsupphathawat, Narong Punnim, Vichian Laohakosol (2012)
Colloquium Mathematicae
Similarity:
The problem whether each element of a sequence satisfying a fourth order linear recurrence with integer coefficients is nonnegative, referred to as the Positivity Problem for fourth order linear recurrence sequence, is shown to be decidable.
Jovan D. Kečkić (1973)
Publications de l'Institut Mathématique
Similarity:
Mercer, A.McD. (1978)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Xavier Vidaux (2011)
Acta Arithmetica
Similarity:
Kimberling, Clark (2007)
Journal of Integer Sequences [electronic only]
Similarity:
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...