-2
$\begingroup$

Let $G$ be the set of rational numbers of the form $m/n$ , where $m,n$ are positive integers and $n \leq g $ for some possitive integer $g$. Suppose it is bounded by $1/k$ , k is a positive integer less than g.

Prove or disprove that, cardinality of set $G$ is finite.

  • 0
    Hint: Is G bounded?2012-08-12
  • 0
    yes it should be bounded I did some error2012-08-12
  • 0
    "Bounded by $1/k$"? Is that an upper bound, or a lower bound, or what? The set $G$ as defined in the first sentence is not bounded. If there's a boundedness condition, it should be part of the stated definition of $G$. And it should be stated clearly. As now written, it's hard to be sure what is meant.2012-08-12
  • 0
    lower bound is 1/g (from definition no other smaller rational can be written), upper bound is 1/k since k is les than g2012-08-12
  • 0
    $\cfrac1 g$ is a strictly smaller rational than $\cfrac1 k$, and (as far as I can tell from the definition given) is an element of $G$. $2$ is a strictly larger rational than $\cfrac1 k$, and again seems to be an element of $G$.2012-08-12

1 Answers 1

2

More generally, let $g$ be a positive integer and $M$ a positive real number, and let $G$ be the set of rational numbers $m/n$ such that $m$ and $n$ are positive integers, $m/n\le M$, and $n\le g$; then $G$ is finite.

To see this, note first that there are only $g$ possible denominators for members of $G$, namely, the integers $1,2,\dots,g$. Let $n$ be one of these denominators. Then $m/n\le M$ if and only if $m\le Mn$. In other words, $m/n\in G$ if and only if $m$ is one of the $Mn$ integers $1,2,\dots,Mn$. In particular, since $n\le g$, we must have $Mn\le Mg$. Thus, there are only $g$ possible denominators, and for each of them there are at most $Mg$ possible numerators, so altogether there are at most $g(Mg)=Mg^2$ possible fractions in $G$.

  • 0
    Why are we assuming that $G$ is bounded above?2012-08-12
  • 0
    @Cameron: Because mehdi added that hypothesis to the problem.2012-08-12