- Sets.
- Numbers.
- Integer division and remainder. Number of digits in a, a from Ν.
- Sum and Product notations.
- Exponent, Logarithm and roots.
- Factorial. Recurrent functions.
- Fill matrix diagonal.
- Fill matrix in spiral.
- Number of digits of product and natural number.
- Prime numbers and function phi(x).
- Write a program that checks the Goldbach's conjecture hypothesis.
- Write a program the checks the Oppermann's conjecture hypothesis.
- Write a program using Wilson Theorem as Primality Test.
- Write a program using previous already found primes for Primality Test.
- Implement the Sieve of Eratosthenes, reimplement it optimized and compare with initial.
- Primes in interval [a, b].
- Count trailing zeroes by factoring to 2 and 5.
- Find the first n Mersenne numbers, using Lucas–Lehmer primality test.
- Factorization, Perfect Numbers and sum of reciprocal factors.
- Binomial Coefficients and Pascal's Triangle.
MIT License
Copyright (c) 2017 Chris B. Kirov
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.