wiki_research

commit 2683aed37f9ff236dd6f8a64ca09a6e3d3ef0b56
parent 4b86ec12fce3c1a209ae58b330fca6f08c68906b
Author: Antoine Amarilli <a3nm@a3nm.net>
Date:   Wed, 15 Apr 2026 17:00:50 +0200

commit with codex

Diffstat:
computational_problem
 | 
2
+-
primitive_root
 | 
2
++
primitive_root_computing
 | 
9
+++++++++

3 files changed, 12 insertions(+), 1 deletion(-)
diff --git a/computational_problem b/computational_problem
@@ -43,4 +43,4 @@
 
 Up: [theoretical_computer_science]
 
-Aliases: computational problems
+Aliases: computational problems, computation problem
diff --git a/primitive_root b/primitive_root
@@ -4,6 +4,8 @@ Given a [word] v, returns the shortest [word] u such that v = u^k for some k
 
 Note that u is then a [primitive_word]
 
+[primitive_root_computing]
+
 Up: [operation] on [words]
 
 Aliases: primitive roots
diff --git a/primitive_root_computing b/primitive_root_computing
@@ -0,0 +1,9 @@
+# Primitive root computation
+
+The problem of [computing] the [primitive_root] of a [word]
+
+Can be done in [linear_time] by [pattern_matching], cf [garwychowski2010finding] for instance
+
+Up: [computation_problem], [primitive_root]
+
+Aliases: primitive root computation, computing primitive root