Dec 12, 2022 · 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?

May 16, 2023 · 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

Sep 15, 2023 · Consider a Maximal-length sequence (hereby M-sequence) $S$ of minimal period $2^n-1$, as produced by an LFSR with a binary primitive polynomial. Note $s_0,s_1,\ldots ...

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 ...

Sep 1, 2015 · I have read that, but essentially what I want to know is, can a primitive root be defined in a simpler, easier to understand way? For my level of mathematics, some of the more formal definitions …

Nov 18, 2016 · I read about irreducible polynomial, primitive polynomial and minimal polynomial and now i am not able to differentiate between them, its chaos in my mind. Can somebody describe what they …

May 18, 2021 · Instead of "if gcd (modulo, num)" you should use "if gcd (modulo, num) == 1". This works for 6 on my machine, correctly predicting that mod 6 the only primitive root is 5. Your code only …

Jul 23, 2018 · 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 m be a

They are not equivalent. The standard example is the Ackermann function, which is (total) recursive, but not primitive recursive. But if you are a programmer, here's another way to think of the difference …

Nov 11, 2014 · Check out the proof for the following corollary. This is only the first part of the proof and I have a issue with this. $F(z)$ is defined by integrating $f$ along a ...