Template:Number-theoretic algorithms - Revision history

Indicwiki: 2 revisions imported from :alpha:Template:Number-theoretic_algorithms

2023-05-25T05:51:19Z

2 revisions imported from alpha:Template:Number-theoretic_algorithms

← Older revision	Revision as of 11:21, 25 May 2023
(No difference)

alpha>Indicwiki at 07:37, 22 February 2023

2023-02-22T07:37:29Z

← Older revision		Revision as of 13:07, 22 February 2023
Line 31:		Line 31:
	\| list3 =* [[निरंतर अंश कारक। निरंतर अंश (CFRAC)]]		\| list3 =* [[निरंतर अंश कारक। निरंतर अंश (CFRAC)]]
	* [[डिक्सन का कारककरण विधि \| डिक्सन]]		* [[डिक्सन का कारककरण विधि \| डिक्सन]]
	* [[Lenstra अण्डाकार-वक्र ~~कारक।~~		* [[Lenstra अण्डाकार-वक्र कारक]]
	* [[Euler's फैक्टराइजेशन मेथड \| Euler's]]		* [[Euler's फैक्टराइजेशन मेथड \| Euler's]]
	* [[पोलार्ड्स आरएचओ एल्गोरिथ्म \| पोलार्ड्स आरएचओ]]		* [[पोलार्ड्स आरएचओ एल्गोरिथ्म \| पोलार्ड्स आरएचओ]]
Line 96:		Line 96:
	{{collapsible option}}		{{collapsible option}}

	~~[[Category:Computer science navigational boxes]]~~
	~~[[Category:Mathematics navigational boxes]]~~
	}}		}}

	</noinclude>[[Category: Templates ~~Vigyan Ready~~]][[Category:Templates ~~Translated in Hindi~~]]		</noinclude>

			[[Category:Templates Translated in Hindi]]
			[[Category:Templates Vigyan Ready]]

alpha>Indicwiki at 07:35, 22 February 2023

2023-02-22T07:35:54Z

Show changes

Indicwiki: 1 revision imported from :alpha:Template:Number-theoretic_algorithms

2022-12-26T08:16:27Z

1 revision imported from alpha:Template:Number-theoretic_algorithms

← Older revision	Revision as of 13:46, 26 December 2022
(No difference)

Admin: 1 revision imported

2022-08-28T03:16:42Z

1 revision imported

← Older revision	Revision as of 08:46, 28 August 2022
(No difference)

wikipedia>Rfc1394: add Trachtenberg system

2022-07-31T09:06:07Z

add Trachtenberg system

← Older revision		Revision as of 14:36, 31 July 2022
Line 103:		Line 103:
	* [[Montgomery reduction]]		* [[Montgomery reduction]]
	* [[Schoof's algorithm\|Schoof]]		* [[Schoof's algorithm\|Schoof]]
			* [[Trachtenberg system]]

alpha>Indicwiki: Created page with "{{Navbox | name = Number-theoretic algorithms | state = {{{state|uncollapsed}}} | title = Number-theoretic algorithms | listclass = hlist | group1 = P..."

2022-07-07T05:04:41Z

Created page with "{{Navbox | name = Number-theoretic algorithms | state = {{{state|uncollapsed}}} | title = Number-theoretic algorithms | listclass = hlist | group1 = P..."

New page

