wiki_research

commit cdbad1f6851cbbe5435cea270d5f0a51da16fbd3
parent 9fc339ae0226d31008a976db4ef846752d3a56db
Author: Antoine Amarilli <a3nm@a3nm.net>
Date:   Mon, 18 Aug 2025 00:45:03 +0200

commit with codex

Diffstat:
arithmetic
 | 
2
++
mod_k_p
 | 
9
+++++++++
modulo
 | 
2
+-
parity_p
 | 
2
++

4 files changed, 14 insertions(+), 1 deletion(-)
diff --git a/arithmetic b/arithmetic
@@ -5,6 +5,8 @@
 - [prime_number]
 - [integer_factorization]
 - [presburger_arithmetic]
+- [divisibility]
+- [modulo]
 
 Up: [mathematics]
 
diff --git a/mod_k_p b/mod_k_p
@@ -0,0 +1,9 @@
+# Mod k p
+
+https://complexityzoo.net/Complexity_Zoo:M#modkp
+
+[Computational_problem] solvable by [nondeterministic_Turing_machine] where the [acceptance_condition] is that the number of [accepting_runs] is NOT [divisible] by k.
+
+For k=2, [parity_p]
+
+Up: [parity_p]
diff --git a/modulo b/modulo
@@ -6,4 +6,4 @@
 
 Up: [mathematics]
 
-See also: [equivalence_relation], [modular_decomposition], [modular_function]
+See also: [equivalence_relation], [modular_decomposition], [modular_function], [divisibility]
diff --git a/parity_p b/parity_p
@@ -6,6 +6,8 @@ https://en.wikipedia.org/wiki/Parity_P
 
 - [parity_p_complete]
 
+Generalization to other moduli: [mod_k_p]
+
 Up: [parity], [complexity_class]
 
 See also: [parity_fine_grained], [Z_2Z], [parity_L]