Question 761962: Please help me on this problem: Suppose "k" is some positive interger. Consider numbers of the form √n) where "n" is a positive interger. In terms of "k," how many numbers of this form differ from "k" bh less than 1? Explain why your answer works in general. (Hint: for this question it may help to try some small values of "k" and search for a pattern in the results. For example, if k= 2 there are 7 numbers of the desired form that differ from "k" by less than one since √2), √3), √4), √5), √6), √7), and √8) are the only such numbers that differ from 2 by less than 1. Now, try k=3 and so forth. After you find a formula think about why your formula works in general.)
Answer by ramkikk66(644) (Show Source):
| |
|