Jump to content

Information for "AKS test for primes"

Basic information

Display titleAKS test for primes
Default sort keyAKS test for primes
Page length (in bytes)199,969
Namespace ID0
Page ID9910
Page content languageen - English
Page content modelwikitext
Indexing by robotsAllowed
Number of redirects to this page0
Counted as a content pageYes
Number of subpages of this page0 (0 redirects; 0 non-redirects)
Page views in the past month0

Page protection

EditAllow all users (infinite)
MoveAllow all users (infinite)
View the protection log for this page.

Edit history

Page creatorrosettacode>Paddy3118
Date of page creation20:20, 6 February 2014
Latest editorZeddicus (talk | contribs)
Date of latest edit14:16, 13 January 2025
Total number of edits330
Recent number of edits (within past 180 days)17
Recent number of distinct authors5

Page properties

Hidden category (1)

This page is a member of a hidden category:

Transcluded templates (12)

Templates used on this page:

SEO properties

Description

Content

Article description: (description)
This attribute controls the content of the description and og:description elements.
The AKS algorithm for testing whether a number is prime is a polynomial-time algorithm based on an elementary theorem about Pascal triangles. The theorem on which...
Information from Extension:WikiSEO
Cookies help us deliver our services. By using our services, you agree to our use of cookies.