请输入您要查询的字词:

 

单词 ZnamsProblem
释义

Znám’s problem


Given a length k, is it possible to construct a set of integers n1,,nk such that each

ni|(1+jinnj)

as a proper divisor? This is Znám’s problem.

This problem has solutions for k>4, and all solutions for 4<k<9 have been found, and a few for higher k are known. The Sylvester sequence provides many of the solutions. At Wayne University in 2001, Brenton and Vasiliu devised an algorithm to exhaustively search for solutions for a given length, and thus they found all solutions for k=8. Their algorithm, though smarter than a brute force search, is still computationally intense the larger k gets.

Solutions to the problem have applications in continued fractionsDlmfMathworldPlanetmath and perfectly weighted graphs.

The problem is believed to have been first posed by Štefan Znám (http://planetmath.org/VStefanZnam) in 1972. Qi Sun proved in 1983 that there are solutions for all k>4.

References

Brenton, L, and Vasiliu, A. “Znam’s Problem.” Math. Mag. 75, 3-11, 2002.

随便看

 

数学辞典收录了18232条数学词条,基本涵盖了常用数学知识及数学英语单词词组的翻译及用法,是数学学习的有利工具。

 

Copyright © 2000-2023 Newdu.com.com All Rights Reserved
更新时间:2025/5/4 11:20:10