BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Discrete Mathematics Group - ECPv6.18.0//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Discrete Mathematics Group
X-ORIGINAL-URL:https://dimag.ibs.re.kr
X-WR-CALDESC:Events for Discrete Mathematics Group
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Asia/Seoul
BEGIN:STANDARD
TZOFFSETFROM:+0900
TZOFFSETTO:+0900
TZNAME:KST
DTSTART:20250101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20261201T163000
DTEND;TZID=Asia/Seoul:20261201T173000
DTSTAMP:20261012T113621Z
CREATED:20261012T113621Z
LAST-MODIFIED:20261012T113621Z
UID:13611-1796142600-1796146200@dimag.ibs.re.kr
SUMMARY:William J. Wesley\, An elementary solution to the 2-color Pythagorean triples problem
DESCRIPTION:In the 1980s\, Ron Graham asked whether every red/blue coloring of the positive integers contains a monochromatic Pythagorean triple and offered a $100 prize for the answer. The bounty was claimed in 2016 by Heule\, Kullmann\, and Marek\, who showed that every such coloring of [1\,7825] has a monochromatic triple. Their proof used SAT solvers and took over 50\,000 CPU hours to produce and verify. In this talk we will present an elementary solution to Graham’s problem that requires neither deep analytic arguments nor extensive computation.
URL:https://dimag.ibs.re.kr/event/2026-12-01/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR