马尔可夫数.docVIP

  • 14
  • 0
  • 约2.69千字
  • 约 6页
  • 2017-03-27 发布于江苏
  • 举报
马尔可夫数

马尔可夫数:A Markov number is an integer x , y or z that fits in the Diophantine equation x2+y2+z2=3xyz and gives a Lagrange number Lx=9?4x2 (or y or z as the case may be). The solutions, (1, 1, 1), (1, 1, 2), (1, 2, 5), (1, 5, 13), (2, 5, 29), (1, 13, 34), (1, 34, 89), (2, 29, 169), (5, 13, 194), (1, 89, 233), etc., can be put in a binary graph tree. Thus arranged, the numbers on 1s branch are Fibonacci numbers with odd index, and the numbers on 2s branch are Pell numbers with odd index. Georg Frobenius proved that, with the exception of the smallest Markov triple, the numbers in a Markov trip

文档评论(0)

1亿VIP精品文档

相关文档