algorithmic implementations for classical number theory, combinatorics, and series evaluations.
- Pascal's Triangle: iterative combinatorial generation of Pascal's triangle rows
- Prime Generator: trial division checking for prime numbers up to a specified upper bound
- Power Set Subsets: recursive and bitwise subset generation for a set of arbitrary elements
- Roman Numerals: integer to Roman numeral string conversion
- Factorial Series: computation of sum of factorial terms (\sum \frac{1}{n!})
- Armstrong Numbers: search routines identifying Armstrong numbers within target range
- Base Conversion: integer conversion into binary, octal, and hexadecimal formats
- Natural Logarithm Series: numerical approximation of (\ln(1+x)) expansion
- Grade Averaging: aggregate mean computation across grade arrays
python main.py