Talk:List of unsolved problems in mathematics
This is the talk page for discussing improvements to the List of unsolved problems in mathematics article. This is not a forum for general discussion of the article's subject. |
Article policies
|
Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL |
Archives: Index, 1, 2Auto-archiving period: 375 days ![]() |
![]() | The contents of the Lists of unsolved problems in mathematics page were merged into List of unsolved problems in mathematics on 17:47, 15 January 2015 (UTC). For the contribution history and old versions of the redirected page, please see its history; for the discussion at that location, see its talk page. |
![]() | This article is rated List-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||||||||||||
|
![]() | Daily pageviews of this article
A graph should have been displayed here but graphs are temporarily disabled. Until they are enabled again, visit the interactive graph at pageviews.wmcloud.org |
![]() Archives (Index) |
This page is archived by ClueBot III.
|
Set theory note
[edit]There was a 2021 edit at the start of the set theory section that reads a little odd. It reads
- Note: These conjectures are about models of Zermelo-Frankel set theory with choice, and may not be able to be expressed in models of other set theories such as the various constructive set theories or non-wellfounded set theory.
Given any FOL Set theory (many here List_of_first-order_theories#Set_theories) with the same signature (the bulk just works with \in and not more), a problem expressed in the language is the same for any of them. What's probably meant here is (and that's my proposed replacement)
- The notable conjectures in the subject of set theory were typically formulated in the context of Zermelo-Frankel set theory, and usually with Choice. By the completeness theorem, the problems may be understood as concerning the models thereof. The provability of the conjectures listed below might not be open in other set theories, such as ones over a logic or with axioms that are weaker, stronger or conflicting with it (e.g. a constructive set theory, Tarski-Grothendieck set theory resp. a non-wellfounded set theory.)
In fact the middle sentence mentioning models is probably even redundant also.
--178.115.55.162 (talk) 17:15, 21 November 2023 (UTC)
Change in section title
[edit]"Problems solved since 1995" was recently changed to "problems solved in the last 30 years". I think the former title should be used. See Wikipedia:Manual_of_Style/Dates_and_numbers#Statements_likely_to_become_outdated. Bubba73 You talkin' to me? 01:52, 20 January 2024 (UTC)
- Based on the MoS outline, agreed. GalacticShoe (talk) 02:14, 20 January 2024 (UTC)
Semi-protected edit request on 17 June 2024
[edit]![]() | This edit request has been answered. Set the |answered= or |ans= parameter to no to reactivate your request. |
i want to add an unsolved math question which is (12 45 ∏ 61
35)! 2601:603:4C7F:B6D0:68E7:C8AD:7A34:6A7 (talk) 17:07, 17 June 2024 (UTC)
- What does it mean? —Tamfang (talk) 23:49, 17 June 2024 (UTC)
Not done for now: Critical lack of explanation why this should be included in the list, and no sources. ABG (Talk/Report any mistakes here) 23:55, 17 June 2024 (UTC)
Removal of solved problems from the unsolved section
[edit]Like the Erdős-Heilbronn conjecture. 2405:201:5502:C989:D1F5:2160:CCE8:4F0A (talk) 05:16, 15 July 2024 (UTC)
Done Any other ones you noticed? GalacticShoe (talk) 06:34, 15 July 2024 (UTC)
2 new conjectures
[edit]The conjecture asks, whether Graham's number - 4 is a prime.
Graham's number: a power of 3
Graham's number - 1: even
Graham's number - 2: a multiple of 5
Graham's number - 3: an even multiple of 3
Graham's number - 4: unknown
2. repunit power conjecture
There are infinitely many cubes of the form 3 mod 4.: 27, 343, 1331, 3375, 6859, 12167, 19683, 29791, 42875, 59319, 79507, 103823, 132651, 166375, 205379, ... (A016839)
There are infinitely many fifth powers of the form 3 mod 4.: 243, 16807, 161051, 759375, 2476099, ... (A016841)
This goes on with any odd exponent.
So, the conjecture asks, whether a repunit other than 1 can be equal to an, where a is an integer and n is odd and greater than 1.
It is sure, that a repunit other than 1 can never be a square, because squares can never be of the form 3 mod 4, while repunits other than 1 are always of the form 3 mod 4. 94.31.89.138 (talk) 19:53, 28 July 2024 (UTC)
- This is not the place to pose new conjectures. All content here, as in all Wikipedia articles, must be based on reliably-published sources. If you have citations for sources for conjectures to be added, they can be listed here. If not, then they need to be published elsewhere before they can be considered here. —David Eppstein (talk) 20:28, 28 July 2024 (UTC)
Start a discussion about improving the List of unsolved problems in mathematics page
Talk pages are where people discuss how to make content on Wikipedia the best that it can be. You can use this page to start a discussion with others about how to improve the "List of unsolved problems in mathematics" page.