In number theory, Znám's problem asks which sets of integers have the property that each integer in the set is a proper divisor of the product of the other integers in the set, plus 1. Znám's problem is named after the Slovak mathematician Štefan Znám, who suggested it in 1972, although other mathematicians had considered similar problems around the same time.

The initial terms of Sylvester's sequence almost solve this problem, except that the last chosen term equals one plus the product of the others, rather than being a proper divisor. Sun in 1983 showed that there is at least one solution to the (proper) Znám problem for each ${\displaystyle k\geq 5}$. Sun's solution is based on a recurrence similar to that for Sylvester's sequence, but with a different set of initial values.^[1]

The Znám problem is closely related to Egyptian fractions. It is known that there are only finitely many solutions for any fixed ${\displaystyle k}$. It is unknown whether there are any solutions to Znám's problem using only odd numbers, and there remain several other open questions.

Znám's problem asks which sets of integers have the property that each integer in the set is a proper divisor of the product of the other integers in the set, plus 1. That is, given ${\displaystyle k}$, what sets of integers $${\displaystyle \{n_{1},\ldots ,n_{k}\}}$$ are there such that, for each ${\displaystyle i}$, ${\displaystyle n_{i}}$ divides but is not equal to^[2] $${\displaystyle {\Bigl (}\prod _{j\neq i}^{n}n_{j}{\Bigr )}+1?}$$ A closely related problem concerns sets of integers in which each integer in the set is a divisor, but not necessarily a proper divisor, of one plus the product of the other integers in the set.^[3] This problem does not seem to have been named in the literature, and is referred to here as the improper Znám problem. Any solution to Znám's problem is also a solution to the improper Znám problem, but not necessarily vice versa.^[4]

Znám's problem is named after the Slovak mathematician Štefan Znám, who suggested it in 1972.^[5] Earlier, in 1971, Barbeau had posed the improper Znám problem for ${\displaystyle k=3}$,^[3] and soon afterward Mordell, independently of Znám, found all solutions to the improper problem for ${\displaystyle k\leq 5}$.^[6] Then, in 1975, Skula showed that Znám's problem is unsolvable for ${\displaystyle k<5}$, and credited J. Janák with finding the solution ${\displaystyle \{2,3,11,23,31\}}$ for ${\displaystyle k=5}$.^[2]

Sylvester's sequence is an integer sequence in which each term is one plus the product of the previous terms. The first few terms of the sequence are

Stopping the sequence early produces a set like ${\displaystyle \{2,3,7,43\}}$ that almost meets the conditions of Znám's problem, except that the largest value equals one plus the product of the other terms, rather than being a proper divisor.^[7] Thus, it is a solution to the improper Znám problem, but not a solution to Znám's problem as it is usually defined.

One solution to the proper Znám problem, for ${\displaystyle k=5}$, is ${\displaystyle \{2,3,7,47,395\}}$.^[8] A few calculations will show that

Any solution to the improper Znám problem is equivalent (via division by the product of the values ${\displaystyle x_{i}}$) to a solution to the equation $${\displaystyle \sum {\frac {1}{x_{i}}}+\prod {\frac {1}{x_{i}}}=y,}$$ where ${\displaystyle y}$ as well as each ${\displaystyle x_{i}}$ must be an integer, and conversely any such solution corresponds to a solution to the improper Znám problem. However, all known solutions have ${\displaystyle y=1}$,^[9] so they satisfy the equation $${\displaystyle \sum {\frac {1}{x_{i}}}+\prod {\frac {1}{x_{i}}}=1.}$$ This equation describes an Egyptian fraction representation of the number one as a sum of unit fractions.^[10] The solutions to this equation have been applied to the classification of singularities on surfaces,^[7] and to the theory of nondeterministic finite automata.^[11]

The number of solutions to Znám's problem for any ${\displaystyle k}$ is finite, so it makes sense to count the total number of solutions for each ${\displaystyle k}$.^[8] Sun showed in 1983 that there is at least one solution to the (proper) Znám problem for each ${\displaystyle k\geq 5}$. Sun's solution is based on a recurrence similar to that for Sylvester's sequence, but with a different set of initial values.^[1] The number of solutions for small values of ${\displaystyle k}$, starting with ${\displaystyle k=5}$, forms the sequence:^[9]

2, 5, 18, 96 (sequence A075441 in the OEIS).

Presently, a few solutions are known for ${\displaystyle k=9}$ and ${\displaystyle k=10}$, but it is unclear how many solutions remain undiscovered for those values of ${\displaystyle k}$. However, there are infinitely many solutions if ${\displaystyle k}$ is not fixed: Cao and Jing showed in 1998 showed that there are at least 39 solutions for each ${\displaystyle k\geq 12}$,^[12] improving earlier results proving the existence of fewer solutions;^[13] Sun and Cao conjectured in 1988 that the number of solutions for each value of ${\displaystyle k}$ grows monotonically with ${\displaystyle k}$.^[14]

It is unknown whether there are any solutions to Znám's problem using only odd numbers. With one exception, all known solutions start with 2. If all numbers in a solution to Znám's problem or the improper Znám problem are prime, their product is a primary pseudoperfect number.^[15]

• Giuga number

• PrimeFan, "Solutions to Znám's Problem", archived from the original on 2022-10-04
• Weisstein, Eric W., "Znám's Problem", MathWorld{{cite web}}: CS1 maint: overridden setting (link)