query: Inverse number using gcd
positive_passages.docid: 59754
positive_passages.text: Extended Euclidean Algorithm: backward vs. forward
negative_passages.docid: 82938
negative_passages.text: $\gcd(a,b)=1, x^a = y^b\Rightarrow x = n^b$, $ y = n^a$ for an integer $n$.
negative_passages.docid: 20477
negative_passages.text: Prove that $\gcd(3^n-2,2^n-3)=\gcd(5,2^n-3)$
negative_passages.docid: 73391
negative_passages.text: Prove that if $\gcd(a,b)=1$, then $\gcd(a^2,b^2)=1$
negative_passages.docid: 136064
negative_passages.text: How can I prove that $\gcd(a,b)=1\implies \gcd(a^2,b^2)=1$ without using prime decomposition?
negative_passages.docid: 19164
negative_passages.text: On the GCD of a Pair of Fermat Numbers
negative_passages.docid: 122096
negative_passages.text: Find $GCD(n^2+1,n+1)$
negative_passages.docid: 38404
negative_passages.text: Prove $\gcd(a+b, a-b) = 1$ or $2\,$ if $\,\gcd(a,b) = 1$
negative_passages.docid: 97303
negative_passages.text: Calculate the multiplicative inverse modulo a composite number
negative_passages.docid: 74924
negative_passages.text: identity element of $(D_n ,\gcd)$
negative_passages.docid: 125499
negative_passages.text: Find this sequence $a_{i}$ such $\gcd{(a_{i},a_{j})}=\gcd{(i,j)}$
negative_passages.docid: 23590
negative_passages.text: Show that $\gcd\left(\frac{a^n-b^n}{a-b},a-b\right)=\gcd(n d^{n-1},a-b)$
negative_passages.docid: 55441
negative_passages.text: Check: For the integers $a,b,c$ show that $\gcd(a,bc)=\gcd(a,\gcd(a,b)\cdot c)$
negative_passages.docid: 101940
negative_passages.text: If we know the GCD and LCM of two integers, can we determine the possible values of these two integers?
negative_passages.docid: 20611
negative_passages.text: Inverse of a factorial
negative_passages.docid: 34330
negative_passages.text: How to prove $\gcd(a^2,b^2) = (\gcd(a,b))^2$?
negative_passages.docid: 154959
negative_passages.text: Proof of associativity of GCD?