Pengguna:Dedhert.Jr/Uji halaman 01/8

Teorema Euklides–Euler adalah sebuah teorema dalam teori bilangan yang mengaitkan bilangan sempurna dengan bilangan prima Mersenne. Teorema ini mengatakan bahwa bilangan genap dikatakan sempurna jika dan hanya jika bilangan tersebut mempunyai bentuk 2^p−1(2^p − 1), dengan 2^p − 1 adalah bilangan prima. Teorema ini dinamai dari matematikawan bernama Euklides yang membuktikan aspek dari teorema "jika", dan Leonhard Euler yang membuktikan aspek dari teorema "hanya jika".

Teorema ini telah diduga bahwa ada tak berhingga banyaknya bilangan prima Mersenne. Walaupun kebenaran dari konjektur ini masih belum terungkap, tetapi menurut teorema Euklides–Euler, ini menyerupai dengan sebuah konjektur yang katanya ada tak berhingga banyaknya bilangan sempurna genap. Sayangnya, masih dibelum ketahui adakah bilangan sempurna ganjil yang tunggal.

Pernyataan dan contoh

Sebuah billngan sempurna adalah sebuah bilangan asli yang sama dengan jumlah dari pembagi wajarnya, dan bilangan-bilangan tersebut lebih dari kecilnya dan kemudian membaginya sama rata (sampai tidak ada sisa). Sebagai contoh, pembagi wajar dari 6 adalah 1, 2, dan 3, yang hasilnya menjadi 6 saat dijumlahkan. Dengan demikian, 6 adalah bilangan sempurna.

Sebuah bilangan prima Mersenne adalah sebuah bilangan prima yang berbentuk M_p = 2^p − 1, sebuah bilangan yang lebih kecil dari perpangkatan dari dua. Agar bilangan dari bentuk tersebut berupa bilangan prima, maka p sendiri juga harus bilangan prima, tetapi tak semua bilangan prima menghasilkan bilangan prima Mersenne melalui cara ini. Sebagai contoh, 2³ − 1 = 7 adalah bilangan prima Mersenne, sedangkan 2¹¹ − 1 = 2047 = 23 × 89 bukan.

Teorema Eukildes–Euler mengatakan bahwa sebuah bilangan asli genap disebut sempurna jika dan hanya jika bilangan tersebut berbentuk 2^p−1M_p, dengan M_p adalah bilangan prima Mersenne. Sebagai contoh, bilangan sempurna 6 didapatkan ketika memasukkan p = 2 ke 2²⁻¹M₂ = 2 × 3 = 6; dan memasukkan bilangan prima Mersenne 7 ke ekspresi yang serupa memperoleh bilangan sempurna 28.

History

Euclid proved that 2^p−1(2^p − 1) is an even perfect number whenever 2^p − 1 is prime. This is the final result on number theory in Euclid's Elements; the later books in the Elements instead concern irrational numbers, solid geometry, and the golden ratio. Euclid expresses the result by stating that if a finite geometric series beginning at 1 with ratio 2 has a prime sum q, then this sum multiplied by the last term t in the series is perfect. Expressed in these terms, the sum q of the finite series is the Mersenne prime 2^p − 1 and the last term t in the series is the power of two 2^p−1. Euclid proves that qt is perfect by observing that the geometric series with ratio 2 starting at q, with the same number of terms, is proportional to the original series; therefore, since the original series sums to q = 2t − 1, the second series sums to q(2t − 1) = 2qt − q, and both series together add to 2qt, two times the supposed perfect number. However, these two series are disjoint from each other and (by the primality of q) exhaust all the divisors of qt, so qt has divisors that sum to 2qt, showing that it is perfect.

Over a millennium after Euclid, Alhazen ca 1000 CE conjectured that every even perfect number is of the form 2^p−1(2^p − 1) where 2^p − 1 is prime, but he was not able to prove this result. It was not until the 18th century, over 2000 years after Euclid, that Leonhard Euler proved that the formula 2^p−1(2^p − 1) will yield all the even perfect numbers. Thus, there is a one-to-one relationship between even perfect numbers and Mersenne primes; each Mersenne prime generates one even perfect number, and vice versa. After Euler's proof of the Euclid–Euler theorem, other mathematicians have published different proofs, including Victor-Amédée Lebesgue, Robert Daniel Carmichael, Leonard Eugene Dickson, John Knopfmacher, and Wayne L. McDaniel. Dickson's proof, in particular, has been commonly used in textbooks.

This theorem was included in a web listing of the "top 100 mathematical theorems", dating from 1999, which later became used by Freek Wiedijk as a benchmark set to test the power of different proof assistants. Hingga 2021, the proof of the Euclid–Euler theorem had been formalized in 5 of the 10 proof assistants recorded by Wiedijk.

Proof

Euler's proof is short and depends on the fact that the sum of divisors function σ is multiplicative; that is, if a and b are any two relatively prime integers, then σ(ab) = σ(a)σ(b). For this formula to be valid, the sum of divisors of a number must include the number itself, not just the proper divisors. A number is perfect if and only if its sum of divisors is twice its value.

Sufficiency

One direction of the theorem (the part already proved by Euclid) immediately follows from the multiplicative property: every Mersenne prime gives rise to an even perfect number. When 2^p − 1 is prime, $\sigma (2^{p-1}(2^{p}-1))=\sigma (2^{p-1})\sigma (2^{p}-1).$ The divisors of 2^p−1 are 1, 2, 4, 8, ..., 2^p−1. The sum of these divisors is a geometric series whose sum is 2^p − 1. Next, since 2^p − 1 is prime, its only divisors are 1 and itself, so the sum of its divisors is 2^p.

Combining these, $${\begin{aligned}\sigma (2^{p-1}(2^{p}-1))&=\sigma (2^{p-1})\sigma (2^{p}-1)\\&=(2^{p}-1)(2^{p})\\&=2(2^{p-1})(2^{p}-1).\end{aligned}}$$ Therefore, 2^p−1(2^p − 1) is perfect.

Necessity

In the other direction, suppose that an even perfect number has been given, and partially factor it as 2^kx, where x is odd. For 2^kx to be perfect, the sum of its divisors must be twice its value:

$2^{k+1}x=\sigma (2^{k}x)=(2^{k+1}-1)\sigma (x).$

(∗)

The odd factor 2^k+1 − 1 on the right side of (∗) is at least 3, and it must divide x, the only odd factor on the left side, so y = x/(2^k+1 − 1) is a proper divisor of x. Dividing both sides of (∗) by the common factor 2^k+1 − 1 and taking into account the known divisors x and y of x gives

$2^{k+1}y=\sigma (x)=x+y+{}$other divisors${}=2^{k+1}y+{}$other divisors.

For this equality to be true, there can be no other divisors. Therefore, y must be 1, and x must be a prime of the form 2^k+1 − 1.