Jump to content

Talk:Dirichlet's approximation theorem

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Geometry guy (talk | contribs) at 15:45, 10 June 2007 (Add maths rating/Comments using AWB). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconMathematics Stub‑class Low‑priority
WikiProject iconThis article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
StubThis article has been rated as Stub-class on Wikipedia's content assessment scale.
LowThis article has been rated as Low-priority on the project's priority scale.

Hi, I'm a new member and i'm interested in the following closely related problem. Suppose you are given a real number and a bound . What does the set of all natural (or integral) numbers satisfying for some integer look like? Has this set any structure makes it easy to deal with it? Does anybody know if there are any good upper or lower bounds for the cardinality of the intersection of this set with a fixed interval ? Would be great if anybody could help! Thanks in advance!