Question

Why is there bijection between all multiples of $d$ in mod $N$ and the image of $f$ here?

score 41 · Answer 1 · 2023-10-10 06:08:14

Why is there bijection between all multiples of $d$ in mod $N$ and the image of $f$ here?

Published on 10 Oct 2023 - 6:08

score 55 · Answer 2 · 2023-10-11 01:55:45

Prove that there exist positive integers that divides none of the integers in a given set, and can be smaller than the gcd of the given integers.

score 40 · Answer 3 · 2023-10-13 07:26:12

40

Views

How to prove that $\gcd((a^m -1)/(a-1),a-1)=\gcd((a-1),m)$

Published on 13 Oct 2023 - 7:26

score 90 · Answer 4 · 2023-10-14 14:44:38

90

Views

About Least Common Multiple $lcm$ of natural numbers

Published on 14 Oct 2023 - 14:44

score 21 · Answer 5 · 2026-03-25 19:06:47

21

Views

Find approximate solution $\omega_1 k_1 + \omega_2 k _2 \approx \gamma$ of linear Diophantine equation with real coefficients

Published on 25 Mar 2026 - 19:06

score 26 · Answer 6 · 2023-10-17 11:53:20

26

Views

$\gcd(f,g) \neq 1 \iff \exists s,t \in F[x]: sf+tg=0 \wedge \deg(s) < \deg(g) \wedge \deg(t) < \deg(f)$

Published on 17 Oct 2023 - 11:53

score 51 · Answer 7 · 2023-10-19 15:04:48

If φ is a homomorphism, φ: G⟶G′, |G| and |G'| is finite, then for every g ∈ G, o(φ(g)) | (g.c.d(|G|,|G'|))

score 77 · Answer 8 · 2023-10-20 10:31:59

77

Views

Bound on geometric mean of gcd

Published on 20 Oct 2023 - 10:31

score 85 · Answer 9 · 2026-03-25 17:43:49

85

Views

Algorithm to find the least solution of linear Diophantine equation

Published on 25 Mar 2026 - 17:43

score 35 · Answer 10 · 2023-10-21 17:24:18

35

Views

Prove that ${n\choose k}$ has at least k distinct prime divisors by proving an intermediate statement first

Published on 21 Oct 2023 - 17:24

score 63 · Answer 11 · 2026-03-28 20:13:00

63

Views

Given $a,b \in \mathbb{N}$, is it true that $\phi(\gcd(a,b))=\gcd(\phi(a),\phi(b))$?

Published on 28 Mar 2026 - 20:13

score 114 · Answer 12 · 2026-03-31 16:10:56

114

Views

Need a function to identify co-prime pairs

Published on 31 Mar 2026 - 16:10

score 78 · Answer 13 · 2026-03-30 20:05:57

78

Views

$gcd(n,p-1)=gcd(n,q-1)$ with $p,q$ prime and $n$ not divisible by $p$ and $q$

Published on 30 Mar 2026 - 20:05

score 70 · Answer 14 · 2023-11-14 14:29:26

70

Views

Prove/Disprove a condition about gcd of numbers

Published on 14 Nov 2023 - 14:29

score 55 · Answer 15 · 2026-03-25 17:36:05

55

Views

Given a solution find the values for a diophantine equation

Published on 25 Mar 2026 - 17:36

List Question

Why is there bijection between all multiples of $d$ in mod $N$ and the image of $f$ here?

Prove that there exist positive integers that divides none of the integers in a given set, and can be smaller than the gcd of the given integers.

How to prove that $\gcd((a^m -1)/(a-1),a-1)=\gcd((a-1),m)$

About Least Common Multiple $lcm$ of natural numbers

Find approximate solution $\omega_1 k_1 + \omega_2 k _2 \approx \gamma$ of linear Diophantine equation with real coefficients

$\gcd(f,g) \neq 1 \iff \exists s,t \in F[x]: sf+tg=0 \wedge \deg(s) < \deg(g) \wedge \deg(t) < \deg(f)$

If φ is a homomorphism, φ: G⟶G′, |G| and |G'| is finite, then for every g ∈ G, o(φ(g)) | (g.c.d(|G|,|G'|))

Bound on geometric mean of gcd

Algorithm to find the least solution of linear Diophantine equation

Prove that ${n\choose k}$ has at least k distinct prime divisors by proving an intermediate statement first

Given $a,b \in \mathbb{N}$, is it true that $\phi(\gcd(a,b))=\gcd(\phi(a),\phi(b))$?

Need a function to identify co-prime pairs

$gcd(n,p-1)=gcd(n,q-1)$ with $p,q$ prime and $n$ not divisible by $p$ and $q$

Prove/Disprove a condition about gcd of numbers

Given a solution find the values for a diophantine equation

Trending Questions

Popular # Hahtags

Popular Questions