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
Like
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)
Hilbert's tenth problem variant
Hilbert's tenth problem
Diophantine equation
Polynomial
Numeric function
Function by signature
Function (mathematics)
Formalization of mathematics
Area of mathematics
Mathematics
Home
View article source
Discussion
(0)
Subscribe (1)
+
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
