2023年5月16日 · How would you find a primitive root of a prime number such as 761? How do you pick the primitive roots to test? Randomly? Thanks

I'm trying to understand what primitive roots are for a given $\bmod\ n$. Wolfram's definition is as follows: A primitive root of a prime $p$ is an integer $g$ such ...

2019年1月6日 · If I had to guess, I would say that calling the antiderivative as primitive is of French origin. Is one term more popular than the other?

2018年7月23日 · So I encountered this proof on a Number Theory book, I will link the pdf at the end of the post (proof at page 96), it says: "Every prime has a primitive root, proof: Let p be a prime and let …

2022年12月12日 · I have noticed that you have been asking countless questions within the "lambda calculus" tag, and have not been accepting or commenting on any of the answers. Why is that?

This is hard. To see how hard,have a look at this paper: Finding primitive elements in finite fields of small characteristic.

There is another example of a non-primitive-recursive but total computable function that explains better what the restricted definition of primitive recursion entails. Each primitive recursive function is defined …

2022年2月19日 · For Riemann or Lebesgue integration having an antiderivative is not sufficient to show integrability. A similar function, 1 xsin 1 x3 1 x sin 1 x 3, is an example that is not Lebesgue …

2015年8月10日 · I am revising for a discrete mathematics exam and as quite stuck on this question. Show that the polynomial f =x2 + 2x + 3 ∈Z5[x] f = x 2 + 2 x + 3 ∈ Z 5 [x] is primitive. How many …

2018年3月7日 · Let p p be an odd prime, let g g be a primitive root of p p. Prove −g g is a primitive root of p p if and only if