Showing 5 open source projects for "fibonacci"

View related business solutions
  • $300 Free Credits for Your Google Cloud Projects Icon
    $300 Free Credits for Your Google Cloud Projects

    Start building on Google Cloud with $300 in free credits. No commitment, no credit card required until you're ready to scale.

    Launch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
    Start Free Trial
  • Error to trace to log to deploy. One click. No SSH. Icon
    Error to trace to log to deploy. One click. No SSH.

    Catch the cause before the pager goes off.

    AppSignal links every error to the trace, the trace to the log, the log to the deploy that shipped it.
    Free 30 days.
  • 1
    Mad Math is a Math API for Java that is aimed at adding needed math functions and formulas that are not in the regular Java Math API, such as fibonacci sequence, is prime, area formulas, greatest common factor, least common multiple etc.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 2
    BigAl

    BigAl

    a free cross platform calculator for calculating BIG numbers

    BigAl is a free open source and platform independent software for calculating really BIG numbers. It supports not only standard arithmetic, but also exact period determination, predefined factorials, fibonacci with seeds, factorization, nth root, etc
    Downloads: 2 This Week
    Last Update:
    See Project
  • 3
    Generator of uniformly distributed random numbers where there are many methods (algorithms) of random numbers generations available (Fibonacci generator,Marsaglia's MWC generator, etc). As many, as possible.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 4
    A tool written in C++ to generate very large Fibonacci numbers using the primary recursive formula: F(n) = F(n-1) + F(n-2) n > 1; F(1) = 1, F(0) = 0.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Our Free Plans just got better! | Auth0 Icon
    Our Free Plans just got better! | Auth0

    With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.

    You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
    Try free now
  • 5
    Mathfun.py is a Python library that contains those little bits of mathemagical ideas that we all enjoy. Primes, prime factorization, Fibonacci sequences, string2value functions...
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next
Auth0 Logo