Found problems: 310
Let $n$ be a positive integer. Each number $1, 2, ..., 1000$ has been colored with one of $n$ colours. Each two numbers , such that one is a divisor of second of them, are colored with different colours. Determine minimal number $n$ for which it is possible.
For a positive integer $n$ that is not a power of two, we de fine $t(n)$ as the greatest odd divisor of $n$ and $r(n)$ as the smallest positive odd divisor of $n$ unequal to $1$. Determine all positive integers $n$ that are not a power of two and for which we have $n = 3t(n) + 5r(n)$.
For $ n \in \mathbb{N}$, let $s(n)$ denote the sum of all positive divisors of $n$. Show that for any $n > 1$, the product $s(n - 1)s(n)s(n + 1)$ is an even number.
Let $N$ be the product of all the positive integer divisors of $42$. What is the units digit of $N$?
$
\textbf{(A) }0 \qquad
\textbf{(B) }2 \qquad
\textbf{(C) }4 \qquad
\textbf{(D) }6 \qquad
\textbf{(E) }8 \qquad
$
For a positive integer $m$ we denote by $\tau (m)$ the number of its positive divisors, and by $\sigma (m)$ their sum. Determine all positive integers $n$ for which $n \sqrt{ \tau (n) }\le \sigma(n)$
A family of finite sets $\left\{ A_{1},A_{2},.......,A_{m}\right\} $is called [i]equipartitionable [/i] if there is a function $\varphi:\cup_{i=1}^{m}$$\rightarrow\left\{ -1,1\right\} $ such that $\sum_{x\in A_{i}}\varphi\left(x\right)=0$ for every $i=1,.....,m.$ Let $f\left(n\right)$ denote the smallest possible number of $n$-element sets which form a non-equipartitionable family. Prove that
a) $f(4k +2) = 3$ for each nonnegative integer $k$,
b) $f\left(2n\right)\leq1+m d\left(n\right)$, where $m d\left(n\right)$ denotes the least positive non-divisor of $n.$
Let $A$ be the set of positive integer divisors of $2025$. Let $B$ be a randomly selected subset of $A$. The probability that $B$ is a nonempty set with the property that the least common multiple of its element is $2025$ is $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.
Find all odd positive integers $ n > 1$ such that if $ a$ and $ b$ are relatively prime divisors of $ n$, then $ a\plus{}b\minus{}1$ divides $ n$.
Find all natural numbers that have exactly six divisors whose sum is $3500$.
Determine all pairs $(n, k)$ of distinct positive integers such that there exists a positive integer $s$ for which the number of divisors of $sn$ and of $sk$ are equal.
Let $n$ be a positive integer. Show that every divisors of $2n^2 - 1$ gives a different remainder after division by $2n$.
Prove that for any integers $ n> m> 0 $ the number $ 2 ^n-1 $ has a prime divisor not dividing $ 2 ^m-1 $.
Find all natural numbers which are divisible by $30$ and which have exactly $30$ different divisors.
(M Levin)
Let $S$ be the set of positive integers $N$ with the property that the last four digits of $N$ are $2020$, and when the last four digits are removed, the result is a divisor of $N$. For example, $42,020$ is in $S$ because $4$ is a divisor of $42,020$. Find the sum of all the digits of all the numbers in $S$. For example, the number $42,020$ contributes $4+2+0+2+0=8$ to this total.
Find all integers $k \ge 5$ for which there is a positive integer $n$ with exactly $k$ positive divisors
$1 = d_1 <d_2 < ... <d_k = n$ and $d_2d_3 + d_3d_5 + d_5d_2 = n$.
Determine all pairs $(n, k)$ of distinct positive integers such that there exists a positive integer $s$ for which the number of divisors of $sn$ and of $sk$ are equal.
Determine all positive integers $n$ which have a divisor $d$ with the property that $dn + 1$ is a divisor of $d^2 + n^2$.
Find all the pairs $(n, m)$ of positive integers which fulfil simultaneously the conditions:
i) the number $n$ is composite;
ii) if the numbers $d_1, d_2, ..., d_k, k \in N^*$ are all the proper divisors of $n$, then the numbers $d_1 + 1, d_2 + 1, . . . , d_k + 1$ are all the proper divisors of $m$.
Let $p_1,p_2,\ldots,p_n$ be distinct primes greater than $3$. Show that $2^{p_1p_2\cdots p_n}+1$ has at least $4^n$ divisors.
Let $p, q$ be two distinct primes. Prove that there are positive integers $a, b$ such that the arithmetic mean of all positive divisors of the number $n = p^aq^b$ is an integer.
If $d_1,d_2,...,d_k$ are all distinct positive divisors of $n$, we defi ne $f_s(n) = d_1^s+d_2^s+..+d_k^s$.
For example, we have $f_1(3) = 1 + 3 = 4, f_2(4) = 1 + 2^2 + 4^2 = 21$.
Prove that for all positive integers $n$, $n^3f_1(n) - 2nf_9(n) + n^2f_3(n)$ is divisible by $8$.
Let us call the number of factors in the prime decomposition of an integer $n > 1$ the complexity of $n$. For example, [i]complexity [/i] of numbers $4$ and $6$ is equal to $2$. Find all $n$ such that all integers between $n$ and $2n$ have complexity
a) not greater than the complexity of $n$.
b) less than the complexity of $n$.
(Boris Frenkin)
Let $n \geq 2$ be a positive integer. If $m$ is a positive integer, for which all of its positive divisors can be split into $n$ disjoint sets of equal sum, prove that $m \geq 2^{n+1}-2$
An integer $N > 1$ is written on the board. Alex writes a sequence of positive integers, obtaining new integers in the following manner: he takes any divisor greater than $1$ of the last number and either adds it to, or subtracts it from the number itself. Is it always (for all $N > 1$) possible for Alex to write the number $2011$ at some point?
Let $d(n)$ be the sum of positive integers divisors of number $n$ and $\phi(n)$ the quantity of integers in the interval $[0,n]$ such that these integers are coprime with $n$. For instance $d(6)=12$ and $\phi(7)=6$.
Determine if the set of the integers $n$ such that, $d(n)\cdot \phi (n)$ is a perfect square, is finite or infinite set.