The Riemann Hypothesis and other curiosities

a topic in Logic & Mathematics, a part of the RPG forum.

Moderator: dealing with it

Let's talk about formal logics, mathematical models, and theoretical constructs.

The Riemann Hypothesis and other curiosities

Tips: 1.00 INK Postby LawOfTheLand on Mon Feb 25, 2019 10:53 pm

At DWI's request.

Preliminary reading:

This statement has been shown to have the curious property that if it cannot be proven false (that is, if a counterexample cannot be found), then it has to be true. This could open up new avenues of proof along the same lines as reductio ad absurdum, instead of proving statements directly. Such new proof methods could be used to answer central questions in mathematics like P=NP and the Collatz conjecture.

P=NP in particular is important to Bitcoin, where the idea of proof of work relies on the idea that P<NP. Put simply, it's the idea that some problems are harder to find a solution for than to verify that a given solution is correct.

What's your favorite unsolved problem in mathematics, and what inroads have been taken into solving it?

This verges hard into Gödel's incompleteness theorem and Tarski's undefinability theorem:

Tip jar: the author of this post has received 1.00 INK in return for their work.

User avatar
Member for 11 years
Beta Tester Promethean Conversation Starter Author World Builder Conversationalist Friendly Beginnings Novelist Builder Donated! Party Starter Contributor Person of Interest Bug Hunter Streamwatcher Maiden Voyager Recruiter Greeter Visual Appeal Tipworthy Property Buyer Salesman Concierge Arc Warden Lifegiver

Post a reply

Make a Donation


Become a Patron!

RPG relies exclusively on user donations to support the platform.

Donors earn the "Contributor" achievement and are permanently recognized in the credits. Consider donating today!


Who is online

Users browsing this forum: No registered users and 1 guest