| Display title | Newman's conjecture |
| Default sort key | Newman's conjecture |
| Page length (in bytes) | 6,433 |
| Namespace ID | 0 |
| Page ID | 253517 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>SpringEdit |
| Date of page creation | 05:35, 9 March 2024 |
| Latest editor | imported>SpringEdit |
| Date of latest edit | 05:35, 9 March 2024 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In mathematics, specifically in number theory, Newman's conjecture is a conjecture about the behavior of the partition function modulo any integer. Specifically, it states that for any integers m and r such that $ 0\leq r\leq m-1 $, the value of the partition function $ p(n) $ satisfies the congruence... |
