query: $2^n-1$ is composite
positive_passages.docid: 41700
positive_passages.text: Are Mersenne prime exponents always odd?
negative_passages.docid: 97659
negative_passages.text: Am I on the right track to proving this statement about composite function?
negative_passages.docid: 79915
negative_passages.text: Convergence of $\sum_{m\text{ is composite}}\frac{1}{m}$
negative_passages.docid: 48850
negative_passages.text: Consecutive composite numbers
negative_passages.docid: 150300
negative_passages.text: Root of unity for $n+1$
negative_passages.docid: 102889
negative_passages.text: If $2^n - 1$ is prime from some integer $n$, prove that n must also be prime.
negative_passages.docid: 75373
negative_passages.text: Show that $2^n>n$ for $n\in \mathbb{N}$
negative_passages.docid: 83909
negative_passages.text: Is $2^{2n} = O(2^n)$?
negative_passages.docid: 31331
negative_passages.text: $|a|=m,\,\gcd(m,n)=1 \implies a$ is an $n$'th power
negative_passages.docid: 44897
negative_passages.text: Proof: If $n=ab$ then $2^a-1 \mid 2^n-1$
negative_passages.docid: 100361
negative_passages.text: Show that ord$_{p}2 = 2^{n + 1}$.
negative_passages.docid: 2802
negative_passages.text: If $2^n+1$ is prime, why must $n$ be a power of $2$?
negative_passages.docid: 151093
negative_passages.text: RSA with composite numbers
negative_passages.docid: 121706
negative_passages.text: Show $\text{det}(A)$ is divisible by $2^{n-1}$
negative_passages.docid: 27859
negative_passages.text: least common multiple of $\{1,2,...,n\}$ is bigger than $2^{n-1}$
negative_passages.docid: 112631
negative_passages.text: Prove that if $d$ divides $n$, then $2^d -1$ divides $2^n -1$
negative_passages.docid: 46102
negative_passages.text: Prove that $2^n +1$ in never a perfect cube