| Display title | Primality by Wilson's theorem |
| Default sort key | Primality by Wilson's theorem |
| Page length (in bytes) | 90,129 |
| Namespace ID | 0 |
| Page ID | 12679 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 1 |
| Counted as a content page | Yes |
| Number of subpages of this page | 0 (0 redirects; 0 non-redirects) |
| Page views in the past month | 0 |
| Page image |  |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | rosettacode>A-ee |
| Date of page creation | 04:30, 1 January 2020 |
| Latest editor | Zeddicus (talk | contribs) |
| Date of latest edit | 12:28, 26 March 2025 |
| Total number of edits | 163 |
| Recent number of edits (within past 180 days) | 2 |
| Recent number of distinct authors | 2 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | Task Write a boolean function that tells whether a given integer is prime using Wilson's theorem. By Wilson's theorem, a number p is prime if and only if p divides... |
