Skip to content

GiugaNumbers ​

The Giuga numbers 30,858,1722,66198,…30, 858, 1722, 66198, … -- composite nn with p∣(n/p−1)p \mid (n/p - 1) for every prime p∣np \mid n -- as an indexed collection of unknown count.

GiugaNumbersthe composite nn satisfying Giuga's divisibility condition, an indexed collection of unknown count.

Domain: Collections

Details
  • Count(GiugaNumbers)=NaNCount(GiugaNumbers) = NaN: only a handful are known, none odd, and Giuga's conjecture (that no counterexample to Giuga's primality criterion exists, equivalently no Giuga number is a counterexample) is open -- so whether the family is finite is open too.
  • AtAt reads off a table of the known Giuga numbers; past that table it returns unevaluated rather than scanning forever, since no predicate here could safely keep searching.
  • OEIS A007850. Equivalently, nn is Giuga iff ∑p∣n1/p−∏p∣n1/p\sum_{p \mid n} 1/p - \prod_{p \mid n} 1/p is a positive integer.
  • Membership goes through Element: Element(30,GiugaNumbers)Element(30, GiugaNumbers) is true (30=2⋅3⋅530 = 2 \cdot 3 \cdot 5: 2∣(15−1)2 \mid (15-1), 3∣(10−1)3 \mid (10-1), 5∣(6−1)5 \mid (6-1)), Element(6,GiugaNumbers)Element(6, GiugaNumbers) is false.

Enumeration

Examples

3 more kept as data, checked against the oracles
About
Examples3
CrosswalkOEIS

See also: Count, At, Element, CarmichaelNumbers