Talk:Dirichlet's approximation theorem: Difference between revisions

Content deleted Content added
Cewbot (talk | contribs)
m Maintain {{WPBS}} and vital articles: 1 WikiProject template. Create {{WPBS}}. Keep majority rating "Stub" in {{WPBS}}. Remove 1 same rating as {{WPBS}} in {{Maths rating}}. Remove 2 deprecated parameters: field, historical.
Line 1:
{{WikiProject banner shell|class=Stub|
{{maths rating
{{WikiProject Mathematics| importance = low}}
| field = number theory
| importance = low
| class = stub
| historical =
}}
 
Hi, I'm a new member and i'm interested in the following closely related problem. Suppose you are given a real number <math>a</math> and a bound <math>c>0</math>. What does the set of all natural (or integral) numbers <math>m</math> satisfying <math>\vert m\cdot a -b\vert \le c</math> for some integer <math>b</math> 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 <math>[i_1,i_2]</math>?
Would be great if anybody could help! Thanks in advance!