Giuga number

Giuga number

A Giuga number is a composite number "n" such that each of its distinct prime factors "p""i" is a divisor of {n over p_i} - 1. Another test is if the congruence nB_{phi(n)} equiv -1 pmod n holds true, where "B" is a Bernoulli number. The Giuga numbers are named after the mathematician Giuseppe Giuga, and relate to his conjecture on primality.

The sequence of Giuga numbers begins

:30, 858, 1722, 66198, 2214408306, … OEIS|id=A007850.

For example, 30 is a Giuga number since its prime factors are 2, 3 and 5, and we can verify that

* 30/2 - 1 = 14, which is divisible by 2,
* 30/3 - 1 = 9, which is 3 squared, and
* 30/5 - 1 = 5, the third prime factor itself.

The prime factors of a Giuga number must be distinct. If p^2 divides n, then it follows that {n over p} - 1 = n'-1, where n' is divisible by p. Hence, n'-1 would not be divisible by p, and thus n would not be a Giuga number.

Thus, only square-free integers can be Giuga numbers. For example, the factors of 60 are 2, 2, 3 and 5, and 60/2 - 1 = 29, which is not divisible by 2. Thus, 60 is not a Giuga number.

This rules out squares of primes, but semiprimes cannot be Giuga numbers either. For if n=p_1p_2, with p_1 primes, then{n over p_2} - 1 =p_1 - 1 , so p_2 will not divide {n over p_2} - 1 , and thus n is not a Giuga number.

All known Giuga numbers are even. If an odd Giuga number exists, it must be the product of at least 14 primes. It is not known if there are infinitely many Giuga numbers.

ee also

*Carmichael number

References

* Borwein, D.; Borwein, J. M.; Borwein, P. B.; and Girgensohn, R. "Giuga's Conjecture on Primality." "American Mathematical Monthly" 103, 40-50, 1996.


Wikimedia Foundation. 2010.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • 60000 (number) — Number number = 60000 range = 10000 100000 cardinal = 60000 ordinal = th ordinal text = sixty thousandth factorization = 2^5 cdot 3 cdot 5^4 bin = 1110101001100000 oct = 165140 hex = EA6060,000 (sixty thousand) is the number that comes after… …   Wikipedia

  • Nombre de Giuga — En mathématiques, un nombre de Giuga est[1] un entier naturel n composé qui satisfait à la congruence D après le petit théorème de Fermat les nombres premiers satisfont à la congruence. Giuga conjectura en 1950 que l ensemble des nombres composés …   Wikipédia en Français

  • 1000 (number) — List of numbers Integers ← 1k 2k 3k 4k 5k 6k 7k 8k 9k → Cardinal 1000 one thousand …   Wikipedia

  • 800 (number) — This article is about the number 800. For the Common Era Year 800, see 800. For other uses, see 800 (disambiguation) 800 (eight hundred) is the natural number following 799 and preceding 801. List of numbers Integers ← 0 100 200 300 400 500 600… …   Wikipedia

  • 30 (number) — ← 29 31 → 30 ← 30 31 32 33 34 35 36 …   Wikipedia

  • Primary pseudoperfect number — In mathematics, and particularly in number theory, a primary pseudoperfect number is a number N that satisfies the Egyptian fraction equation:sum {p|N}frac1p + frac1N = 1,where the sum is over only the prime divisors of N . Equivalently (as can… …   Wikipedia

  • Agoh–Giuga conjecture — In number theory the Agoh–Giuga conjecture on the Bernoulli numbers B k postulates that p is a prime number if and only if :pB {p 1} equiv 1 pmod p. The conjecture as stated is due to Takashi Agoh (1990); an equivalent formulation is due to… …   Wikipedia

  • Prime number — Prime redirects here. For other uses, see Prime (disambiguation). A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself. A natural number greater than 1 that is not a prime number is… …   Wikipedia

  • Bernoulli number — In mathematics, the Bernoulli numbers Bn are a sequence of rational numbers with deep connections to number theory. They are closely related to the values of the Riemann zeta function at negative integers. There are several conventions for… …   Wikipedia

  • List of number theory topics — This is a list of number theory topics, by Wikipedia page. See also List of recreational number theory topics Topics in cryptography Contents 1 Factors 2 Fractions 3 Modular arithmetic …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”