Hi everyone
I encountered Agoh's Conjecture:
When n is prime.
Bn is the n th Bernoulli numer.
How can we extract modulo from fractions?
I red somewhere about minimal residue but i did not understand exacty what it is.
Can you give me some examples (modulo of fractions)?
Thank you for your time
Sorry i accidently posted the thread without complete it.
The whole statement is:
"
Hi everyone
I encountered Agoh's Conjecture:
When n is prime.
Bn is the n th Bernoulli numer.
How can we extract modulo from fractions?
I red somewhere about minimal residue but i did not understand exacty what it is.
Can you give me some examples (modulo of fractions)?
Thank you for your time
suppose
The 18th Bernoulli Number
=
from the equation:
REDUCES TO
The modular inverse of 42 with modulus 19 is 5.
43867 x 5 = 219335
The fractions are handled by using the modular inverse.
FYI:
The one millionth Bernoulli number has more than 4.7 million digits in the numerator.
&
The two millionth Bernoulli number has more than 10 million digits in the numerator.
for additional information see: Kellner, B. C. The Equivalence of Giuga’s and Agoh’s Conjectures. 15 Sep 2004.
which can be found here: [math/0409259] The Equivalence of Giuga's and Agoh's Conjectures.