This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 35

2019 Estonia Team Selection Test, 9

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.

2019 Belarus Team Selection Test, 3.1

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.

2019 Brazil Team Selection Test, 1

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.

Russian TST 2019, P1

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.

2014 Federal Competition For Advanced Students, P2, 1

For each positive natural number $n$ let $d (n)$ be the number of its divisors including $1$ and $n$. For which positive natural numbers $n$, for every divisor $t$ of $n$, that $d (t)$ is a divisor of $d (n)$?

2021 Saudi Arabia IMO TST, 9

For a positive integer $n$, let $d(n)$ be the number of positive divisors of $n$, and let $\varphi(n)$ be the number of positive integers not exceeding $n$ which are coprime to $n$. Does there exist a constant $C$ such that $$ \frac {\varphi ( d(n))}{d(\varphi(n))}\le C$$ for all $n\ge 1$ [i]Cyprus[/i]

2023 Czech-Polish-Slovak Junior Match, 2

For a positive integer $n$, let $d(n)$ denote the number of positive divisors of $n$. Determine all positive integers $n$ for which $d(n)$ is the second largest divisor of $n$.

2017 Bosnia And Herzegovina - Regional Olympiad, 4

It is given positive integer $N$. Let $d_1$, $d_2$,...,$d_n$ be its divisors and let $a_i$ be number of divisors of $d_i$, $i=1,2,...n$. Prove that $$(a_1+a_2+...+a_n)^2={a_1}^3+{a_2}^3+...+{a_n}^3$$

2012 Belarus Team Selection Test, 1

For any integer $d > 0,$ let $f(d)$ be the smallest possible integer that has exactly $d$ positive divisors (so for example we have $f(1)=1, f(5)=16,$ and $f(6)=12$). Prove that for every integer $k \geq 0$ the number $f\left(2^k\right)$ divides $f\left(2^{k+1}\right).$ [i]Proposed by Suhaimi Ramly, Malaysia[/i]

2018 China Team Selection Test, 2

A number $n$ is [i]interesting[/i] if 2018 divides $d(n)$ (the number of positive divisors of $n$). Determine all positive integers $k$ such that there exists an infinite arithmetic progression with common difference $k$ whose terms are all interesting.