May 042016
 

\(\alpha\) 是无理数, 则 \(\{n^k\alpha\}\)\((k=1, 2, \dotsc)\) 在区间 \((0, 1)\) 稠密.

这个证明原创应该是 Tao 的, 但 Tao 只证明了一个特殊情况, 并且指出这个手段可以采用来证明更一般的结果(本文结论), 但他没有详细写出.

{nkα}An Elementary Proof on dense of

 Posted by at 7:03 pm

  One Response to “An Elementary Proof on dense of \(\{n^k\alpha\}\)”

  1. […] 第一个手段是 Weyl’s Criterion; 第二个工具是 van der Waerden’s theorem, 可以参看 Terence Tao 的 The ergodic and combinatorial approaches to Szemerédi’s theorem, 但需要进一步的补充. 这值得单独写一篇文章, 请参考吴昊的文章 “An Elementary Proof on dense of ({n^kalpha})” […]

 Leave a Reply

(required)

(required)

This site uses Akismet to reduce spam. Learn how your comment data is processed.