We investigate the Fibonacci pseudoprimes of level k, and we disprove a statement concerning the relationship between the sets of different levels, and also discuss a counterpart of this result for the Lucas pseudoprimes of level k. We then use some recent arithmetic properties of the generalized Lucas, and generalized Pell–Lucas sequences, to define some new types of pseudoprimes of levels k+ and k− and parameter a. For these novel pseudoprime sequences we investigate some basic properties and calculate numerous associated integer sequences which we have added to the Online Encyclopedia of Integer Sequences.N/
AbstractWe show that if α > 1 is any fixed integer, then for a sufficiently large x > 1, the nth Fib...
In this paper, we consider a generalization of Lucas numbers. Recall that Lucas numbers are the sequ...
Every 10 minutes, the amount of human generated data expands by more than 10 petabyes. This is equiv...
We present a way of viewing Lucas pseudoprimes, Euler-Lucas pseudoprimes and strong Lucas pseudoprim...
We present a way of viewing Lucas pseudoprimes, Euler-Lucas pseudoprimes and strong Lucas pseudoprim...
AbstractWe show that if α > 1 is any fixed integer, then for a sufficiently large x > 1, the nth Fib...
summary:Let $d$ be a fixed positive integer. A Lucas $d$-pseudoprime is a Lucas pseudoprime $N$ fo...
summary:We use the properties of $p$-adic integrals and measures to obtain general congruences for G...
It is known that the generating function of the Fibonacci sequence, F(t) =\sum_{k=0}^{\infty} F_k t^...
summary:We use the properties of $p$-adic integrals and measures to obtain general congruences for G...
summary:Let $P_m$ and $E_m$ be the $m$-th Padovan and Perrin numbers respectively. Let $r, s$ be non...
Let n be a nonnegative integer and Gn = xn1 + x n 2 + · · ·+ xnk, where x1, x2,..., xk are the root...
AbstractDi Porto and Filipponi recently described a generalization of the standard test for an odd c...
In two earlier papers the authors studied pseudorandomness of binary functions defined on uniform tr...
summary:We show that the only Lucas numbers which are factoriangular are $1$ and $2$
AbstractWe show that if α > 1 is any fixed integer, then for a sufficiently large x > 1, the nth Fib...
In this paper, we consider a generalization of Lucas numbers. Recall that Lucas numbers are the sequ...
Every 10 minutes, the amount of human generated data expands by more than 10 petabyes. This is equiv...
We present a way of viewing Lucas pseudoprimes, Euler-Lucas pseudoprimes and strong Lucas pseudoprim...
We present a way of viewing Lucas pseudoprimes, Euler-Lucas pseudoprimes and strong Lucas pseudoprim...
AbstractWe show that if α > 1 is any fixed integer, then for a sufficiently large x > 1, the nth Fib...
summary:Let $d$ be a fixed positive integer. A Lucas $d$-pseudoprime is a Lucas pseudoprime $N$ fo...
summary:We use the properties of $p$-adic integrals and measures to obtain general congruences for G...
It is known that the generating function of the Fibonacci sequence, F(t) =\sum_{k=0}^{\infty} F_k t^...
summary:We use the properties of $p$-adic integrals and measures to obtain general congruences for G...
summary:Let $P_m$ and $E_m$ be the $m$-th Padovan and Perrin numbers respectively. Let $r, s$ be non...
Let n be a nonnegative integer and Gn = xn1 + x n 2 + · · ·+ xnk, where x1, x2,..., xk are the root...
AbstractDi Porto and Filipponi recently described a generalization of the standard test for an odd c...
In two earlier papers the authors studied pseudorandomness of binary functions defined on uniform tr...
summary:We show that the only Lucas numbers which are factoriangular are $1$ and $2$
AbstractWe show that if α > 1 is any fixed integer, then for a sufficiently large x > 1, the nth Fib...
In this paper, we consider a generalization of Lucas numbers. Recall that Lucas numbers are the sequ...
Every 10 minutes, the amount of human generated data expands by more than 10 petabyes. This is equiv...