OurBigBook About$ Donate
 Sign in+ Sign up
by Ciro Santilli (@cirosantilli, 37)

Decidability of Hilbert's tenth problem in modular arithmetic

 ... Function by signature Numeric function Polynomial Diophantine equation Hilbert's tenth problem Hilbert's tenth problem variant
 0 By others on same topic  0 Discussions  Updated 2025-05-29  +Created 2024-07-12  See my version
www.jstor.org/stable/1970438 says for prime modulo there is an algorithm.
Question for non-prime modulo: math.stackexchange.com/questions/4944623/are-diophantine-equations-decidable-in-modular-arithmetic

 Ancestors (11)

  1. Hilbert's tenth problem variant
  2. Hilbert's tenth problem
  3. Diophantine equation
  4. Polynomial
  5. Numeric function
  6. Function by signature
  7. Function (mathematics)
  8. Formalization of mathematics
  9. Area of mathematics
  10. Mathematics
  11.  Home

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook