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

Introducing...

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

So, what is this thing?

If you’ve ever done competitive programming (CP) or problem solving (PS), you probably know how annoying it can be to do certain things manually. And while you'd think there’d be a convenient website with all the tools in one place... turns out, nope. No one made one.

So I did.

PS Toolkit V1 is packed with useful number theory tools — and more features are on the way! Please check it out and share if you find it helpful!

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 gap between consecutive primes

IsPrime

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