This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A004023 Indices of prime repunits: numbers n such that 11...111 (with n 1's) = (10^n - 1)/9 is prime. (Formerly M2114) 110

%I M2114

%S 2,19,23,317,1031,49081,86453,109297,270343

%N Indices of prime repunits: numbers n such that 11...111 (with n 1's) = (10^n - 1)/9 is prime.

%C People who search for repunit primes or repdigit primes may be looking for this entry.

%C The indices of primes with digital product (i.e., product of digits) equal to 1.

%C As of August, 2014, only the first five repunits, through (10^1031-1)/9, have been proved prime. The last four repunits are known only to be probable primes and have not been proved to be prime. - _Robert Baillie_, Aug 17 2014

%C These indices p must also be prime. If p is not prime, say p = mn, then 10^mn - 1 = ((10^m)^n) - 1 => 10^m - 1 divides 10^mn - 1. Since 9 divides 10^m - 1 or (10^m-1)/9 = q, it follows q divides (10^p-1)/9. This is a result of the identity, a^n - b^n = (a-b)(a^(n-1) + a^(n-2)b + ... + b^(n-1). - _Cino Hilliard_, Dec 23 2008

%C The numbers R_n = 11...111 = (10^n - 1)/9 with n in this sequence A004023, except for n = 2, are prime repunits in base ten, so they are prime Brazilian numbers belonging to A085104. [See Links: Les nombres brésiliens.] - _Bernard Schott_, Dec 24 2012

%C Primality confirmed for (10^(49081)-1)/9 using sieve methods in Mathematica. - _Shivam N. Patel_, Dec 17 2015 [Probably it was only confirmed that this is a probable prime. - _N. J. A. Sloane_, Nov 10 2017]

%D J. Brillhart et al., Factorizations of b^n +- 1. Contemporary Mathematics, Vol. 22, Amer. Math. Soc., Providence, RI, 2nd edition, 1985; and later supplements.

%D J.-M. De Koninck, Ces nombres qui nous fascinent, Entry 19, pp 6, Ellipses, Paris 2008.

%D Graham, Knuth and Patashnik, Concrete Mathematics, Addison-Wesley, 1994; see p 146 problem 22.

%D T. Muller, Ist die Folge der Primzahl-quersummen beschrankt? Elem. Math. 66 (2011) 146-154 doi:10.4171/EM/183

%D Clifford A. Pickover, A Passion for Mathematics, Wiley, 2005; see p. 60.

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%H Paul Bourdelais, <a href="https://listserv.nodak.edu/cgi-bin/wa.exe?A2=NMBRTHRY;417ab0d6.0906">A Generalized Repunit Conjecture</a>, NMBRTHRY, 25 Jun 2009.

%H John Brillhart, <a href="/A001562/a001562.pdf">Letter to N. J. A. Sloane, Aug 08 1970</a>

%H John Brillhart et al., <a href="http://dx.doi.org/10.1090/conm/022">Factorizations of b^n +- 1</a>, Contemporary Mathematics, Vol. 22, Amer. Math. Soc., Providence, RI, 3rd edition, 2002.

%H Chris K. Caldwell, The Prime Glossary, <a href="http://primes.utm.edu/glossary/page.php?sort=Repunit">Repunit</a>

%H Patrick De Geest, <a href="http://www.worldofnumbers.com/circular.htm">Circular Primes</a>

%H Giovanni Di Maria, <a href="http://www.elektrosoft.it/matematica/repunit/repunit.htm">Repunit Primes Project</a>

%H Harvey Dubner, <a href="/A028491/a028491.pdf">Generalized repunit primes</a>, Math. Comp., 61 (1993), 927-930. [Annotated scanned copy]

%H Harvey Dubner, <a href="https://listserv.nodak.edu/cgi-bin/wa.exe?A2=NMBRTHRY;1d525256.9909">New probable prime repunit, R(49081)</a>, Number Theory List, Sep 09 1999.

%H Harvey Dubner, <a href="http://dx.doi.org/10.1090/S0025-5718-01-01319-9">Repunit R49081 is a probable prime</a>, Math. Comp., 71 (2001), 833-835.

%H Harvey Dubner, <a href="https://listserv.nodak.edu/cgi-bin/wa.exe?A2=NMBRTHRY;a9325f9e.0704">Posting to Number Theory List : Apr 03 2007</a>

%H Martianus Frederic Ezerman, Bertrand Meyer, and Patrick Solé, <a href="http://arxiv.org/abs/1210.7593">On Polynomial Pairs of Integers</a>, arXiv:1210.7593 [math.NT], 2012-2014.

%H Martianus Frederic Ezerman, Bertrand Meyer and Patrick Solé, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL18/Ezerman/eze3.html">On Polynomial Pairs of Integers</a>, Journal of Integer Sequences, Vol. 18 (2015), Article 15.3.5.

%H Makoto Kamada, <a href="http://stdkmd.com/nrr/repunit">Factorizations of 11...11 (Repunit)</a>.

%H Henri Lifchitz, <a href="http://www.primenumbers.net/Henri/us/MersFermus.htm">Mersenne and Fermat primes field</a>

%H Bernard Schott, <a href="/A125134/a125134.pdf">Les nombres brésiliens</a>, Quadrature, no. 76, avril-juin 2010, pages 30-38; included here with permission from the editors of Quadrature.

%H Andy Steward, <a href="http://www.users.globalnet.co.uk/~aads/primes.html">Prime Generalized Repunits</a>

%H Sam Wagstaff, Jr., <a href="http://www.cerias.purdue.edu/homes/ssw/cun/index.html">The Cunningham Project</a>

%H E. Wegrzynowski, <a href="http://www.lifl.fr/~wegrzyno/RepunitBase10/repbase101.html">Nombres 1_[n] premiers</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Repunit.html">Repunit</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/IntegerSequencePrimes.html">Integer Sequence Primes</a>

%H H. C. Williams and Harvey Dubner, <a href="http://dx.doi.org/10.1090/S0025-5718-1986-0856714-3">The primality of R1031</a>, Math. Comp., 47(176), Oct 1986, 703-711.

%H <a href="/index/Pri#Pri_rep">Index entries for primes involving repunits</a>

%e 2 appears because the 2-digit repunit 11 is prime.

%e 3 does not appear because 111 = 3 * 37 is not prime.

%e 19 appears because the 19-digit repunit 1111111111111111111 is prime.

%t Select[Range[271000], PrimeQ[FromDigits[PadRight[{}, #, 1]]] &] (* _Harvey P. Dale_, Nov 05 2011 *)

%t repUnsUpTo[k_] := ParallelMap[If[PrimeQ[#] && PrimeQ[(10^# - 1)/9], #, Nothing] &, Range[k]]; repUnsUpTo[5000] (* _Mikk Heidemaa_, Apr 24 2017 *)

%o (PARI) forprime(x=2,20000,if(ispseudoprime((10^x-1)/9),print1(x","))) \\ _Cino Hilliard_, Dec 23 2008

%o (MAGMA) [p: p in PrimesUpTo(500) | IsPrime((10^p - 1) div 9)]; // _Vincenzo Librandi_, Nov 06 2014

%Y See A004022 for the actual primes.

%Y Cf. A055557, A002275, A085104.

%K hard,nonn,nice,more,changed

%O 1,1

%A _N. J. A. Sloane_

%E 49081 found by Harvey Dubner - posting to Number Theory List (NMBRTHRY(AT)LISTSERV.NODAK.EDU) Sep 09, 1999.

%E 86453 found using pfgw (a faster version of PrimeForm) on Oct 26 2000 by Lew Baxter (ldenverb(AT)hotmail.com) - posting to Number Theory List (NMBRTHRY(AT)LISTSERV.NODAK.EDU), Oct 26, 2000.

%E a(8) = 109297 was apparently discovered independently by (in alphabetical order) _Paul Bourdelais_ and Harvey Dubner (harvey(AT)dubner.com) around Mar 26-28 2007.

%E A new probable prime repunit, R(270343), was found Jul 11 2007 by Maksym Voznyy (mvoznyy0526(AT)ROGERS.COM) and Anton Budnyy.

%E R(270343) subsequently confirmed as a(9) (see Repunit Primes Project link) by _Robert Price_, Dec 14 2010

%E Link to Repunit Primes Project site updated by _Felix Fröhlich_, Oct 19 2014

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 20 22:20 EDT 2018. Contains 315247 sequences. (Running on oeis4.)
The text passage is an entry from the On-Line Encyclopedia of Integer Sequences (OEIS) describing the sequence of indices of prime repunits. It provides background information, comments, references, and links related to the sequence.
no_question

the passage does not contain any explicit mathematical questions or problems to solve. it is primarily a descriptive entry about a specific integer sequence, providing context, properties, and references. while it mentions mathematical concepts and results, it does not pose any questions for the reader to answer.
Given a text passage, determine:
    1. If it contains a mathematical question (including word problems or calculations)
    2. If an answer to that mathematical question is provided in the text

First, describe the content structure you found in 1-2 sentences.

Then provide your analysis in the following format:
TYPE: <one of the following values>
- NO_QUESTION
- SINGLE_QUESTION
- SINGLE_QUESTION_WITH_ANSWER
- MULTIPLE_QUESTIONS
- MULTIPLE_QUESTIONS_WITH_ANSWERS
system
This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A004023 Indices of prime repunits: numbers n such that 11...111 (with n 1's) = (10^n - 1)/9 is prime. (Formerly M2114) 110

%I M2114

%S 2,19,23,317,1031,49081,86453,109297,270343

%N Indices of prime repunits: numbers n such that 11...111 (with n 1's) = (10^n - 1)/9 is prime.

%C People who search for repunit primes or repdigit primes may be looking for this entry.

%C The indices of primes with digital product (i.e., product of digits) equal to 1.

%C As of August, 2014, only the first five repunits, through (10^1031-1)/9, have been proved prime. The last four repunits are known only to be probable primes and have not been proved to be prime. - _Robert Baillie_, Aug 17 2014

%C These indices p must also be prime. If p is not prime, say p = mn, then 10^mn - 1 = ((10^m)^n) - 1 => 10^m - 1 divides 10^mn - 1. Since 9 divides 10^m - 1 or (10^m-1)/9 = q, it follows q divides (10^p-1)/9. This is a result of the identity, a^n - b^n = (a-b)(a^(n-1) + a^(n-2)b + ... + b^(n-1). - _Cino Hilliard_, Dec 23 2008

%C The numbers R_n = 11...111 = (10^n - 1)/9 with n in this sequence A004023, except for n = 2, are prime repunits in base ten, so they are prime Brazilian numbers belonging to A085104. [See Links: Les nombres brésiliens.] - _Bernard Schott_, Dec 24 2012

%C Primality confirmed for (10^(49081)-1)/9 using sieve methods in Mathematica. - _Shivam N. Patel_, Dec 17 2015 [Probably it was only confirmed that this is a probable prime. - _N. J. A. Sloane_, Nov 10 2017]

%D J. Brillhart et al., Factorizations of b^n +- 1. Contemporary Mathematics, Vol. 22, Amer. Math. Soc., Providence, RI, 2nd edition, 1985; and later supplements.

%D J.-M. De Koninck, Ces nombres qui nous fascinent, Entry 19, pp 6, Ellipses, Paris 2008.

%D Graham, Knuth and Patashnik, Concrete Mathematics, Addison-Wesley, 1994; see p 146 problem 22.

%D T. Muller, Ist die Folge der Primzahl-quersummen beschrankt? Elem. Math. 66 (2011) 146-154 doi:10.4171/EM/183

%D Clifford A. Pickover, A Passion for Mathematics, Wiley, 2005; see p. 60.

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%H Paul Bourdelais, <a href="https://listserv.nodak.edu/cgi-bin/wa.exe?A2=NMBRTHRY;417ab0d6.0906">A Generalized Repunit Conjecture</a>, NMBRTHRY, 25 Jun 2009.

%H John Brillhart, <a href="/A001562/a001562.pdf">Letter to N. J. A. Sloane, Aug 08 1970</a>

%H John Brillhart et al., <a href="http://dx.doi.org/10.1090/conm/022">Factorizations of b^n +- 1</a>, Contemporary Mathematics, Vol. 22, Amer. Math. Soc., Providence, RI, 3rd edition, 2002.

%H Chris K. Caldwell, The Prime Glossary, <a href="http://primes.utm.edu/glossary/page.php?sort=Repunit">Repunit</a>

%H Patrick De Geest, <a href="http://www.worldofnumbers.com/circular.htm">Circular Primes</a>

%H Giovanni Di Maria, <a href="http://www.elektrosoft.it/matematica/repunit/repunit.htm">Repunit Primes Project</a>

%H Harvey Dubner, <a href="/A028491/a028491.pdf">Generalized repunit primes</a>, Math. Comp., 61 (1993), 927-930. [Annotated scanned copy]

%H Harvey Dubner, <a href="https://listserv.nodak.edu/cgi-bin/wa.exe?A2=NMBRTHRY;1d525256.9909">New probable prime repunit, R(49081)</a>, Number Theory List, Sep 09 1999.

%H Harvey Dubner, <a href="http://dx.doi.org/10.1090/S0025-5718-01-01319-9">Repunit R49081 is a probable prime</a>, Math. Comp., 71 (2001), 833-835.

%H Harvey Dubner, <a href="https://listserv.nodak.edu/cgi-bin/wa.exe?A2=NMBRTHRY;a9325f9e.0704">Posting to Number Theory List : Apr 03 2007</a>

%H Martianus Frederic Ezerman, Bertrand Meyer, and Patrick Solé, <a href="http://arxiv.org/abs/1210.7593">On Polynomial Pairs of Integers</a>, arXiv:1210.7593 [math.NT], 2012-2014.

%H Martianus Frederic Ezerman, Bertrand Meyer and Patrick Solé, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL18/Ezerman/eze3.html">On Polynomial Pairs of Integers</a>, Journal of Integer Sequences, Vol. 18 (2015), Article 15.3.5.

%H Makoto Kamada, <a href="http://stdkmd.com/nrr/repunit">Factorizations of 11...11 (Repunit)</a>.

%H Henri Lifchitz, <a href="http://www.primenumbers.net/Henri/us/MersFermus.htm">Mersenne and Fermat primes field</a>

%H Bernard Schott, <a href="/A125134/a125134.pdf">Les nombres brésiliens</a>, Quadrature, no. 76, avril-juin 2010, pages 30-38; included here with permission from the editors of Quadrature.

%H Andy Steward, <a href="http://www.users.globalnet.co.uk/~aads/primes.html">Prime Generalized Repunits</a>

%H Sam Wagstaff, Jr., <a href="http://www.cerias.purdue.edu/homes/ssw/cun/index.html">The Cunningham Project</a>

%H E. Wegrzynowski, <a href="http://www.lifl.fr/~wegrzyno/RepunitBase10/repbase101.html">Nombres 1_[n] premiers</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Repunit.html">Repunit</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/IntegerSequencePrimes.html">Integer Sequence Primes</a>

%H H. C. Williams and Harvey Dubner, <a href="http://dx.doi.org/10.1090/S0025-5718-1986-0856714-3">The primality of R1031</a>, Math. Comp., 47(176), Oct 1986, 703-711.

%H <a href="/index/Pri#Pri_rep">Index entries for primes involving repunits</a>

%e 2 appears because the 2-digit repunit 11 is prime.

%e 3 does not appear because 111 = 3 * 37 is not prime.

%e 19 appears because the 19-digit repunit 1111111111111111111 is prime.

%t Select[Range[271000], PrimeQ[FromDigits[PadRight[{}, #, 1]]] &] (* _Harvey P. Dale_, Nov 05 2011 *)

%t repUnsUpTo[k_] := ParallelMap[If[PrimeQ[#] && PrimeQ[(10^# - 1)/9], #, Nothing] &, Range[k]]; repUnsUpTo[5000] (* _Mikk Heidemaa_, Apr 24 2017 *)

%o (PARI) forprime(x=2,20000,if(ispseudoprime((10^x-1)/9),print1(x","))) \\ _Cino Hilliard_, Dec 23 2008

%o (MAGMA) [p: p in PrimesUpTo(500) | IsPrime((10^p - 1) div 9)]; // _Vincenzo Librandi_, Nov 06 2014

%Y See A004022 for the actual primes.

%Y Cf. A055557, A002275, A085104.

%K hard,nonn,nice,more,changed

%O 1,1

%A _N. J. A. Sloane_

%E 49081 found by Harvey Dubner - posting to Number Theory List (NMBRTHRY(AT)LISTSERV.NODAK.EDU) Sep 09, 1999.

%E 86453 found using pfgw (a faster version of PrimeForm) on Oct 26 2000 by Lew Baxter (ldenverb(AT)hotmail.com) - posting to Number Theory List (NMBRTHRY(AT)LISTSERV.NODAK.EDU), Oct 26, 2000.

%E a(8) = 109297 was apparently discovered independently by (in alphabetical order) _Paul Bourdelais_ and Harvey Dubner (harvey(AT)dubner.com) around Mar 26-28 2007.

%E A new probable prime repunit, R(270343), was found Jul 11 2007 by Maksym Voznyy (mvoznyy0526(AT)ROGERS.COM) and Anton Budnyy.

%E R(270343) subsequently confirmed as a(9) (see Repunit Primes Project link) by _Robert Price_, Dec 14 2010

%E Link to Repunit Primes Project site updated by _Felix Fröhlich_, Oct 19 2014

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 20 22:20 EDT 2018. Contains 315247 sequences. (Running on oeis4.)
user
The text passage is an entry from the On-Line Encyclopedia of Integer Sequences (OEIS) describing the sequence of indices of prime repunits. It provides background information, comments, references, and links related to the sequence.

TYPE: NO_QUESTION

The passage does not contain any explicit mathematical questions or problems to solve. It is primarily a descriptive entry about a specific integer sequence, providing context, properties, and references. While it mentions mathematical concepts and results, it does not pose any questions for the reader to answer.