3n+1 Ep81: How hard is the 3n+1 conjecture?
Автор: Math Kook
Загружено: 2025-07-06
Просмотров: 822
Описание:
In a 2011 blog post, mathematician Terence Tao showed that the conjecture is "Baker-hard", meaning that it's more difficult to prove that some Fields-Medal winning results from the 1960s. Sobering news? Let's check it out!
PS. Thanks to users oros and soitgoes on this Collatz World forum thread!
https://forum.collatzworld.com/t/prov...
Повторяем попытку...
Доступные форматы для скачивания:
Скачать видео
-
Информация по загрузке: