Question

Find the inverse using fast exponential algorithm or Extended Euclidean Algorithm

score 107 · Answer 1 · 2026-03-26 17:29:50

107

Views

Find the inverse using fast exponential algorithm or Extended Euclidean Algorithm

Published on 26 Mar 2026 - 17:29

score 151 · Answer 2 · 2019-06-08 01:15:16

151

Views

If $a$ and $b$ are odd, then $(2a,2b)=(a+b, a-b)$, where $(x,y)$ denotes the greatest common divisor of $x$ and $y$.

Published on 08 Jun 2019 - 1:15

score 156 · Answer 3 · 2026-03-25 18:45:08

156

Views

Using GCD to find unknown value

Published on 25 Mar 2026 - 18:45

score 329 · Answer 4 · 2019-06-10 05:53:45

329

Views

Condition for the sum of two fractions to be irreducible

Published on 10 Jun 2019 - 5:53

score 327 · Answer 5 · 2019-06-11 06:51:19

327

Views

Numbers which cannot be formed

Published on 11 Jun 2019 - 6:51

score 54 · Answer 6 · 2026-03-26 22:53:19

54

Views

In $\mathbb Z_n$ prove that $\langle h,k\rangle = \langle\gcd(h,k,n)\rangle$

Published on 26 Mar 2026 - 22:53

score 484 · Answer 7 · 2026-02-23 04:59:34

484

Views

$a, b, c, d$ are fixed positive integers. If $(ad - bc) \mid a$ and $(ad - bc) \mid c$, show that $\gcd(an + b, cn + d)= 1$ for any $n \in \mathbb{N}$

Published on 23 Feb 2026 - 4:59

score 39 · Answer 8 · 2019-06-13 02:25:16

39

Views

Confusion: Man crossing a stream without current and with current.

Published on 13 Jun 2019 - 2:25

score 186 · Answer 9 · 2019-06-13 06:39:52

186

Views

Please help to solve this number theory question based on gcd and lcm.

Published on 13 Jun 2019 - 6:39

score 112 · Answer 10 · 2026-03-26 12:53:55

112

Views

Number of nonnegative solutions of equation ax+by=n

Published on 26 Mar 2026 - 12:53

score 692 · Answer 11 · 2019-06-16 18:44:40

692

Views

Prove common divisors of $a,b$ divide $\gcd(a,b)$ without Bezout, primes or guessing the form of the GCD

Published on 16 Jun 2019 - 18:44

score 1.1k · Answer 12 · 2026-03-26 17:53:31

1.1k

Views

Number of integers $n$ between 1 and 1000 such that the HCF of $n$ and $36$ is 1

Published on 26 Mar 2026 - 17:53

score 54 · Answer 13 · 2026-03-25 09:26:19

54

Views

Reasoning about $x(x+2)$ relatively prime to $\dfrac{p\#}{w}$

Published on 25 Mar 2026 - 9:26

score 30 · Answer 14 · 2019-06-22 15:26:09

30

Views

Maximum number if the GCD is known

Published on 22 Jun 2019 - 15:26

score 680 · Answer 15 · 2026-03-25 14:21:08

680

Views

How to calculate the GCD?

Published on 25 Mar 2026 - 14:21

List Question

Find the inverse using fast exponential algorithm or Extended Euclidean Algorithm

If $a$ and $b$ are odd, then $(2a,2b)=(a+b, a-b)$, where $(x,y)$ denotes the greatest common divisor of $x$ and $y$.

Using GCD to find unknown value

Condition for the sum of two fractions to be irreducible

Numbers which cannot be formed

In $\mathbb Z_n$ prove that $\langle h,k\rangle = \langle\gcd(h,k,n)\rangle$

$a, b, c, d$ are fixed positive integers. If $(ad - bc) \mid a$ and $(ad - bc) \mid c$, show that $\gcd(an + b, cn + d)= 1$ for any $n \in \mathbb{N}$

Confusion: Man crossing a stream without current and with current.

Please help to solve this number theory question based on gcd and lcm.

Number of nonnegative solutions of equation ax+by=n

Prove common divisors of $a,b$ divide $\gcd(a,b)$ without Bezout, primes or guessing the form of the GCD

Number of integers $n$ between 1 and 1000 such that the HCF of $n$ and $36$ is 1

Reasoning about $x(x+2)$ relatively prime to $\dfrac{p\#}{w}$

Maximum number if the GCD is known

How to calculate the GCD?

Trending Questions

Popular # Hahtags

Popular Questions