Question

What is the probability a random integer $x$ when divided by $3$ has a remainder smaller than when $x$ is divided by $9$? without monte-carlo.

score 96 · Answer 1 · 2024-02-06 20:02:11

96

Views

What is the probability a random integer $x$ when divided by $3$ has a remainder smaller than when $x$ is divided by $9$? without monte-carlo.

Published on 06 Feb 2024 - 20:02

score 59 · Answer 2 · 2024-02-21 10:43:12

59

Views

A simple algorithm to find the inverse

Published on 21 Feb 2024 - 10:43

score 41 · Answer 3 · 2026-03-25 19:09:58

41

Views

Find integral values of x , y and z : $6x +10y + 15z= -1$

Published on 25 Mar 2026 - 19:09

score 29 · Answer 4 · 2024-02-28 02:12:11

29

Views

Show that any integer of the form $6k + 5$ is also of the form $3 j + 2$, but not conversely.

Published on 28 Feb 2024 - 2:12

score 26 · Answer 5 · 2024-03-13 11:37:15

26

Views

Is the sum of the continued fraction sequence / number of steps in Euclid algorithm a metric?

Published on 13 Mar 2024 - 11:37

score 297 · Answer 6 · 2024-03-13 18:11:05

297

Views

About reversing the Euclidean Algorithm, Lemma of Bézout

Published on 13 Mar 2024 - 18:11

score 93 · Answer 7 · 2024-03-27 15:35:51

93

Views

Minimum $k$ for which every positive integer of the interval $(kn, (k+1)n)$ is divisible by at least one prime number less than $n$

Published on 27 Mar 2024 - 15:35

score 98 · Answer 8 · 2024-03-28 00:50:17

98

Views

Minimal size of $a^2+b^2$ such that $ad-bc=1$

Published on 28 Mar 2024 - 0:50

score 555 · Answer 9 · 2015-03-28 17:31:19

555

Views

Gcd and lcm of $a_1, a_2, \dots,a_n$ exist in $R$ when $R$ is a UFD.

Published on 28 Mar 2015 - 17:31

score 164 · Answer 10 · 2015-03-29 15:27:12

164

Views

HCf of Polynomials over field extensions

Published on 29 Mar 2015 - 15:27

score 451 · Answer 11 · 2015-03-31 20:07:47

451

Views

Diophantine linear Equation Gaussian Integers

Published on 31 Mar 2015 - 20:07

score 68 · Answer 12 · 2015-04-02 17:33:46

68

Views

Use the the division algorithm and the fact that $I= (\alpha)$

Published on 02 Apr 2015 - 17:33

score 64 · Answer 13 · 2015-04-04 21:41:56

64

Views

Extended Euclidean and Bezout's

Published on 04 Apr 2015 - 21:41

score 344 · Answer 14 · 2015-04-06 15:06:08

344

Views

Can we characterize those Euclidean domains $D$ for which $D/I$ is finite for any ideal $I \ne \{0\}$ of $D$?

Published on 06 Apr 2015 - 15:06

score 189 · Answer 15 · 2015-04-08 22:41:52

189

Views

Solving the GCD m = 735, n =252

Published on 08 Apr 2015 - 22:41

List Question

What is the probability a random integer $x$ when divided by $3$ has a remainder smaller than when $x$ is divided by $9$? without monte-carlo.

A simple algorithm to find the inverse

Find integral values of x , y and z : $6x +10y + 15z= -1$

Show that any integer of the form $6k + 5$ is also of the form $3 j + 2$, but not conversely.

Is the sum of the continued fraction sequence / number of steps in Euclid algorithm a metric?

About reversing the Euclidean Algorithm, Lemma of Bézout

Minimum $k$ for which every positive integer of the interval $(kn, (k+1)n)$ is divisible by at least one prime number less than $n$

Minimal size of $a^2+b^2$ such that $ad-bc=1$

Gcd and lcm of $a_1, a_2, \dots,a_n$ exist in $R$ when $R$ is a UFD.

HCf of Polynomials over field extensions

Diophantine linear Equation Gaussian Integers

Use the the division algorithm and the fact that $I= (\alpha)$

Extended Euclidean and Bezout's

Can we characterize those Euclidean domains $D$ for which $D/I$ is finite for any ideal $I \ne \{0\}$ of $D$?

Solving the GCD m = 735, n =252

Trending Questions

Popular # Hahtags

Popular Questions