https://github.com/kartmaan/math-functions-rust

Some math functions in Rust
https://github.com/kartmaan/math-functions-rust

binomial-coefficient combinations equation factorial fibonacci math math-functions mathematics prime-numbers probability

Last synced: 30 days ago
JSON representation

Some math functions in Rust

• Host: GitHub
• URL: https://github.com/kartmaan/math-functions-rust
• Owner: Kartmaan
• Created: 2024-10-22T12:33:32.000Z (2 months ago)
• Default Branch: master
• Last Pushed: 2024-10-24T11:04:40.000Z (2 months ago)
• Last Synced: 2024-10-25T03:49:16.350Z (about 2 months ago)
• Topics: binomial-coefficient, combinations, equation, factorial, fibonacci, math, math-functions, mathematics, prime-numbers, probability
• Language: Makefile
• Homepage:
• Size: 15.6 MB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# math-functions-rust

Some math functions in Rust

## proba

Probability functions

- `proba_bool`: Tests a probability by returning a bool

- `proba_some`: Tests a probability by returning an Option

- `proba_result`: Tests a probability by returning a Result

- `proba_attempts`: The function tests a chosen probability, several attempts (with prints) will be made until the probability is realized. 

## prime_gen

Generates prime numbers

- `is_prime`: Determines if a number is prime

## fibonacci

Generates and checks Fibonacci numbers

- `fibo-gen`: Generates the first k Fibonacci numbers in a vector.

- `is_fibo`: Checks if a number is a Fibonacci number

## combinations

Number of possible combinations in a given set

- `binomial_combi`: Returns the binomial coefficient, which represents the number of ways to choose k elements from n elements, without repetition.

- `multiset_combi`: Returns the number of multi-set combinations of k elements among n elements, which represents the number of ways to choose k elements among n elements with possible repetition.