location:  Publications → journals
Search results

Search: MSC category 11A51 ( Factorization; primality )

 Expand all        Collapse all Results 1 - 2 of 2

1. CMB 2015 (vol 58 pp. 869)

Wright, Thomas
 Variants of Korselt's Criterion Under sufficiently strong assumptions about the first term in an arithmetic progression, we prove that for any integer $a$, there are infinitely many $n\in \mathbb N$ such that for each prime factor $p|n$, we have $p-a|n-a$. This can be seen as a generalization of Carmichael numbers, which are integers $n$ such that $p-1|n-1$ for every $p|n$. Keywords:Carmichael number, pseudoprime, Korselt's Criterion, primes in arithmetic progressionsCategory:11A51

2. CMB 2007 (vol 50 pp. 158)

Tipu, Vicentiu
 A Note on Giuga's Conjecture Let $G(X)$ denote the number of positive composite integers $n$ satisfying $\sum_{j=1}^{n-1}j^{n-1}\equiv -1 \tmod{n}$. Then $G(X)\ll X^{1/2}\log X$ for sufficiently large $X$. Category:11A51
 top of page | contact us | privacy | site map |