- In
number theory the Agoh–
Giuga conjecture on the
Bernoulli numbers Bk
postulates that p is a
prime number if and only if p B p − 1 ≡ − 1 ( mod p ) ....
- A
Giuga number is a
composite number n such that for each of its
distinct prime factors pi we have pi|(npi−1){\displaystyle p_{i}|\left({n \over p_{i}}-1\right)}...
-
tribonacci number 66,049 = 2572,
palindromic in
hexadecimal (1020116) 66,198 =
Giuga number 66,666 =
repdigit 67,081 = 2592,
palindromic in base 6 (12343216)...
- sum of
distinct divisors of 888. 888 is
equal to the sum of the
first two
Giuga numbers: 30 + 858 = 888.
There are exactly: 888
trees with four unlabeled...
-
divisor related numbers Blum
Cyclic Erdős–Nicolas Erdős–Woods
Friendly Giuga Harmonic divisor Jordan–Pólya Lucas–Carmichael
Pronic Regular Rough Smooth...
- Chen prime,
Eisenstein prime with no
imaginary part 858 = 2 × 3 × 11 × 13,
Giuga number 859 =
prime number,
number of
planar partitions of 11,
prime index...
- (p-1)\cdot 1\equiv -1{\pmod {p}},}
valid whenever p {\displaystyle p} is prime.
Giuga's conjecture says that this
equation is also a
sufficient condition for p...
-
divisor related numbers Blum
Cyclic Erdős–Nicolas Erdős–Woods
Friendly Giuga Harmonic divisor Jordan–Pólya Lucas–Carmichael
Pronic Regular Rough Smooth...
-
divisor related numbers Blum
Cyclic Erdős–Nicolas Erdős–Woods
Friendly Giuga Harmonic divisor Jordan–Pólya Lucas–Carmichael
Pronic Regular Rough Smooth...
-
divisor related numbers Blum
Cyclic Erdős–Nicolas Erdős–Woods
Friendly Giuga Harmonic divisor Jordan–Pólya Lucas–Carmichael
Pronic Regular Rough Smooth...
