Skip to main content

All Questions

Filter by
Sorted by
Tagged with
5 votes
2 answers
510 views

"Efficient" way to build a table of multiplicative orders modulo $p$ of a fixed integer $a$

Given an integer $a$, I would like to build a table of entries $(p, \text{ord}_p(a))$, where $p$ runs over the prime numbers not dividing $a$ and not exceeding a fixed parameter $P$, and $\text{ord}_p(...
Fran's user avatar
  • 53