Problem Set Solutions: Discrete Mathematics and Graph Construction
Problem A
Given a prime (P=10^{18}+31) with primitive root (g=42), define array (A) as:
[
A_i=\begin{cases}
795484359100928850 & i=0 \
\log_g A_{i-1} \bmod P & i>0
\end{cases}
]
For multiple queries, output (A_x). Constraints: (1\le T\le 10), (0\le x\le 10^5).
Solution: The value (A_{100000}) is provided in the problem. We can recove ...
Posted on Wed, 29 Jul 2026 16:48:20 +0000 by Lamez