Hello everyone! I just released a new tool and I'm here to spread the word.

Introducing...

PS/CP Toolkit --> biximo.net <--

So, what is this?

If you've ever done competitive programming (CP) or problem solving (PS), you've probably found yourself needing to do something number-theory-related — only to realize it's tedious to do by hand, and no solid, centralized online tool exists for it.

Well, I got tired of waiting for someone else to make it, so I built it myself.

Presenting PS Toolkit V1, a collection of useful number theory utilities. More tools are coming soon — stay tuned!

Features PrimeBrowser Explore all prime numbers up to $$$2^{63} - 1$$$

GetKthPrime Quickly find the $$$k$$$-th prime number (up to $$$2^{31} - 1$$$)

CountPrimes Count how many primes are less than or equal to a given number

PrimeFactorize Perform prime factorization on integers up to $$$2^{63} - 1$$$

countCoprime (Euler's phi function) Compute Euler's totient function $$$\varphi(n)$$$ efficiently (up to $$$2^{63} - 1$$$)

CountDivisors Count the exact number of divisors of a number

GetHighlyCompositeNumber Get the $$$n$$$-th highly composite number

GetPrimeGap Find the largest known gap between consecutive primes

IsPrime Fast and accurate primality testing (up to $$$2^{63} - 1$$$)