On finite pseudorandom binary sequences IV: The Liouville function, II
Julien Cassaigne, Sébastien Ferenczi, Christian Mauduit, Joël Rivat, András Sárközy (2000)
Acta Arithmetica
Similarity:
Julien Cassaigne, Sébastien Ferenczi, Christian Mauduit, Joël Rivat, András Sárközy (2000)
Acta Arithmetica
Similarity:
Darvasi, Gyula (2001)
Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]
Similarity:
Maohua Le (1991)
Colloquium Mathematicae
Similarity:
Adam Naumowicz, Radosław Piliszek (2013)
Formalized Mathematics
Similarity:
This paper is a continuation of [19], where the divisibility criteria for initial prime numbers based on their representation in the decimal system were formalized. In the current paper we consider all primes up to 101 to demonstrate the method presented in [7].
Keiichi Miyajima, Takahiro Kato (2010)
Formalized Mathematics
Similarity:
This article extends the [10]. We define the sum and the product of the sequence of complex numbers, and formalize these theorems. Our method refers to the [11].
Katsumi Wasaki (2008)
Formalized Mathematics
Similarity:
We continue to formalize the concept of the Generalized Full Addition and Subtraction circuits (GFAs), define the structures of calculation units for the Redundant Signed Digit (RSD) operations, then prove its stability of the calculations. Generally, one-bit binary full adder assumes positive weights to all of its three binary inputs and two outputs. We define the circuit structure of two-types n-bit GFAs using the recursive construction to use the RSD arithmetic logical units that...
J. Wójcik (1996)
Colloquium Mathematicae
Similarity:
Gijswijt, D., Moree, P. (2005)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Maohua Le (1993)
Colloquium Mathematicae
Similarity:
Qi, Feng, Debnath, Lokenath (2000)
International Journal of Mathematics and Mathematical Sciences
Similarity: