Stories
Slash Boxes
Comments

SoylentNews is people

posted by Fnord666 on Tuesday March 23 2021, @09:11PM   Printer-friendly
from the solving-the-puzzle-did-not-cause-any-harm-to-mice dept.

After Cracking the "Sum of Cubes" Puzzle for 42, Mathematicians Solve Harder Problem That Has Stumped Experts for Decades:

The 21-digit solution to the decades-old problem suggests many more solutions exist.

What do you do after solving the answer to life, the universe, and everything? If you're mathematicians Drew Sutherland and Andy Booker, you go for the harder problem.

In 2019, Booker, at the University of Bristol, and Sutherland, principal research scientist at MIT, were the first to find the answer to 42. The number has pop culture significance as the fictional answer to "the ultimate question of life, the universe, and everything," as Douglas Adams famously penned in his novel "The Hitchhiker's Guide to the Galaxy." The question that begets 42[*], at least in the novel, is frustratingly, hilariously unknown.

In mathematics, entirely by coincidence, there exists a polynomial equation for which the answer, 42, had similarly eluded mathematicians for decades. The equation x3+y3+z3=k is known as the sum of cubes problem. While seemingly straightforward, the equation becomes exponentially difficult to solve when framed as a "Diophantine equation" — a problem that stipulates that, for any value of k, the values for x, y, and z must each be integers.

When the sum of cubes equation is framed in this way, for certain values of k, the integer solutions for x, y, and z can grow to enormous numbers. The number space that mathematicians must search across for these numbers is larger still, requiring intricate and massive computations.

Over the years, mathematicians had managed through various means to solve the equation, either finding a solution or determining that a solution must not exist, for every value of k between 1 and 100 — except for 42.

In September 2019, Booker and Sutherland, harnessing the combined power of half a million home computers around the world, for the first time found a solution to 42. The widely reported breakthrough spurred the team to tackle an even harder, and in some ways more universal problem: finding the next solution for 3.

Booker and Sutherland have now published the solutions for 42 and 3, along with several other numbers greater than 100, recently in the Proceedings of the National Academy of Sciences.

[*] 42: Wikipedia Entry.

Journal Reference:
Andrew R. Booker, Andrew V. Sutherland. On a question of Mordell [open], Proceedings of the National Academy of Sciences (DOI: 10.1073/pnas.2022377118)

Previously:
Sum-of-Three-Cubes Problem Solved for "Stubborn" Number 33.


Original Submission

 
This discussion has been archived. No new comments can be posted.
Display Options Threshold/Breakthrough Mark All as Read Mark All as Unread
The Fine Print: The following comments are owned by whoever posted them. We are not responsible for them in any way.
  • (Score: 2) by Mojibake Tengu on Tuesday March 23 2021, @11:59PM (2 children)

    by Mojibake Tengu (8598) on Tuesday March 23 2021, @11:59PM (#1128136) Journal

    Anything a mathematician proves on paper I can prove on a computer by a Prolog program. Often lazily by letting the program to find a proof herself.

    This has nothing to do with brute force numerical calculations. All I need is a proper formulation of a problem, in a relevant logical paradigm.

    In Category Theory and Linear Logic, any abstract program is a proof of something and this was already proved long ago. This applies to all computer programs too.

    I despise numerical calculations, actually. And all those current fake-AI tensor devilish monsters creeping on GPUs everywhere. Your professor was rightly afraid of those numerical devils coming to his lawn, but he did not see only truly logical AIPs could reach the final supremacy over humans.

    --
    The edge of 太玄 cannot be defined, for it is beyond every aspect of design
    Starting Score:    1  point
    Karma-Bonus Modifier   +1  

    Total Score:   2  
  • (Score: 0) by Anonymous Coward on Wednesday March 24 2021, @05:53AM

    by Anonymous Coward on Wednesday March 24 2021, @05:53AM (#1128245)

    Have fun:

    What is the shortest algorithm to cover an infinite square grid with any given arbitrary set of square tiles with colored edges (i.e. Wang tiles) with an infinite number of each tile such that all tile edges match color?

  • (Score: 3, Touché) by hendrikboom on Wednesday March 24 2021, @02:07PM

    by hendrikboom (1125) on Wednesday March 24 2021, @02:07PM (#1128357) Homepage Journal

    Anything a mathematician proves on paper I can prove on a computer by a Prolog program. Often lazily by letting the program to find a proof herself.

    Actually, it turns out not to be that easy in practice.

    It's not even that easy in theory -- Prolog has only a limited proof-theoretic strength.

    -- hendrik