Re: A Fibonasty problem-

David C. Ullrich wrote:
In article <_o5dk.3277$7%6.1236@edtnps82>,
"Larry Hammick" <larryhammick@xxxxxxxxx> wrote:

From "knoppix".
Write T =(1+sqrt(5))/2. Let n be a positive integer and suppose that the interval
[Tn - 1/n , Tn + 1/n]
contains an integer. Show that n is a Fibonacci number.

It seems like there are at least two typos here.



Fibonasty:

Only a few matematicians know ironie!? typos: two too.

Ciao: Johan E. Mebius
.

Relevant Pages

  • Re: how to solve this limit?
    ... David C. Ullrich wrote: ... If n happens to be a positive integer then it's ... correct by the binomial theorem, ...
    (sci.math)
  • Re: A Fibonasty problem
    ... Let n be a positive integer and suppose that ... Show that n is a Fibonacci number. ... David Cantrell ...
    (sci.math)
  • Re: please check my homework
    ... Is my bidistfunction correct? ... David ... In the above comment you should specify that n must be a positive integer, ... I'm very concerned with the problem of overflow. ...
    (comp.programming)
  • Re: pigeonhole problem-- fibonacci sequence
    ... > David C. Ullrich wrote: ... >> Aha. ... If N is any positive integer then there exists n such ... >> Hence 0 is a Fibonacci number mod N. QED. ...
    (sci.math)
  • Re: how to solve this limit?
    ... so what do you think if m is a positive integer, ... David C. Ullrich wrote: ... correct by the binomial theorem, ...
    (sci.math)
Quantcast