faf0/CoinProb
naively computes solutions for the Frobenius coin problem
Finds a prime number with a given number of digits in the decimal representation of a number. Approximates Euler's number e.
This repository is cataloged as part of our automated global GitHub synchronization. Full telemetry, velocity snapshots, and code summaries are scheduled for continuous enrichment.
naively computes solutions for the Frobenius coin problem
network storage service that provides client-side encryption and supports group file sharing
Bash script that creates storyboards for videos. A storyboard is an image consisting of screenshot thumbnail tiles.
Monte Carlo simulation to approximate the quarter area of a circle