Contains realisations of common-used math functions and classical algorithms, written in Scala's pure-functional style.

C++ code for finding Carmichael Numbers with many factors

Exercises in Python notebook to implement the RSA encryption algorithm, and figure out if huge numbers are primes via Fermat test. Explanation provided via comments in Japanese.

Scripts that detect whether a number is a carmichael number/pseudoprime. ( Part of a university project )

Solved tasks of "Randomized Algorithms" university course, contains implementations of main randomized algorithms.

I have compiled (hehe) some interesting code developed throughout my time in the degree I studied.