论文标题
西尔维斯特的猜想和埃及分数
Sylvester's Conjecture and the Egyptian Fractions
论文作者
论文摘要
本文试图使用具有两种关键成分的埃及分数来证明西尔维斯特的猜想。首先，创建一组运算符，这些操作员完全生成了所有可能的埃及分数为1。
This paper attempts to prove the Sylvester's conjecture using Egyptian Fractions with two key ingredients. First, creating a set of operators that completely generates all possible Egyptian fraction of 1. And second, to detect patterns in every operator that surely will generate a new number which are relatively prime to all that came before.
