Question

Is it possible to find a multiple knowing only: the count of its divisors, the upper limit and some of its divisors (more details)?

score 30 · Answer 1 · 2026-03-26 08:02:27

30

Views

Is it possible to find a multiple knowing only: the count of its divisors, the upper limit and some of its divisors (more details)?

Published on 26 Mar 2026 - 8:02

score 148 · Answer 2 · 2019-03-19 06:46:53

148

Views

Suppose that $T$ is the smallest positive integer satisfying $m^{T}\equiv \pmod {pq}$. Prove that $T\mid(p-1)(q-1)$.

Published on 19 Mar 2019 - 6:46

score 493 · Answer 3 · 2019-03-19 12:49:27

493

Views

How to compute $\gcd(d^{\large 671}\! +\! 1, d^{\large 610}\! −\!1),\ d = \gcd(51^{\large 610}\! +\! 1, 51^{\large 671}\! −\!1)$

Published on 19 Mar 2019 - 12:49

score 248 · Answer 4 · 2019-03-21 08:46:09

248

Views

What is $\gcd(61^{610}+1,61^{671}-1)$?

Published on 21 Mar 2019 - 8:46

score 729 · Answer 5 · 2026-02-23 04:58:22

729

Views

Let $a, b$ and $n$ be natural numbers. Prove that if $a^n$ and $b^n$ are relatively prime, then $a$ and $b$ are relatively prime.

Published on 23 Feb 2026 - 4:58

score 135 · Answer 6 · 2019-03-21 15:18:18

135

Views

GCD of cubic polynomials

Published on 21 Mar 2019 - 15:18

score 191 · Answer 7 · 2026-03-25 21:01:24

191

Views

Conjecture about primes and the greatest common divisor

Published on 25 Mar 2026 - 21:01

score 50 · Answer 8 · 2026-03-25 17:20:58

50

Views

How to prove that if $(ab,n)=1$ then, $(r,n)=1$?

Published on 25 Mar 2026 - 17:20

score 2.7k · Answer 9 · 2019-03-26 03:28:34

2.7k

Views

Prove that if there are integers $m$ and $n$ such that $am +bn =1$ then $a$ and $b$ are coprime.

Published on 26 Mar 2019 - 3:28

score 76 · Answer 10 · 2026-03-25 22:23:50

76

Views

Sum on GCD and prime numbers

Published on 25 Mar 2026 - 22:23

score 187 · Answer 11 · 2019-03-28 17:17:21

187

Views

Triangular numbers and gcd

Published on 28 Mar 2019 - 17:17

score 103 · Answer 12 · 2019-03-29 16:24:58

103

Views

Find $\gcd(a^{2^n}+1,a^{2^m}+1)$ where $m,n$ are two distinct positive integers.

Published on 29 Mar 2019 - 16:24

score 52 · Answer 13 · 2019-03-29 16:39:33

52

Views

Minimum no of bits to represent X

Published on 29 Mar 2019 - 16:39

score 90 · Answer 14 · 2019-03-31 12:44:54

90

Views

Question about Modular Arithmetic

Published on 31 Mar 2019 - 12:44

score 223 · Answer 15 · 2019-04-01 00:49:31

223

Views

Is it true that (k,n+k)=d if and only if (k,n)=d?

Published on 01 Apr 2019 - 0:49

List Question

Is it possible to find a multiple knowing only: the count of its divisors, the upper limit and some of its divisors (more details)?

Suppose that $T$ is the smallest positive integer satisfying $m^{T}\equiv \pmod {pq}$. Prove that $T\mid(p-1)(q-1)$.

How to compute $\gcd(d^{\large 671}\! +\! 1, d^{\large 610}\! −\!1),\ d = \gcd(51^{\large 610}\! +\! 1, 51^{\large 671}\! −\!1)$

What is $\gcd(61^{610}+1,61^{671}-1)$?

Let $a, b$ and $n$ be natural numbers. Prove that if $a^n$ and $b^n$ are relatively prime, then $a$ and $b$ are relatively prime.

GCD of cubic polynomials

Conjecture about primes and the greatest common divisor

How to prove that if $(ab,n)=1$ then, $(r,n)=1$?

Prove that if there are integers $m$ and $n$ such that $am +bn =1$ then $a$ and $b$ are coprime.

Sum on GCD and prime numbers

Triangular numbers and gcd

Find $\gcd(a^{2^n}+1,a^{2^m}+1)$ where $m,n$ are two distinct positive integers.

Minimum no of bits to represent X

Question about Modular Arithmetic

Is it true that (k,n+k)=d if and only if (k,n)=d?

Trending Questions

Popular # Hahtags

Popular Questions