So this is my Java code for Project Euler #7(description of problem commented out in code):
// By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13,