Knowledge (XXG)

Template:Number-theoretic algorithms

Source 📝

581: 525: 689: 529: 37: 70: 705: 710: 394: 30: 262: 204: 133: 310: 108: 219: 257: 194: 596: 138: 101: 399: 290: 209: 199: 75: 227: 480: 475: 404: 305: 442: 356: 521: 511: 470: 246: 240: 214: 85: 506: 447: 409: 282: 128: 80: 424: 315: 535: 485: 465: 186: 161: 90: 545: 540: 432: 414: 389: 351: 95: 550: 516: 437: 341: 300: 295: 272: 176: 381: 328: 325: 166: 65: 122: 115: 501: 457: 171: 148: 346: 600: 336: 235: 366: 267: 252: 156: 57: 699: 610: 361: 46: 371: 15: 49: 575: 638:
will show the template collapsed, i.e. hidden apart from its title bar.
603:), it is hidden apart from its title bar; if not, it is fully visible. 595:, meaning that if there is another collapsible item on the page (a 19: 682: 674: 670: 566:
indicate that algorithm is for numbers of special forms
662:
will show the template expanded, i.e. fully visible.
641: 617: 494: 456: 423: 380: 324: 281: 185: 147: 56: 667:Editors can experiment in this template's sandbox 606:To change this template's initial visibility, the 31: 8: 38: 24: 16: 590:initial visibility currently defaults to 607: 7: 601:table with the collapsible attribute 706:Computer science navigational boxes 14: 247:Special number field sieve (SNFS) 241:General number field sieve (GNFS) 711:Number theory navigational boxes 579: 1: 205:Lenstra elliptic curve (ECM) 646:Number-theoretic algorithms 622:Number-theoretic algorithms 727: 666: 512:Exponentiation by squaring 195:Continued fraction (CFRAC) 690:Subpages of this template 559: 425:Greatest common divisor 584:Template documentation 536:Modular exponentiation 263:Shanks's square forms 187:Integer factorization 162:Sieve of Eratosthenes 541:Montgomery reduction 415:Function field sieve 390:Baby-step giant-step 236:Quadratic sieve (QS) 551:Trachtenberg system 517:Integer square root 458:Modular square root 177:Wheel factorization 129:Quadratic Frobenius 109:Lucas–Lehmer–Riesel 443:Extended Euclidean 382:Discrete logarithm 311:Schönhage–Strassen 167:Sieve of Pritchard 573: 572: 172:Sieve of Sundaram 718: 686: 678: 661: 660: 656: 653: 650: 647: 644: 637: 636: 632: 629: 626: 623: 620: 609: 608:|state= 593: 588:This template's 585: 583: 582: 522:Integer relation 495:Other algorithms 400:Pollard kangaroo 291:Ancient Egyptian 149:Prime-generating 134:Solovay–Strassen 47:Number-theoretic 40: 33: 26: 17: 726: 725: 721: 720: 719: 717: 716: 715: 696: 695: 694: 693: 688: 680: 668: 665: 658: 654: 651: 648: 645: 642: 634: 630: 627: 624: 621: 618: 597:navbox, sidebar 591: 586: 580: 578: 574: 569: 555: 490: 452: 419: 376: 320: 277: 181: 143: 116:Proth's theorem 58:Primality tests 52: 44: 12: 11: 5: 724: 722: 714: 713: 708: 698: 697: 679:and testcases 664: 663: 639: 577: 576: 571: 570: 568: 567: 560: 557: 556: 554: 553: 548: 543: 538: 533: 519: 514: 509: 504: 498: 496: 492: 491: 489: 488: 483: 478: 476:Tonelli–Shanks 473: 468: 462: 460: 454: 453: 451: 450: 445: 440: 435: 429: 427: 421: 420: 418: 417: 412: 410:Index calculus 407: 405:Pohlig–Hellman 402: 397: 392: 386: 384: 378: 377: 375: 374: 369: 364: 359: 357:Newton-Raphson 354: 349: 344: 339: 333: 331: 322: 321: 319: 318: 313: 308: 303: 298: 293: 287: 285: 283:Multiplication 279: 278: 276: 275: 270: 268:Trial division 265: 260: 255: 253:Rational sieve 250: 243: 238: 233: 225: 217: 212: 207: 202: 197: 191: 189: 183: 182: 180: 179: 174: 169: 164: 159: 157:Sieve of Atkin 153: 151: 145: 144: 142: 141: 136: 131: 126: 119: 112: 105: 98: 93: 88: 83: 81:Elliptic curve 78: 73: 68: 62: 60: 54: 53: 45: 43: 42: 35: 28: 20: 13: 10: 9: 6: 4: 3: 2: 723: 712: 709: 707: 704: 703: 701: 691: 684: 676: 672: 640: 616: 615: 614: 613:may be used: 612: 604: 602: 598: 594: 565: 562: 561: 558: 552: 549: 547: 544: 542: 539: 537: 534: 531: 527: 523: 520: 518: 515: 513: 510: 508: 505: 503: 500: 499: 497: 493: 487: 484: 482: 479: 477: 474: 472: 471:Pocklington's 469: 467: 464: 463: 461: 459: 455: 449: 446: 444: 441: 439: 436: 434: 431: 430: 428: 426: 422: 416: 413: 411: 408: 406: 403: 401: 398: 396: 393: 391: 388: 387: 385: 383: 379: 373: 370: 368: 365: 363: 360: 358: 355: 353: 350: 348: 345: 343: 340: 338: 335: 334: 332: 330: 327: 323: 317: 314: 312: 309: 307: 304: 302: 299: 297: 294: 292: 289: 288: 286: 284: 280: 274: 271: 269: 266: 264: 261: 259: 256: 254: 251: 249: 248: 244: 242: 239: 237: 234: 232: 230: 226: 224: 222: 218: 216: 215:Pollard's rho 213: 211: 208: 206: 203: 201: 198: 196: 193: 192: 190: 188: 184: 178: 175: 173: 170: 168: 165: 163: 160: 158: 155: 154: 152: 150: 146: 140: 137: 135: 132: 130: 127: 125: 124: 120: 118: 117: 113: 111: 110: 106: 104: 103: 99: 97: 94: 92: 89: 87: 84: 82: 79: 77: 74: 72: 69: 67: 64: 63: 61: 59: 55: 51: 48: 41: 36: 34: 29: 27: 22: 21: 18: 605: 592:autocollapse 589: 587: 563: 245: 228: 220: 139:Miller–Rabin 121: 114: 107: 102:Lucas–Lehmer 100: 23: 395:Pollard rho 352:Goldschmidt 86:Pocklington 76:Baillie–PSW 700:Categories 507:Cornacchia 502:Chakravala 50:algorithms 633:collapsed 611:parameter 481:Berlekamp 438:Euclidean 326:Euclidean 306:Toom–Cook 301:Karatsuba 657:expanded 448:Lehmer's 342:Chunking 329:division 258:Fermat's 673:| 564:Italics 486:Kunerth 466:Cipolla 347:Fourier 316:FĂŒrer's 210:Euler's 200:Dixon's 123:PĂ©pin's 687:pages. 683:create 675:mirror 671:create 546:Schoof 433:Binary 337:Binary 273:Shor's 91:Fermat 652:state 628:state 599:, or 367:Short 96:Lucas 362:Long 296:Long 526:LLL 372:SRT 231:+ 1 223:− 1 71:APR 66:AKS 702:: 659:}} 643:{{ 635:}} 619:{{ 530:KZ 528:; 692:. 685:) 681:( 677:) 669:( 655:= 649:| 631:= 625:| 532:) 524:( 229:p 221:p 39:e 32:t 25:v

Index

v
t
e
Number-theoretic
algorithms
Primality tests
AKS
APR
Baillie–PSW
Elliptic curve
Pocklington
Fermat
Lucas
Lucas–Lehmer
Lucas–Lehmer–Riesel
Proth's theorem
PĂ©pin's
Quadratic Frobenius
Solovay–Strassen
Miller–Rabin
Prime-generating
Sieve of Atkin
Sieve of Eratosthenes
Sieve of Pritchard
Sieve of Sundaram
Wheel factorization
Integer factorization
Continued fraction (CFRAC)
Dixon's
Lenstra elliptic curve (ECM)

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.

↑