As we’ve already discussed, prime factorization is cool, but highly inefficient when it comes to determining if an extremely large number is prime. So here comes an introduction about the Solovay-Strassen primality test. [Read More]

In cryptography, we use large probably prime numbers to encrypt traffic. But how do we know if a large number is prime? [Read More]

What is an index in SQL and what questions should we ask before deciding to use one? [Read More]

Let's discuss how to use checked exceptions, when checked exceptions get in the way of us working, and how we can utilize Lombok's @SneakyThrows to handle checked exceptions. [Read More]

This should be a fairly short post but I’m hoping that by writing it down, I’ll stop googling this same question every time I’m reviewing a pull request that involves a neo4j query. [Read More]