Show simple item record

dc.contributor.authorPasten, Hector
dc.contributor.editorRandecker, Anja
dc.contributor.editorJahns, Sophia
dc.date.accessioned2019-04-24T09:52:05Z
dc.date.available2019-04-25T09:52:05Z
dc.date.issued2019-04-24
dc.identifier.urihttp://publications.mfo.de/handle/mfo/1413
dc.description.abstractDiophantine equations are polynomial equations whose solutions are required to be integer numbers. They have captured the attention of mathematicians during millennia and are at the center of much of contemporary research. Some Diophantine equations are easy, while some others are truly difficult. After some time spent with these equations, it might seem that no matter what powerful methods we learn or develop, there will always be a Diophantine equation immune to them, which requires a new trick, a better idea, or a refined technique. In this snapshot we explain why.en_US
dc.language.isoenen_US
dc.publisherMathematisches Forschungsinstitut Oberwolfachen_US
dc.relation.ispartofseriesSnapshots of modern mathematics from Oberwolfach;2019,03
dc.rightsAttribution-ShareAlike 4.0 International*
dc.rights.urihttp://creativecommons.org/licenses/by-sa/4.0/*
dc.titleDiophantine equations and why they are harden_US
dc.typeArticleen_US
dc.identifier.doi10.14760/SNAP-2019-003-EN
local.series.idSNAP-2019-003-ENen_US
local.subject.snapshotAlgebra and Number Theoryen_US
dc.identifier.urnurn:nbn:de:101:1-2019051609463306392545
dc.identifier.ppn1665804130


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Attribution-ShareAlike 4.0 International
Except where otherwise noted, this item's license is described as Attribution-ShareAlike 4.0 International