| Display title | Hilbert's tenth problem |
| Default sort key | Hilbert's tenth problem |
| Page length (in bytes) | 25,338 |
| Namespace ID | 0 |
| Page ID | 224615 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>JOpenQuest |
| Date of page creation | 15:20, 6 February 2024 |
| Latest editor | imported>JOpenQuest |
| Date of latest edit | 15:20, 6 February 2024 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | Hilbert's tenth problem is the tenth on the list of mathematical problems that the German mathematician David Hilbert posed in 1900. It is the challenge to provide a general algorithm that, for any given Diophantine equation (a polynomial equation with integer coefficients and a finite number of unknowns... |
