Infinitely Many Carmichael Numbers for a Modified Miller-Rabin Prime Test
We define a variant of the Miller-Rabin primality test, which is in between Miller-Rabin and Fermat in terms of strength. We show that this test has infinitely many "Carmichael" numbers. We show that the test can also be thought of as a variant of the Solovay-Strassen test. We explore the...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Bach, Eric Fernando, Rex |
| description | We define a variant of the Miller-Rabin primality test, which is in between
Miller-Rabin and Fermat in terms of strength. We show that this test has
infinitely many "Carmichael" numbers. We show that the test can also be thought
of as a variant of the Solovay-Strassen test. We explore the growth of the
test's "Carmichael" numbers, giving some empirical results and a discussion of
one particularly strong pattern which appears in the results. |
| doi_str_mv | 10.48550/arxiv.1512.00444 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1512_00444</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1512_00444</sourcerecordid><originalsourceid>FETCH-LOGICAL-a674-46c26186757bcfaae811d2f7dc45580512548b069fccec5db8fa2cadc01294ef3</originalsourceid><addsrcrecordid>eNotz7FOwzAYBGAvHVDLAzDhF0iwXdtxxyoqEKkpCGWPftu_VUtOWjkFkbenFKbb7u4j5IGzUhql2BPk7_hVcsVFyZiU8o40zRjiGC-YZtrCONMa8hDdETDRw-dgMU80nDIF2p58DBE9bWNKmIsPsHGk7zkOSDucLiuyCJAmvP_PJemed139WuzfXpp6uy9AV7KQ2gnNja5UZV0AQMO5F6HyTipl2PWZksYyvQnOoVPemgDCgXeMi43EsF6Sx7_am6U_X_chz_2vqb-Z1j-KY0bE</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Infinitely Many Carmichael Numbers for a Modified Miller-Rabin Prime Test</title><source>arXiv.org</source><creator>Bach, Eric ; Fernando, Rex</creator><creatorcontrib>Bach, Eric ; Fernando, Rex</creatorcontrib><description>We define a variant of the Miller-Rabin primality test, which is in between
Miller-Rabin and Fermat in terms of strength. We show that this test has
infinitely many "Carmichael" numbers. We show that the test can also be thought
of as a variant of the Solovay-Strassen test. We explore the growth of the
test's "Carmichael" numbers, giving some empirical results and a discussion of
one particularly strong pattern which appears in the results.</description><identifier>DOI: 10.48550/arxiv.1512.00444</identifier><language>eng</language><subject>Computer Science - Data Structures and Algorithms ; Mathematics - Number Theory</subject><creationdate>2015-12</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1512.00444$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1512.00444$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Bach, Eric</creatorcontrib><creatorcontrib>Fernando, Rex</creatorcontrib><title>Infinitely Many Carmichael Numbers for a Modified Miller-Rabin Prime Test</title><description>We define a variant of the Miller-Rabin primality test, which is in between
Miller-Rabin and Fermat in terms of strength. We show that this test has
infinitely many "Carmichael" numbers. We show that the test can also be thought
of as a variant of the Solovay-Strassen test. We explore the growth of the
test's "Carmichael" numbers, giving some empirical results and a discussion of
one particularly strong pattern which appears in the results.</description><subject>Computer Science - Data Structures and Algorithms</subject><subject>Mathematics - Number Theory</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2015</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotz7FOwzAYBGAvHVDLAzDhF0iwXdtxxyoqEKkpCGWPftu_VUtOWjkFkbenFKbb7u4j5IGzUhql2BPk7_hVcsVFyZiU8o40zRjiGC-YZtrCONMa8hDdETDRw-dgMU80nDIF2p58DBE9bWNKmIsPsHGk7zkOSDucLiuyCJAmvP_PJemed139WuzfXpp6uy9AV7KQ2gnNja5UZV0AQMO5F6HyTipl2PWZksYyvQnOoVPemgDCgXeMi43EsF6Sx7_am6U_X_chz_2vqb-Z1j-KY0bE</recordid><startdate>20151201</startdate><enddate>20151201</enddate><creator>Bach, Eric</creator><creator>Fernando, Rex</creator><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20151201</creationdate><title>Infinitely Many Carmichael Numbers for a Modified Miller-Rabin Prime Test</title><author>Bach, Eric ; Fernando, Rex</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a674-46c26186757bcfaae811d2f7dc45580512548b069fccec5db8fa2cadc01294ef3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2015</creationdate><topic>Computer Science - Data Structures and Algorithms</topic><topic>Mathematics - Number Theory</topic><toplevel>online_resources</toplevel><creatorcontrib>Bach, Eric</creatorcontrib><creatorcontrib>Fernando, Rex</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Bach, Eric</au><au>Fernando, Rex</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Infinitely Many Carmichael Numbers for a Modified Miller-Rabin Prime Test</atitle><date>2015-12-01</date><risdate>2015</risdate><abstract>We define a variant of the Miller-Rabin primality test, which is in between
Miller-Rabin and Fermat in terms of strength. We show that this test has
infinitely many "Carmichael" numbers. We show that the test can also be thought
of as a variant of the Solovay-Strassen test. We explore the growth of the
test's "Carmichael" numbers, giving some empirical results and a discussion of
one particularly strong pattern which appears in the results.</abstract><doi>10.48550/arxiv.1512.00444</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.1512.00444 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_1512_00444 |
| source | arXiv.org |
| subjects | Computer Science - Data Structures and Algorithms Mathematics - Number Theory |
| title | Infinitely Many Carmichael Numbers for a Modified Miller-Rabin Prime Test |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-13T15%3A33%3A34IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Infinitely%20Many%20Carmichael%20Numbers%20for%20a%20Modified%20Miller-Rabin%20Prime%20Test&rft.au=Bach,%20Eric&rft.date=2015-12-01&rft_id=info:doi/10.48550/arxiv.1512.00444&rft_dat=%3Carxiv_GOX%3E1512_00444%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |