Found problems: 310
Prove that every natural number is the difference of two natural numbers that have the same number of prime factors. (Each prime divisor is counted once, for example, the number $12$ has two prime factors: $2$ and $3$.)
Let $S$ be a set of positive integers, such that $n \in S$ if and only if $$\sum_{d|n,d<n,d \in S} d \le n$$
Find all positive integers $n=2^k \cdot p$ where $k$ is a non-negative integer and $p$ is an odd prime, such that $$\sum_{d|n,d<n,d \in S} d = n$$
Find all positive integers $n$ such that $\phi (n)$ is a divisor of $n^2+3$.
Let $n$ be an integer that is greater than $1$. Prove that the following two statements are equivalent:
(A) There are positive integers $a, b$ and $c$ that are not greater than $n$ and for which that polynomial $ax^2 + bx + c$ has two different real roots $x_1$ and $x_2$ with $| x_2- x_1 | \le \frac{1}{n}$
(B) The number $n$ has at least two different prime divisors.
A student wrote a correct addition operation $A/B+C/D = E/F$ on the blackboard, where both summands are irreducible and $F$ is the least common multiple of $B$ and $D$. After that, the student reduced the sum $E/F$ correctly by an integer $d$. Prove that $d$ is a common divisor of $B$ and $D$.
Given a positive integer $N$, determine all positive integers $n$, satisfying the following condition: for any list $d_1,d_2,\ldots,d_k$ of (not necessarily distinct) divisors of $n$ such that $\frac{1}{d_1} + \frac{1}{d_2} + \ldots + \frac{1}{d_k} > N$, some of the fractions $\frac{1}{d_1}, \frac{1}{d_2}, \ldots, \frac{1}{d_k}$ add up to exactly $N$.
For any positive integer $n$, let $\tau (n)$ denote the number of its positive divisors (including 1 and itself). Determine all positive integers $m$ for which there exists a positive integer $n$ such that $\frac{\tau (n^{2})}{\tau (n)}=m$.
We denote the number of positive divisors of a positive integer $m$ by $d(m)$ and the number of distinct prime divisors of $m$ by $\omega(m)$. Let $k$ be a positive integer. Prove that there exist infinitely many positive integers $n$ such that $\omega(n) = k$ and $d(n)$ does not divide $d(a^2+b^2)$ for any positive integers $a, b$ satisfying $a + b = n$.
A function $f: Z \to Z$ has the following properties:
$f (92 + x) = f (92 - x)$
$f (19 \cdot 92 + x) = f (19 \cdot 92 - x)$ ($19 \cdot 92 = 1748$)
$f (1992 + x) = f (1992 - x)$
for all integers $x$. Can all positive divisors of $92$ occur as values of f?
For which integers between $2000$ and $2010$ (including) is the probability that a random divisor is smaller or equal $45$ the largest?
Determine all integers $n \geq 2$, satisfying
$$n=a^2+b^2,$$
where $a$ is the smallest divisor of $n$ different from $1$ and $b$ is an arbitrary divisor of $n$.
[i]Proposed by Walther Janous[/i]
Determine all positive integers $n$ for which there exists a positive integer $d$ with the property that $n$ is divisible by $d$ and $n^2+d^2$ is divisible by $d^2n+1$.
Let $1=d_1<d_2<d_3<...<d_k=n$ be all different divisors of positive integer $n$ written in ascending order. Determine all $n$ such that $$d_7^2+d_{10}^2=(n/d_{22})^2.$$
For a positive integer $n$, let $p(n)$ denote the largest prime divisor of $n$. Show that there exist infinitely many positive integers m such that $p(m-1) < p(m) < p(m + 1)$.
For a positive integer $n$, we de ne $D_n$ as the largest integer that is a divisor of $a^n + (a + 1)^n + (a + 2)^n$ for all positive integers $a$.
1. Show that for all positive integers $n$, the number $D_n$ is of the form $3^k$ with $k \ge 0$ an integer.
2. Show that for all integers $k \ge 0$ there exists a positive integer n such that $D_n = 3^k$.
Find all polynomials $P,Q \in Z[x]$ such that every positive integer is a divisor of a certain nonzero term of the sequence $(x_n)_{n=0}^{\infty}$ given by the conditions:
$x_0 = 2016$, $x_{2n+1} = P(x_{2n})$, $x_{2n+2} = Q(x_{2n+1})$ for all $n \ge 0$
For some positive integer $n$, the number $110n^3$ has $110$ positive integer divisors, including $1$ and the number $110n^3$. How many positive integer divisors does the number $81n^4$ have?
$\textbf{(A) }110 \qquad \textbf{(B) } 191 \qquad \textbf{(C) } 261 \qquad \textbf{(D) } 325 \qquad \textbf{(E) } 425$
Show that the divisors of a number $n \ge 2$ can only be divided into two groups in which the product of the numbers is the same if the product of the divisors of $n$ is a square number.
We define $N !!$ to be $N(N - 2)(N -4)...5 \cdot 3 \cdot 1$ if $N$ is odd and $N(N -2)(N -4)... 6\cdot 4\cdot 2$ if $N$ is even .
For example, $8 !! = 8 \cdot 6\cdot 4\cdot 2$ , and $9 !! = 9v 7 \cdot 5\cdot 3 \cdot 1$ .
Prove that $1986 !! + 1985 !!$ i s divisible by $1987$.
(V.V . Proizvolov , Moscow)
Find the three-digit number that has the greatest number of different divisors.
For a positive integer $n$, define the set $S_n$ as $S_n =\{(a, b)|a, b \in N, lcm[a, b] = n\}$ . Let $f(n)$ be the sum of $\phi (a)\phi (b)$ for all $(a, b) \in S_n$. If a prime $p$ relatively prime to $n$ is a divisor of $f(n)$, prove that there exists a prime $q|n$ such that $p|q^2 - 1$.
Positive integers $d_1,d_2,...,d_n$ are divisors of $1995$.
Prove that there exist $d_i$ and $d_j$ among them, such the denominator of the reduced fraction $d_i/d_j$ is at least $n$
Let $n$ be a positive integer.
Prove that every prime $p > 2$ that divides $(2-\sqrt{3})^n + (2+\sqrt{3})^n$ satisfy $p=1 (mod3)$
Prove that there are infinitely many integers $n$ such that both the arithmetic mean of its divisors and the geometric mean of its divisors are integers.
(Recall that for $k$ positive real numbers, $a_1, a_2, \dotsc, a_k$, the arithmetic mean is $\frac{a_1 +a_2 +\dotsb +a_k}{k}$, and the geometric mean is $\sqrt[k]{a_1 a_2\dotsb a_k}$.)
Prove that for a natural number $ n > 2 $ the number $ n! $ is the sum of its $ n $ various divisors.