query: If $\text{gcd}(a,561)=1$, then $a^{560}=1\mod 561$
positive_passages.docid: 152372
positive_passages.text: Verifying Carmichael numbers
negative_passages.docid: 14783
negative_passages.text: A Number Theory problem (GCD)
negative_passages.docid: 6012
negative_passages.text: Prove that $\gcd(a^n - 1, a^m - 1) = a^{\gcd(n, m)} - 1$
negative_passages.docid: 83307
negative_passages.text: If $n\mid a^2-1$, $n$ an odd integer, show $n = \gcd(a-1, n)\gcd(a+1, n)$
negative_passages.docid: 2289
negative_passages.text: Prove that if $\gcd( a, b ) = 1$ then $\gcd( ac, b ) = \gcd( c, b ) $
negative_passages.docid: 7091
negative_passages.text: If $\gcd(a,b)=1$, then $\gcd(a^n,b^n)=1$
negative_passages.docid: 76680
negative_passages.text: Prove that if $\gcd(a,c)=1$ and $\gcd(b,c)=1$ then $\gcd(ab,c)=1$
negative_passages.docid: 36611
negative_passages.text: Algorithms for solving the discrete logarithm $a^x \equiv b\pmod{n}$ when $\gcd(a,n) \neq 1$
negative_passages.docid: 128820
negative_passages.text: Prove that if $\gcd(a,b)=1$ then $\gcd(ab,c) = \gcd(a,c) \gcd(b,c)$
negative_passages.docid: 96237
negative_passages.text: $1^2 + 2^2 + 3^2 + \cdots + (n-1)^2 \equiv 0$ mod n iff $n \equiv \pm 1$ mod 6
negative_passages.docid: 77278
negative_passages.text: If $\,\gcd(a,b) = {\rm lcm}(a,b)\,$ then prove $a=b$
negative_passages.docid: 25713
negative_passages.text: If $a$ and $b$ commute and $\text{gcd}\left(\text{ord}(a),\text{ord}(b)\right)=1$, then $\text{ord}(ab)=\text{ord}(a)\text{ord}(b)$.
negative_passages.docid: 1197
negative_passages.text: Finding $\gcd(2n-1,2n+1)$ . . . I think it's 1 but is my logic right?
negative_passages.docid: 101872
negative_passages.text: Prove that $\gcd(a^2, b^2) = \gcd(a, b)^2$
negative_passages.docid: 72424
negative_passages.text: Suppose 1 ≤ k ≤ n − 1 and gcd(k, n) = 1. Prove that gcd(n − k, n) = 1
negative_passages.docid: 135086
negative_passages.text: GCD of two numbers divided by their greatest common divisor is 1
negative_passages.docid: 68960
negative_passages.text: How to solve $ 13x \equiv 1 ~ (\text{mod} ~ 17) $?