{{Navbox
| name = Number-theoretic algorithms
| state = {{{state|uncollapsed}}}
| title = [[number theory|Number-theoretic]] [[algorithm]]s
| listclass = hlist

| group1 = [[Primality test]]s
| list1 =
* [[AKS primality test|AKS]]
* [[Adleman–Pomerance–Rumely primality test|APR]]
* [[Baillie–PSW primality test|Baillie–PSW]]
* [[Elliptic curve primality |Elliptic curve]]
* [[Pocklington primality test|Pocklington]]
* [[Fermat primality test|Fermat]]
* [[Lucas primality test|Lucas]]
* ''[[Lucas–Lehmer primality test|Lucas–Lehmer]]''
* ''[[Lucas–Lehmer–Riesel test|Lucas–Lehmer–Riesel]]''
* ''[[Proth's theorem]]''
* ''[[Pépin's test|Pépin's]]''
* [[Quadratic Frobenius test|Quadratic Frobenius]]
* [[Solovay–Strassen primality test|Solovay–Strassen]]
* [[Miller–Rabin primality test|Miller–Rabin]]

| group2 = [[Generating primes|Prime-generating]]
| list2 =
* [[Sieve of Atkin]]
* [[Sieve of Eratosthenes]]
* [[Sieve of Pritchard]]
* [[Sieve of Sundaram]]
* [[Wheel factorization]]

| group3 = [[Integer factorization]]
| list3 =
* [[Continued fraction factorization|Continued fraction (CFRAC)]]
* [[Dixon's factorization method|Dixon's]]
* [[Lenstra elliptic-curve factorization|Lenstra elliptic curve (ECM)]]
* [[Euler's factorization method|Euler's]]
* [[Pollard's rho algorithm|Pollard's rho]]
* [[Pollard's p − 1 algorithm|''p'' − 1]]
* [[Williams's p + 1 algorithm|''p'' + 1]]
* [[Quadratic sieve|Quadratic sieve (QS)]]
* [[General number field sieve|General number field sieve (GNFS)]]
* ''[[Special number field sieve|Special number field sieve (SNFS)]]''
* [[Rational sieve]]
* [[Fermat's factorization method|Fermat's]]
* [[Shanks's square forms factorization|Shanks's square forms]]
* [[Trial division]]
* [[Shor's algorithm|Shor's]]

| group4 = [[Multiplication algorithm|Multiplication]]
| list4 =
* [[Ancient Egyptian multiplication|Ancient Egyptian]]
* [[Long multiplication|Long]]
* [[Karatsuba algorithm|Karatsuba]]
* [[Toom–Cook multiplication|Toom–Cook]]
* [[Schönhage–Strassen algorithm|Schönhage–Strassen]]
* [[Fürer's algorithm|Fürer's]]

| group5 = [[Euclidean division|Euclidean]] [[Division algorithm|division]]
| list5 =
* [[Binary division|Binary]]
* [[Chunking (division)|Chunking]]
* [[Fourier division|Fourier]]
* [[Goldschmidt division|Goldschmidt]]
* [[Newton–Raphson division|Newton-Raphson]]
* [[Long division|Long]]
* [[Short division|Short]]
* [[SRT division|SRT]]

| group6 = [[Discrete logarithm]]
| list6 =
* [[Baby-step giant-step]]
* [[Pollard's rho algorithm for logarithms|Pollard rho]]
* [[Pollard's kangaroo algorithm|Pollard kangaroo]]
* [[Pohlig–Hellman algorithm|Pohlig–Hellman]]
* [[Index calculus algorithm|Index calculus]]
* [[Function field sieve]]

| group7 = [[Greatest common divisor]]
| list7 =
* [[Binary GCD algorithm|Binary]]
* [[Euclidean algorithm|Euclidean]]
* [[Extended Euclidean algorithm|Extended Euclidean]]
* [[Lehmer's GCD algorithm|Lehmer's]]

| group8 = [[Quadratic residue|Modular square root]]
| list8 =
* [[Cipolla's algorithm|Cipolla]]
* [[Pocklington's algorithm|Pocklington's]]
* [[Tonelli–Shanks algorithm|Tonelli–Shanks]]
* [[Berlekamp–Rabin algorithm|Berlekamp]]
* [[Kunerth's algorithm|Kunerth]]

| group9 = Other algorithms
| list9 =
* [[Chakravala method|Chakravala]]
* [[Cornacchia's algorithm|Cornacchia]]
* [[Exponentiation by squaring]]
* [[Integer square root]]
* [[Integer relation algorithm|Integer relation]] ([[Lenstra–Lenstra–Lovász lattice basis reduction algorithm|LLL]]; [[Korkine–Zolotarev lattice basis reduction algorithm|KZ]])
* [[Modular exponentiation]]
* [[Montgomery reduction]]
* [[Schoof's algorithm|Schoof]]

| belowclass = hlist
| below =
* ''Italics'' indicate that algorithm is for numbers of special forms

}}<noinclude>
{{doc|content=
{{collapsible option}}

[[Category:Computer science navigational boxes]]
[[Category:Mathematics navigational boxes]]
}}
</noinclude>