Main menu
Click categories to expand
A-Z listingplugin-autotooltip__plain plugin-autotooltip_bigA-Z listing
This is an alphabetical index of all content pages.
Other categories
Utilities
Also see
Importance Ratings
News
Legal
Donate/Sponsor
Curator's rationale
AI Policy
Twitter feed ð•
Feeds + s.e.o. etc.
rss / xml feed 
sitemap file
A-Z listing (archived)
The Newman conjecture was created by Morris Newman in 1960. It remains unsolved.
It's stated formally as :
For any integers m and r such that $${\displaystyle 0\leq r\leq m-1}$$ $${\displaystyle 0\leq r\leq m-1}$$the value of the partition function $${\displaystyle p(n)}$$ satisfies the congruence $${\displaystyle p(n)\equiv r{\pmod {m}}}$$ for infinitely many non-negative integers n.
In plain language :
Given arbitrary m, r, are there infinitely values of n such that the partition function at n is congruent to r mod m?
See : Periodicity Modulo m and Divisibility Properties of the Partition Function Transactions of the American Mathematical Society, Vol. 97, No. 2 pp. 225-236
And Wikipedia
Ideas for new topics, and suggested additions / corrections for older ones, are always welcome.
If you have skills or interests in a particular field, and have suggestions for Wikenigma, get in touch !
Or, if you'd like to become a regular contributor . . . request a login password. Registered users can edit the entire content of the site, and also create new pages.
( The 'Notes for contributors' section in the main menu has further information and guidelines etc.)
You are currently viewing an auto-translated version of Wikenigma
Please be aware that no automatic translation engines are 100% accurate, and so the auto-translated content will very probably feature errors and omissions.
Nevertheless, Wikenigma hopes that the translated content will help to attract a wider global audience.
DOKUWIKI IMPLEMENTATION DESIGN BY UNIV.ORG.UK NOVEMBER 2023