Two computer scientists at at the University of Liverpool think they have successfully cracked the Erdős discrepancy problem (for a particular discrepancy bound C=2), an 80 year old maths puzzle proposed by the Hungarian mathematician Paul Erdős, who offered $500 for its solution.
They just can't be sure, because it is too big for a human to replicate.The resulting proof generated is an enormous 13 gigabytes, 30 percent larger than downloading all of the content on Wikipedia.
Erdős was fascinated by the extent to which an infinite sequence of numbers containing nothing but +1s and -1s contains internal patterns. One way to measure that is to cut the infinite sequence off at a certain point, and then create finite sub-sequences within that part of the sequence, such as considering only every third number or every fourth.
Adding up the numbers in a sub-sequence gives a figure called the discrepancy, which acts as a measure of the structure of the sub-sequence and in turn the infinite sequence, as compared with a uniform ideal.
Dr. Boris Konev and Dr. Alexei Lisitsa took a sequence 1,161 numbers long and managed to demonstrate that an infinite sequence will always have a discrepancy larger than two. The resulting proof and its 13 gigabytes is probably the longest proof ever and dwarfs another famously huge proof, the Classification Theorem of Finite Groups, which totaled 15,000 pages.
But, although checking this is beyond the reach of humans, they suggest future developments could change that landscape.
Lisitsa, from the University’s School of Electrical Engineering, Electronics and Computer Science, said, “On the one hand, it is true that our computer-generated solution is beyond the reach of humans to fully understand. On the other, all we can say for now is that at the moment there is no known ‘better’ human-comprehensible solution – but it does not mean that such a solution could not (or will not) be found in the future.”
Spot a pattern
Konev added, “Erdős’ hypothesis was that a discrepancy of any value can always be found, a far cry from the discrepancies of 1 and 2 that have now been proven. Our software has been running for weeks in an attempt to find a result for discrepancy 3. But even if subsequent programs show that higher and higher discrepancies exist for any infinite sequence, a computer cannot check the infinity of all numbers.”
Instead, it is likely that computer-assisted proofs for specific discrepancies will eventually enable a human to spot a pattern and come up with a proof for all numbers, Lisitsa concluded.
Source: University of Liverpool.
- PHYSICAL SCIENCES
- EARTH SCIENCES
- LIFE SCIENCES
- SOCIAL SCIENCES
Subscribe to the newsletter
Stay in touch with the scientific world!
Know Science And Want To Write?
- The Law has Failed, Not Forensic Science
- Energy-Space Photography Captures Light Behaving As A Wave And A Particle
- Sun's Impact On Climate Is Greater In Cool Periods
- The Real Meaning Of The Blue Black White Gold Dress
- Cats Use Sight Over Smell When Finding Food
- How Mr. Spock Changed Our Perception Of Science
- Francis Halzen On Cosmogenic Neutrinos
- "Seems to me, the primary subject to be defined by religion is that of the question of being. Ontology..."
- "That comment makes no sense. It's like if blue-eyed women were in charge and geared everything..."
- "Doug:I presume that the z=0 is to stipulate that we are within the plane of a thin disk. ..."
- "Leftists are a wacky species. It's simple, really. A white man is more likely to have the constellation..."
- "Hi T, Thanks for blogging on this. Are the pdf/ppt files of presentations available online? ..."
- University 'ethics boards' as a way to evade scientific controversy
- Human Activity May Be Supporting Growth of Harmful Algae in Lakes
- The more friends you drink with, the more you drink
- Why Are Girls More Likely to Die in Pediatric Intensive Care Units?
- Mobile phones have quietly become a global government ID device