Question

Count of numbers till 1000 divisible by atleast one of the first 10 prime numbers?

score 405 · Answer 1 · 2016-11-06 11:26:57

405

Views

Count of numbers till 1000 divisible by atleast one of the first 10 prime numbers?

Published on 06 Nov 2016 - 11:26

score 3k · Answer 2 · 2016-11-07 01:28:08

3k

Views

If gcd(a,c)=1 and b|c, then gcd(a,b)=1?

Published on 07 Nov 2016 - 1:28

score 181 · Answer 3 · 2016-11-10 07:15:36

181

Views

How to prove that GCD(2K+2,4k)=2 and if GCD(a,b)=1, GCD(a,c)=1 -> GCD(a,bc)=1

Published on 10 Nov 2016 - 7:15

score 304 · Answer 4 · 2016-11-12 19:44:23

304

Views

LCM and divisibility: $\,a,b\mid c\Rightarrow {\rm lcm}(a,b)\mid c$

Published on 12 Nov 2016 - 19:44

score 144 · Answer 5 · 2016-11-13 20:49:31

144

Views

Does the multiplicative Inverse have to be co prime with the module

Published on 13 Nov 2016 - 20:49

score 77 · Answer 6 · 2026-03-24 23:03:58

77

Views

$\gcd(|H_{1}|,|H_{2}|,\cdots,|H_{n}|) > 1$ implies $H_{1} \times H_{2} \times \cdots \times H_{n} = G$ not cyclic

Published on 24 Mar 2026 - 23:03

score 1.6k · Answer 7 · 2016-11-17 10:12:16

1.6k

Views

Can you define a greatest common divisor in a commutative ring that is not a domain?

Published on 17 Nov 2016 - 10:12

score 120 · Answer 8 · 2026-03-29 04:48:10

120

Views

Labelling the edges of a graph

Published on 29 Mar 2026 - 4:48

score 109 · Answer 9 · 2016-11-18 07:43:39

109

Views

If $d \mid a,b$ and $\exists x,y \in Z : d = ax + by$, then $d = \gcd(a,b)$

Published on 18 Nov 2016 - 7:43

score 56 · Answer 10 · 2016-11-18 20:16:40

56

Views

The greatest common divisor of $\sum_\limits{k=0}^{5n-2}2^k$

Published on 18 Nov 2016 - 20:16

score 690 · Answer 11 · 2026-03-27 00:56:56

690

Views

Why take the last non zero remainder in Euclid's algorithm as GCD?

Published on 27 Mar 2026 - 0:56

score 110 · Answer 12 · 2016-11-19 13:16:37

110

Views

Chromatic Number of a integer graph

Published on 19 Nov 2016 - 13:16

score 325 · Answer 13 · 2016-11-19 20:35:25

325

Views

If $m=a_1x+b_1y$, $n=a_2x+b_2y$ and $a_1b_2-a_2b_1=1$ then prove that $GCD(m,n)=GCD(x,y)$

Published on 19 Nov 2016 - 20:35

score 379 · Answer 14 · 2016-11-24 22:42:18

379

Views

Are the numbers $0$ and $13$ coprime with each other?

Published on 24 Nov 2016 - 22:42

score 154 · Answer 15 · 2016-11-25 15:24:44

154

Views

Number Theory Greatest Common Divisor proof

Published on 25 Nov 2016 - 15:24

List Question

Count of numbers till 1000 divisible by atleast one of the first 10 prime numbers?

If gcd(a,c)=1 and b|c, then gcd(a,b)=1?

How to prove that GCD(2K+2,4k)=2 and if GCD(a,b)=1, GCD(a,c)=1 -> GCD(a,bc)=1

LCM and divisibility: $\,a,b\mid c\Rightarrow {\rm lcm}(a,b)\mid c$

Does the multiplicative Inverse have to be co prime with the module

$\gcd(|H_{1}|,|H_{2}|,\cdots,|H_{n}|) > 1$ implies $H_{1} \times H_{2} \times \cdots \times H_{n} = G$ not cyclic

Can you define a greatest common divisor in a commutative ring that is not a domain?

Labelling the edges of a graph

If $d \mid a,b$ and $\exists x,y \in Z : d = ax + by$, then $d = \gcd(a,b)$

The greatest common divisor of $\sum_\limits{k=0}^{5n-2}2^k$

Why take the last non zero remainder in Euclid's algorithm as GCD?

Chromatic Number of a integer graph

If $m=a_1x+b_1y$, $n=a_2x+b_2y$ and $a_1b_2-a_2b_1=1$ then prove that $GCD(m,n)=GCD(x,y)$

Are the numbers $0$ and $13$ coprime with each other?

Number Theory Greatest Common Divisor proof

Trending Questions

Popular # Hahtags

Popular Questions