Find counterexamples where ord|pn−qn|(p) ≠ ord|pn−qn|(q)
Wolfram-style: For integers p and q, we check every n > 2 in order (no limit, no skipping).
We compute m = |pn − qn| and compare the multiplicative order of p and q modulo m.
A counterexample is an n where the orders differ or are undefined (gcd ≠ 1).
Browser mode uses BigInt (no overflow limits). Server mode uses a Rust worker
with automatic GPU acceleration (CUDA on H100) when available, falling back to CPU; n is tested sequentially 3, 4, 5, …