Gin caching example

For any number N (max 10000), we'll find the largest prime number less than or equal to N.

---