Newbetuts
.
New posts in divisibility
Proving that if $a,b$ are even, then $\gcd(a,b) = 2 \gcd(a/2, b/2)$ [duplicate]
proof-writing
divisibility
On the diophantine equation $x^{m-1}(x+1)=y^{n-1}(y+1)$ with $x>y$, over integers greater or equal than two
number-theory
elementary-number-theory
divisibility
diophantine-equations
prime-factorization
Family of GCDs all equal to $2$
number-theory
recurrence-relations
divisibility
Probability that $7^m+7^n$ is divisible by $5$
probability
combinatorics
divisibility
If $ar + bs =1$, then $\gcd(a,s) = \gcd(r,b) = \gcd(r,s) = 1$ [duplicate]
elementary-number-theory
proof-writing
divisibility
gcd-and-lcm
Proving $11$ never divides $64^n +22^n -2$
elementary-number-theory
proof-writing
divisibility
Divisibility of $6^{2^n}+ 8^{2^n} +12^{2^n}+14^{2^n}+16^{2^n}+18^{2^n} +24^{2^n} +28^{2^n}+42^{2^n}$
elementary-number-theory
divisibility
Prove that if $\gcd(a,b)=1$ then $\gcd(ab,c) = \gcd(a,c) \gcd(b,c)$
elementary-number-theory
divisibility
gcd-and-lcm
Understanding a proof that $2x + 3y$ is divisible by $17$ iff $9x + 5y$ is divisible by $17$
number-theory
elementary-number-theory
divisibility
proof-explanation
Why do even numbers which surround primes have more divisors than those which surround composites?
number-theory
elementary-number-theory
prime-numbers
divisibility
analytic-number-theory
If a power of 2 divides a number, under what conditions does it divide a binomial coefficient involving the number that it divides?
combinatorics
number-theory
binomial-coefficients
divisibility
gcd-and-lcm
Primality of the numbers in the form of $2n^2-1$
number-theory
prime-numbers
divisibility
Greatest common divisor of two relatively primes
elementary-number-theory
divisibility
Show divisibility by 7
elementary-number-theory
divisibility
problem-solving
pythagorean-triples
Showing that it is not possible that for every $q_j$ it holds that $2+\prod_{k \neq j} q_k $ is divisible by $q_j$.
elementary-number-theory
prime-numbers
modular-arithmetic
divisibility
integers
$9$ divides $n-r(n)$ where $r(n)$ is $n$ with its digits reversed
elementary-number-theory
divisibility
Proving $(x-c)|(p(x)-p(c))$
abstract-algebra
algebra-precalculus
polynomials
divisibility
Does zero divide zero
divisibility
Given 7 arbitrary integers,sum of 4 of them is divisible by 4
divisibility
pigeonhole-principle
Elementary number theory in sets
combinatorics
elementary-number-theory
discrete-mathematics
divisibility
pigeonhole-principle
Prev
Next