query: Period of fractions, general formula for primes?
positive_passages.docid: 155937
positive_passages.text: The reciprocal of many prime numbers p in base 10 have a set of repeating digits p-1. Why?
negative_passages.docid: 97061
negative_passages.text: Is there a known mathematical equation to find the nth prime?
negative_passages.docid: 38741
negative_passages.text: Finding a general formula for summation
negative_passages.docid: 115758
negative_passages.text: Remainder of division when $p$ is not prime
negative_passages.docid: 107924
negative_passages.text: Prove (or derive) the de Polignac formula for the prime decomposition of $n!$
negative_passages.docid: 105442
negative_passages.text: Show that any prime divisor of $x^4+x^3+x^2+x+1$, with $x\in\mathbb{N}$, is $5$ or $1$ mod $5$
negative_passages.docid: 129236
negative_passages.text: Continued fraction for $\frac{1}{e-2}$
negative_passages.docid: 136310
negative_passages.text: Prime number in a polynomial expression
negative_passages.docid: 30518
negative_passages.text: Formula for $\sum_{k=1}^n \frac{1}{k(k+1)(k+2)}$?
negative_passages.docid: 42376
negative_passages.text: Let $p$ be prime and $(\frac{-3}p)=1$. Prove that $p$ is of the form $p=a^2+3b^2$
negative_passages.docid: 132928
negative_passages.text: Digits of $\pi$ forming primes?
negative_passages.docid: 80907
negative_passages.text: Primes dividing a polynomial
negative_passages.docid: 8710
negative_passages.text: Bounds for $n$-th prime
negative_passages.docid: 131241
negative_passages.text: primes congruent to 5 mod 6 and 1 mod p
negative_passages.docid: 103323
negative_passages.text: Finding a primitive root of a prime number
negative_passages.docid: 45127
negative_passages.text: Why is Euler's totient function equal to $(p-1)(q-1)$ when $N=pq$ and $p$ and $q$ are prime in a clean intuitive way?
negative_passages.docid: 75378
negative_passages.text: how to prove this extended prime number theorem?