Znám's problem explained

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. showed that there is at least one solution to the (proper) Znám problem for each

k\ge 5 . Sun's solution is based on a recurrence similar to that for Sylvester's sequence, but with a different set of initial values.

The Znám problem is closely related to Egyptian fractions. It is known that there are only finitely many solutions for any fixed

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.

The problem

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

k , what sets of integers $$\backslash$$are there such that, for each i , n _{i} divides but is not equal to$$\backslash Bigl(\backslash prod\_^n\; n\_j\backslash 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. This problem does not seem to have been named in the literature, and will be referred to 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.

History

Znám's problem is named after the Slovak mathematician Štefan Znám, who suggested it in 1972. had posed the improper Znám problem for

k =3 , and, independently of Znám, found all solutions to the improper problem for k\le 5 . showed that Znám's problem is unsolvable for k< 5 , and credited J. Janák with finding the solution \{ 2 , 3 , 11 , 23 , 31 \} for k =5 .^[1]

Examples

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 areStopping the sequence early produces a set like

\{ 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. 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

k =5 , is \{ 2 , 3 , 7 , 47 , 395 \} . A few calculations will show that

3 × 7 × 47 × 395	+ 1 =	389866,		which is divisible by but unequal to 2,
2 × 7 × 47 × 395	+ 1 =	259911,		which is divisible by but unequal to 3,
2 × 3 × 47 × 395	+ 1 =	111391,		which is divisible by but unequal to 7,
2 × 3 × 7 × 395	+ 1 =	16591,		which is divisible by but unequal to 47, and
2 × 3 × 7 × 47	+ 1 =	1975,		which is divisible by but unequal to 395.

Connection to Egyptian fractions

Any solution to the improper Znám problem is equivalent (via division by the product of the values

x _{i} ) to a solution to the equation$$\backslash sum\backslash frac1\; +\; \backslash prod\backslash frac1=y,$$where y as well as each 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 y =1 , so they satisfy the equation$$\backslash sum\backslash frac1\; +\; \backslash prod\backslash frac1=1.$$That is, they lead to an Egyptian fraction representation of the number one as a sum of unit fractions. Several of the cited papers on Znám's problem study also the solutions to this equation. describe an application of the equation in topology, to the classification of singularities on surfaces, and describe an application to the theory of nondeterministic finite automata.

Number of solutions

The number of solutions to Znám's problem for any

k is finite, so it makes sense to count the total number of solutions for each k . showed that there is at least one solution to the (proper) Znám problem for each k\ge 5 . Sun's solution is based on a recurrence similar to that for Sylvester's sequence, but with a different set of initial values. The number of solutions for small values of k , starting with k =5 , forms the sequence

2, 5,&thinsp;18, 96 .Presently, a few solutions are known for

k =9 and k =10 , but it is unclear how many solutions remain undiscovered for those values of k .However, there are infinitely many solutions if k is not fixed: showed that there are at least 39 solutions for each k\ge 12 , improving earlier results proving the existence of fewer solutions; conjecture that the number of solutions for each value of k grows monotonically with k .

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; it is unknown whether infinitely many solutions of this type exist.

See also

• Giuga number
• Primary pseudoperfect number

References

Sources

• .
• .
• .
• .
• .
• .
• .
• .
• .
• .
• .
• .

Notes and References

1. ;