Found problems: 310
Find the smallest positive integer $n$ that is divisible by $100$ and has exactly $100$ divisors.
Let $(b_n)_{n \ge 0}$ be a sequence of positive integers satisfying $b_n=d\left(\sum_{i=0}^{n-1} b_k\right)$ for all $n \ge 1$. (By $d(m)$ we denote the number of positive divisors of $m$.)
a) Prove that $(b_n)_{n \ge 0}$ is unbounded.
b) Prove that there are infinitely many $n$ such that $b_n>b_{n+1}$.
Let $n>1$ be an integer and $d_1<d_2<\dots<d_m$ the list of its positive divisors, including $1$ and $n$. The $m$ instruments of a mathematical orchestra will play a musical piece for $m$ seconds, where the instrument $i$ will play a note of tone $d_i$ during $s_i$ seconds (not necessarily consecutive), where $d_i$ and $s_i$ are positive integers. This piece has "sonority" $S=s_1+s_2+\dots s_n$.
A pair of tones $a$ and $b$ are harmonic if $\frac ab$ or $\frac ba$ is an integer. If every instrument plays for at least one second and every pair of notes that sound at the same time are harmonic, show that the maximum sonority achievable is a composite number.
Prove that there are infinitely many different natural numbers of the form $k^2 + 1$, $k \in N$ that have no real divisor of this form.
Let’s note the set of all integers $n>1$ which are not divisible by a square of a prime number. We define the number $f(n)$ as the greatest amount of divisors of $n$ which could be chosen in such way so that for each two chosen $a$ and $b$, not necessarily different, the number $a^2+ab+b^2+n$ is not a square. Find all $m$ for which there exists $n$ so that $f(n)=m$.
We call the $main$ $divisors$ of a composite number $n$ the two largest of its natural divisors other than $n$. Composite numbers $a$ and $b$ are such that the main divisors of $a$ and $b$ coincide. Prove that $a=b$.
Call a positive integer $n$ $k$[i]-pretty[/i] if $n$ has exactly $k$ positive divisors and $n$ is divisible by $k$. For example, $18$ is $6$[i]-pretty[/i]. Let $S$ be the sum of positive integers less than $2019$ that are $20$[i]-pretty[/i]. Find $\tfrac{S}{20}$.
Let $D_n$ be the set of divisors of $n$. Find all natural $n$ such that it is possible to split $D_n$ into two disjoint sets $A$ and $G$, both containing at least three elements each, such that the elements in $A$ form an arithmetic progression while the elements in $G$ form a geometric progression.
Let $S$ be the set of positive integer divisors of $20^9.$ Three numbers are chosen independently and at random from the set $S$ and labeled $a_1,a_2,$ and $a_3$ in the order they are chosen. The probability that both $a_1$ divides $a_2$ and $a_2$ divides $a_3$ is $\frac mn,$ where $m$ and $n$ are relatively prime positive integers. Find $m.$
Let $n$ be an even positive integer and let $a, b$ be two relatively prime positive integers.
Find $a$ and $b$ such that $a + b$ is a divisor of $a^n + b^n$.
A positive integer $n{}$ is called [i]discontinuous[/i] if for all its natural divisors $1 = d_0 < d_1 <\cdots<d_k$, written out in ascending order, there exists $1 \leqslant i \leqslant k$ such that $d_i > d_{i-1}+\cdots+d_1+d_0+1$. Prove that there are infinitely many positive integers $n{}$ such that $n,n+1,\ldots,n+2019$ are all discontinuous.
Let $ a(k) $ be the largest odd number by which $ k $ is divisible. Prove that
$$
\sum_{k=1}^{2^n} a(k) = \frac{1}{3}(4^n+2).$$
Determine all the natural numbers $n$ such that exactly one fifth of the natural numbers $1,2,...,n$ are divisors of $n$.
For each positive integer $n$, define $A(n)$ to be the sum of its divisors, and $B(n)$ to be the sum of products of pairs of its divisors. For example,
\[A(10)=1+2+5+10=18\]
\[B(10)=1\cdot 2+1\cdot 5+1\cdot 10+2\cdot 5+2\cdot 10+5\cdot 10=97\]
Find all positive integers $n$ for which $A(n)$ divides $B(n)$.
Determine all positive integers $n>1$ such that for any divisor $d$ of $n,$ the numbers $d^2-d+1$ and $d^2+d+1$ are prime.
[i]Lucian Petrescu[/i]
For a positive integer n the number $P(n)$ is the product of the positive divisors of $n$. For example, $P(20) = 8000$, as the positive divisors of $20$ are $1, 2, 4, 5, 10$ and $20$, whose product is $1 \cdot 2 \cdot 4 \cdot 5 \cdot 10 \cdot 20 = 8000$.
(a) Find all positive integers $n$ satisfying $P(n) = 15n$.
(b) Show that there exists no positive integer $n$ such that $P(n) = 15n^2$.
A positive integer \( n \), which has at least one proper divisor, is divisible by the arithmetic mean of the smallest and largest of its proper divisors (which may coincide). What can be the number of divisors of \( n \)?
[i]A proper divisor of a positive integer \( n \) is any of its divisors other than \( 1 \) and \( n \).[/i]
[i]Proposed by Mykhailo Shtandenko[/i]
Veronica, Ana and Gabriela are forming a round and have fun with the following game. One of them chooses a number and says out loud, the one to its left divides it by its largest prime divisor and says the result out loud and so on. The one who says the number out loud $1$ wins , at which point the game ends. Ana chose a number greater than $50$ and less than $100$ and won. Veronica chose the number following the one chosen by Ana and also won. Determine all the numbers that could have been chosen by Ana.
Natural number $M$ has $6$ divisors, such that sum of them are equal to $3500$.Find the all values of $M$.
For a positive integer $n$, let $\alpha(n)$ be the arithmetic mean of the divisors of $n$, and let $\beta(n)$ be the arithmetic mean of the numbers $k \le n$ with $\text{gcd}(k,n)=1$.
Determine all positive integers $n$ with $\alpha(n)=\beta(n)$.
For a positive integer $n$, we consider all its divisors (including $1$ and itself). Suppose that $p\%$ of these divisors have their unit digit equal to $3$. (For example $n = 117$, has six divisors, namely $1,3,9,13,39,117$. Two of these divisors namely $3$ and $13$, have unit digits equal to $3$. Hence for $n = 117$, $p =33.33...$). Find, when $n$ is any positive integer, the maximum possible value of $p$.
A [i]trio [/i] is a set of three distinct integers such that two of the numbers are divisors or multiples of the third. Which [i]trio [/i] contained in $\{1, 2, ... , 2002\}$ has the largest possible sum? Find all [i]trios [/i] with the maximum sum.
Let $n$ be a natural number. Prove that if $n^5+n^4+1$ has $6$ divisors then $n^3-n+1$ is a square of an integer.
For positive integer $n$ we define $f(n)$ as sum of all of its positive integer divisors (including $1$ and $n$). Find all positive integers $c$ such that there exists strictly increasing infinite sequence of positive integers $n_1, n_2,n_3,...$ such that for all $i \in \mathbb{N}$ holds $f(n_i)-n_i=c$
For any positive integer $n$, let $D_n$ denote the set of all positive divisors of $n$, and let $f_i(n)$ denote the size of the set
$$F_i(n) = \{a \in D_n | a \equiv i \pmod{4} \}$$where $i = 0, 1, 2, 3$.
Determine the smallest positive integer $m$ such that $f_0(m) + f_1(m) - f_2(m) - f_3(m) = 2017$.