Question

For Fibonacci numbers: $\gcd(F_m, F_n) = F_{\gcd(m, n)}$

score 3.1k · Answer 1 · 2026-04-16 12:22:44

3.1k

Views

For Fibonacci numbers: $\gcd(F_m, F_n) = F_{\gcd(m, n)}$

Published on 16 Apr 2026 - 12:22

score 344 · Answer 2 · 2026-04-15 04:00:43

344

Views

Find all the positive integers k for which $7 \times 2^k+1$ is a perfect square

Published on 15 Apr 2026 - 4:00

score 250 · Answer 3 · 2026-04-14 10:12:31

250

Views

Repeating digits in fractions: Is there a maximal repetition of the same digit?

Published on 14 Apr 2026 - 10:12

score 134 · Answer 4 · 2026-04-14 07:12:12

134

Views

Greatest Common Divisor in a Diophantine Equation

Published on 14 Apr 2026 - 7:12

score 42 · Answer 5 · 2026-04-13 16:57:39

42

Views

Understanding Modulo $(p^n)$ calculation by Binary method

Published on 13 Apr 2026 - 16:57

score 43 · Answer 6 · 2026-04-10 17:35:00

43

Views

Difficulty in showing root of polynomial

Published on 10 Apr 2026 - 17:35

score 249 · Answer 7 · 2026-04-10 02:28:40

249

Views

Euler's totient function applied to higher power triples

Published on 10 Apr 2026 - 2:28

score 87 · Answer 8 · 2026-04-24 09:42:38

87

Views

If $a\equiv b \text{ mod}(c^2) \Longrightarrow a \equiv b \text{ mod}(c)$ proof

Published on 24 Apr 2026 - 9:42

score 396 · Answer 9 · 2026-04-10 21:08:13

396

Views

understanding "lifting" method in Hensel's lemma

Published on 10 Apr 2026 - 21:08

score 433 · Answer 10 · 2026-04-16 09:58:18

433

Views

If the remainder in the division of $a$ by $b$ is $r$ and $c|b$, then...

Published on 16 Apr 2026 - 9:58

score 116 · Answer 11 · 2026-04-14 21:56:24

116

Views

Generating P-adic integers from Hensels lemma, and general question about P-adic integers

Published on 14 Apr 2026 - 21:56

score 437 · Answer 12 · 2026-04-16 07:20:09

437

Views

4 digit number be arranged from 7,2,6,8,5,1 and divisible by 5

Published on 16 Apr 2026 - 7:20

score 529 · Answer 13 · 2026-04-17 13:59:19

529

Views

For any $a$, can we find $b$ and $c$ such that $\phi(a^2)+\phi(b^2)=\phi(c^2)$? ($\phi$ is Euler's totient function.)

Published on 17 Apr 2026 - 13:59

score 81 · Answer 14 · 2026-04-14 04:42:43

81

Views

Understanding a part of the proof of Cauchy's theorem in the abelian case

Published on 14 Apr 2026 - 4:42

score 126 · Answer 15 · 2026-04-11 10:43:42

126

Views

Existence proof of infinite solutions of a diophantine equation

Published on 11 Apr 2026 - 10:43

List Question

For Fibonacci numbers: $\gcd(F_m, F_n) = F_{\gcd(m, n)}$

Find all the positive integers k for which $7 \times 2^k+1$ is a perfect square

Repeating digits in fractions: Is there a maximal repetition of the same digit?

Greatest Common Divisor in a Diophantine Equation

Understanding Modulo $(p^n)$ calculation by Binary method

Difficulty in showing root of polynomial

Euler's totient function applied to higher power triples

If $a\equiv b \text{ mod}(c^2) \Longrightarrow a \equiv b \text{ mod}(c)$ proof

understanding "lifting" method in Hensel's lemma

If the remainder in the division of $a$ by $b$ is $r$ and $c|b$, then...

Generating P-adic integers from Hensels lemma, and general question about P-adic integers

4 digit number be arranged from 7,2,6,8,5,1 and divisible by 5

For any $a$, can we find $b$ and $c$ such that $\phi(a^2)+\phi(b^2)=\phi(c^2)$? ($\phi$ is Euler's totient function.)

Understanding a part of the proof of Cauchy's theorem in the abelian case

Existence proof of infinite solutions of a diophantine equation

Trending Questions

Popular # Hahtags

Popular Questions