Path: csiph.com!usenet.pasdenom.info!gegeweb.org!de-l.enfer-du-nord.net!feeder1.enfer-du-nord.net!feeds.phibee-telecom.net!newsfeed.xs4all.nl!newsfeed6.news.xs4all.nl!xs4all!post.news.xs4all.nl!not-for-mail
Newsgroups: comp.lang.python
Date: Tue, 18 Sep 2012 08:14:42 -0700 (PDT)
In-Reply-To: <mailman.871.1347974704.27098.python-list@python.org>
Complaints-To: groups-abuse@google.com
Injection-Info: glegroupsg2000goo.googlegroups.com; posting-host=123.192.32.215; posting-account=5JdMBQoAAABHnS4mjpqEzxnmWtgiiVNw
References: <XnsA0CE7D6F43F18duncanbooth@127.0.0.1> <1017333532.1009581.1347628946603.JavaMail.root@sequans.com> <CAF_E5JY6c+QfYGo9N=0p7HdSa6NX8oL-Hj9gR6=7TayQeOqmoA@mail.gmail.com> <CAPTjJmoSt84L_kpKWSUPLUJ38wDVp8ukHovd1QkFYUuJAnoeRQ@mail.gmail.com> <CAF_E5JZR+2RvZXaMUAsS8nND2pcC06+om2WP+ncWfY-4Z=aPtg@mail.gmail.com> <mailman.715.1347643815.27098.python-list@python.org> <abram3Fl44sU3@mid.individual.net> <mailman.871.1347974704.27098.python-list@python.org>
User-Agent: G2/1.0
MIME-Version: 1.0
Subject: Re: Decorators not worth the effort
From: 88888 Dihedral <dihedral88888@googlemail.com>
To: comp.lang.python@googlegroups.com
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: quoted-printable
Cc: python-list@python.org
Precedence: list
Message-ID: <mailman.876.1347981286.27098.python-list@python.org>
Lines: 50
NNTP-Posting-Host: 2001:888:2000:d::a6
Xref: csiph.com comp.lang.python:29434

Chris Angelico=E6=96=BC 2012=E5=B9=B49=E6=9C=8818=E6=97=A5=E6=98=9F=E6=9C=
=9F=E4=BA=8CUTC+8=E4=B8=8B=E5=8D=889=E6=99=8225=E5=88=8604=E7=A7=92=E5=AF=
=AB=E9=81=93=EF=BC=9A
> On Tue, Sep 18, 2012 at 11:19 PM, Neil Cerutti <neilc@norwich.edu> wrote:
>=20
> > On 2012-09-14, Chris Angelico <rosuav@gmail.com> wrote:
>=20
> >> But then again, who actually ever needs fibonacci numbers?
>=20
> >
>=20
> > If it should happen that your question is not facetious:
>=20
> >
>=20
> > http://en.wikipedia.org/wiki/Fibonacci_number#Applications
>=20
>=20
>=20
> It wasn't entirely facetious. I know there are a few cases where
>=20
> they're needed, but I think they're calculated far more often to
>=20
> demonstrate algorithms than because you actually have use of them. :)
>=20
>=20
>=20
> Though it's as well to mention these sorts of things now and then. I
>=20
> remember one time writing up something or other, and my dad was
>=20
> looking over my shoulder and asked me why I'd written a little
>=20
> Pascal's Triangle generator. He didn't know that it had direct
>=20
> application to whatever-it-was. And unfortunately I don't remember
>=20
> what I was even writing at the time :)
>=20
>=20
>=20
> ChrisA

I would suggest one should solve the Fibnaci(50000) first and fast in Pytho=
n.

Then one can think about computing c(n,k) in Python for large n.


Then