🧮 Explore and generate integer sequences interactively with adjustable parameters and initial conditions in this lightweight PWA.

🤖 Optimize your AI coding tools with curated dot files and guidelines to boost your productivity in AI-powered development.

The pattern repeats. The sequence grows. Contribute to complete it.

Java program demonstrating multithreaded Fibonacci computation using recursive and dynamic programming approaches.

Compute the nth Fibonacci number. Optimized for speed with my own bignum implementation written in C and x86 Assembly.

Return any (big) fibonacci number

My solutions for CODEWARS: A collection of TDD katas (simple programs) written in JavaScript, Python, and more to learn and have fun!

Tool and go package to find large Fibonacci number in a limited time and/or compute a specific Fibonacci number to a really high index.

Sleek, Minimal, and Freely Accessible Planning Poker in vue

Compute the Fibonacci number index.

Compute the Fibonacci number index of a single-precision floating-point number.

This project explores recursion through two classic computer science problems: Fibonacci Sequence and Merge Sort. Both examples demonstrate how a problem can be broken down into smaller subproblems, the essence of recursive thinking.

Compute the nth negaFibonacci number as a single-precision floating-point number.

Compute the nth non-Fibonacci single-precision floating-point number.

Compute the nth non-Fibonacci number.

Compute the nth negaLucas number in single-precision floating-point format.

Compute the nth Lucas number as a single-precision floating-point number.

Compute the nth negaLucas number.

Compute the nth negaFibonacci number.