summary:Let $d$ be a fixed positive integer. A Lucas $d$-pseudoprime is a Lucas pseudoprime $N$ for which there exists a Lucas sequence $U(P,Q)$ such that the rank of $N$ in $U(P,Q)$ is exactly $(N - \varepsilon (N))/d$, where $\varepsilon $ is the signature of $U(P,Q)$. We prove here that all but a finite number of Lucas $d$-pseudoprimes are square free. We also prove that all but a finite number of Lucas $d$-pseudoprimes are Carmichael-Lucas numbers
This paper proves the existence of infinitely many Perrin pseudoprimes, as con-jectured by Adams and...
This paper proves the existence of infinitely many Perrin pseudoprimes, as con-jectured by Adams and...
Define ψm to be the smallest strong pseudoprime to all the first m prime bases. If we know the exact...
summary:Let $d$ be a fixed positive integer. A Lucas $d$-pseudoprime is a Lucas pseudoprime $N$ fo...
this paper, we aim at presenting the most recent results achieved in the theory of pseudoprime numbe...
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 describe here a method of constructing Carmichael numbers which are strong pseudoprimes t...
AbstractWe describe here a method of constructing Carmichael numbers which are strong pseudoprimes t...
Let n be a nonnegative integer and Gn = xn1 + x n 2 + · · ·+ xnk, where x1, x2,..., xk are the root...
We present a way of viewing Lucas pseudoprimes, Euler-Lucas pseudoprimes and strong Lucas pseudoprim...
Let q1 <q2 <q3 be odd primes and N = q1q2q3. Put d =gcd(q1−1,q2 − 1,q3 − 1) and hi = qi−1,i=1,...
We extend the method of Loh and Niebuhr for the generation of Carmichael numbers with a large number...
AbstractDi Porto and Filipponi recently described a generalization of the standard test for an odd c...
The well known "strong pseudoprime test" has its highest probability of error (ß 1=4) when...
This paper proves the existence of infinitely many Perrin pseudoprimes, as con-jectured by Adams and...
This paper proves the existence of infinitely many Perrin pseudoprimes, as con-jectured by Adams and...
Define ψm to be the smallest strong pseudoprime to all the first m prime bases. If we know the exact...
summary:Let $d$ be a fixed positive integer. A Lucas $d$-pseudoprime is a Lucas pseudoprime $N$ fo...
this paper, we aim at presenting the most recent results achieved in the theory of pseudoprime numbe...
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 describe here a method of constructing Carmichael numbers which are strong pseudoprimes t...
AbstractWe describe here a method of constructing Carmichael numbers which are strong pseudoprimes t...
Let n be a nonnegative integer and Gn = xn1 + x n 2 + · · ·+ xnk, where x1, x2,..., xk are the root...
We present a way of viewing Lucas pseudoprimes, Euler-Lucas pseudoprimes and strong Lucas pseudoprim...
Let q1 <q2 <q3 be odd primes and N = q1q2q3. Put d =gcd(q1−1,q2 − 1,q3 − 1) and hi = qi−1,i=1,...
We extend the method of Loh and Niebuhr for the generation of Carmichael numbers with a large number...
AbstractDi Porto and Filipponi recently described a generalization of the standard test for an odd c...
The well known "strong pseudoprime test" has its highest probability of error (ß 1=4) when...
This paper proves the existence of infinitely many Perrin pseudoprimes, as con-jectured by Adams and...
This paper proves the existence of infinitely many Perrin pseudoprimes, as con-jectured by Adams and...
Define ψm to be the smallest strong pseudoprime to all the first m prime bases. If we know the exact...