Talk:Repunit

From Wikipedia, the free encyclopedia

every repunit is a repdigit. --Abdull 20:08, 19 March 2006 (UTC)

[edit] Finitely many repunit primes?

The sum of the reciprocals of the repunit primes converges. This result could suggest the finiteness of Repunit primes, just like Brun's theorem could suggest the finiteness of twins.

The sum of the reciprocals of all repunit numbers also converges, but there are infinitely many repunit numbers. This says nothing about infinitude of repunit primes. Standard heuristics suggest there are probably infinitely many. PrimeHunter 12:48, 23 January 2007 (UTC)

Let the numbers of repunit primes be finite. Then, the sum of the reciprocals of the repunit primes diverges if there are infinitely many repunit primes. 218.133.184.93 08:57, 15 February 2007 (UTC)

No. As I said above, the sum of the reciprocals of all repunit numbers converges. Only some of the repunit numbers are repunit primes, so the sum of reciprocals of repunit primes is smaller. It converges whether there are infinitely many or not. PrimeHunter 11:59, 15 February 2007 (UTC)

Yes. Anything is true when the premise is false.218.133.184.93 04:42, 16 February 2007 (UTC)

The false premise is that 218.133.184.93's statement is relevant. — Arthur Rubin | (talk) 23:32, 13 August 2007 (UTC)

The false premise is that Arthur Rubin is busy.218.133.184.93 01:33, 16 August 2007 (UTC)

[edit] p = 2kn + 1

"Except for this case of R_3, p can only divide R_n if p = 2kn + 1 for some k."

How does this fit to 11 dividing every R_2n? --91.13.253.19 (talk) 22:46, 7 December 2007 (UTC)

Prime n had just been discussed and the quoted statement assumes n is prime. I have added it to the article for clarity.[1] PrimeHunter (talk) 00:09, 8 December 2007 (UTC)