Mohsen Afshin
Reputation
310
Top tag
Next privilege 500 Rep.
Access review queues
 Mar 2 comment Proof of Prime Maker Conjecture $d_0$ is a prime factor of $n$ or $m+1$, so $d_0 \mid m+1$, and so then we have $d_0 \not\mid d_0\times m + 1$. Got it? Mar 2 revised Proof of Prime Maker Conjecture edited the value of the primorial Mar 2 comment Proof of Prime Maker Conjecture To multiply $m$ by $d_0$ and put the result $+1$ into $n$. It is primorial of 100th prime. Mar 2 asked Proof of Prime Maker Conjecture Jan 5 suggested rejected edit on why $\pi \cot \pi z = \sum _{n=-\infty}^{\infty} \frac{1}{z+n}$ Jan 5 suggested rejected edit on why $\pi \cot \pi z = \sum _{n=-\infty}^{\infty} \frac{1}{z+n}$ Dec 23 accepted Fermat's Little Theorem and Polynomial Congruence Relation Dec 22 comment Modular arithmetic with different moduli thanks for your answer, but do you think the nonexistence of any property for the modulus addition or subtraction is due to the nature of modular arithmetic or due to that we didn't find any relation yet? Dec 22 asked Modular arithmetic with different moduli Dec 22 awarded Scholar Dec 22 accepted Proof of Wilson's Theorem using Fermat's Little Theorem Dec 20 asked Proof of Wilson's Theorem using Fermat's Little Theorem Dec 14 comment Fundamental Period of sequence modulo N I assume that $N$ or $p$ is prime and I know full factorization of $N-1$. And I know all divisors of $N-1$. How do I know which divisor is $T$ (fundamental period)?. The real problem is this. Dec 14 comment Fundamental Period of sequence modulo N As I know, if there is any $T$ it should be among divisors of $N-1$. That is, in case of existence of such a $T$, it should be made from the prime factors of $N-1$ so $T$ is one of divisors of $N-1$. Dec 13 revised Fastest Primality test using $N-1$ Factorization? deleted 1 characters in body Dec 13 revised Fundamental Period of sequence modulo N edited body Dec 13 comment Fundamental Period of sequence modulo N thanks for answer. As I told in the question I want to obtain $T$, without calculating the modular exponentiation for all $T$ up to $N$. With calculation it is obvious that $2^{27} \equiv 2^1 \pmod{2731}$. So $T = 27-1 = 26$ Dec 13 awarded Promoter Dec 13 revised Fastest Primality test using $N-1$ Factorization? added 4 characters in body Dec 13 revised Fundamental Period of sequence modulo N added a question