University of Leicester
Browse

On the smallest open Diophantine equations

Download (225.8 kB)
journal contribution
posted on 2022-07-04, 08:16 authored by Bogdsan Grechuk
This paper reports on the current status of the project in which we order all polynomial Diophantine equations by an appropriate version of "size", and then solve the equations in that order. We list the "smallest" equations that are currently open, both unrestricted and in various families, like the smallest open symmetric, 2-variable or 3-monomial equations. All the equations we discuss are amazingly simple to write down but some of them seem to be very difficult to solve.

History

Citation

ACM SIGACT News, Volume 53, Issue 1, March 2022. pp 36–57. https://doi.org/10.1145/3532737.3532743

Author affiliation

School of Computing and Mathematical Sciences, University of Leicester

Version

  • AM (Accepted Manuscript)

Published in

ACM SIGACT News

Volume

53

Issue

1

Pagination

36 - 57

Publisher

Association for Computing Machinery (ACM)

issn

0163-5700

Copyright date

2022

Available date

2022-07-04

Language

en

Usage metrics

    University of Leicester Publications

    Categories

    No categories selected

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC