Question

Why does my algorithm for converting fractional decimal to binary does not work?

score 269 · Answer 1 · 2026-04-11 23:15:08

269

Views

Why does my algorithm for converting fractional decimal to binary does not work?

Published on 11 Apr 2026 - 23:15

score 1.4k · Answer 2 · 2026-04-13 17:41:23

1.4k

Views

When the fraction $\frac 1{288}$ is expressed in base $12$, is it terminating or repeating?

Published on 13 Apr 2026 - 17:41

score 226 · Answer 3 · 2026-04-11 23:17:42

226

Views

Why multiplying by base b works when converting fractions from one base to another?

Published on 11 Apr 2026 - 23:17

score 1k · Answer 4 · 2026-04-06 09:02:58

1k

Views

Is $x^2 \equiv 1 \pmod{p^k} \iff x \equiv \pm 1 \pmod {p^k}$ for odd prime $p$?

Published on 06 Apr 2026 - 9:02

score 257 · Answer 5 · 2026-04-12 09:14:52

257

Views

Finding the square roots of large numbers

Published on 12 Apr 2026 - 9:14

score 302 · Answer 6 · 2026-04-09 00:31:14

302

Views

If $ax + by =$ prime, are then $a$ and $b$ relative prime?

Published on 09 Apr 2026 - 0:31

score 284 · Answer 7 · 2026-03-29 15:40:32

284

Views

If P(n) divides Q(n) for all integers n then does P(x) divides Q(x)?

Published on 29 Mar 2026 - 15:40

score 276 · Answer 8 · 2026-04-05 21:30:22

276

Views

Number of integers $x$ between $1$ and $95$ such that $96$ divides $60x$

Published on 05 Apr 2026 - 21:30

score 2.2k · Answer 9 · 2026-04-13 10:15:15

2.2k

Views

A problem on divisibility: If $c$ divides $ab$ and $\gcd(b,c)=1$, then prove that $c$ divides $a$.

Published on 13 Apr 2026 - 10:15

score 48 · Answer 10 · 2026-04-11 19:44:32

48

Views

Steps of Euclidean Algorithm

Published on 11 Apr 2026 - 19:44

score 220 · Answer 11 · 2018-03-16 15:03:16

220

Views

Proving that $3^{n+2}$ does not divide $2^{3^n} +1$ for any positive integer $n$

Published on 16 Mar 2018 - 15:03

score 64 · Answer 12 · 2026-04-12 20:54:25

64

Views

Elementary Number Theory: Solving a Congruence Equation

Published on 12 Apr 2026 - 20:54

score 591 · Answer 13 · 2026-03-25 12:50:00

591

Views

Show that if $\gcd(a,b) > 1$, then there can be at most one prime of the form $p = an+b$.

Published on 25 Mar 2026 - 12:50

score 217 · Answer 14 · 2026-03-29 07:28:37

217

Views

Proving Euclid's Lemma using basic axioms of Z.

Published on 29 Mar 2026 - 7:28

score 234 · Answer 15 · 2026-04-09 04:32:21

234

Views

Is $a^2 + b^2 = c^2 + d^2 = e^2 + f^2$ possible, where a+e=d and b+c=f

Published on 09 Apr 2026 - 4:32

List Question

Why does my algorithm for converting fractional decimal to binary does not work?

When the fraction $\frac 1{288}$ is expressed in base $12$, is it terminating or repeating?

Why multiplying by base b works when converting fractions from one base to another?

Is $x^2 \equiv 1 \pmod{p^k} \iff x \equiv \pm 1 \pmod {p^k}$ for odd prime $p$?

Finding the square roots of large numbers

If $ax + by =$ prime, are then $a$ and $b$ relative prime?

If P(n) divides Q(n) for all integers n then does P(x) divides Q(x)?

Number of integers $x$ between $1$ and $95$ such that $96$ divides $60x$

A problem on divisibility: If $c$ divides $ab$ and $\gcd(b,c)=1$, then prove that $c$ divides $a$.

Steps of Euclidean Algorithm

Proving that $3^{n+2}$ does not divide $2^{3^n} +1$ for any positive integer $n$

Elementary Number Theory: Solving a Congruence Equation

Show that if $\gcd(a,b) > 1$, then there can be at most one prime of the form $p = an+b$.

Proving Euclid's Lemma using basic axioms of Z.

Is $a^2 + b^2 = c^2 + d^2 = e^2 + f^2$ possible, where a+e=d and b+c=f

Trending Questions

Popular # Hahtags

Popular Questions