All problems

Integer Break

Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers.

Count Primes

title: Find Primes subtitle: Sieve of Eratosthenes tags: [“solution”] Count the number of prime numbers less than a non-negative number, n.