Fixed a few typoes

headers/Problems/Problem27.hpp

@@ -1,7 +1,7 @@
 //ProjectEuler/ProjectEulerCPP/headers/Problems/Problem27.hpp
 //Matthew Ellison
 // Created: 09-14-19
-//Modified: 07-02-21
+//Modified: 07-03-21
 //Find the product of the coefficients, |a| < 1000 and |b| <= 1000, for the quadratic expression that produces the maximum number of primes for consecutive values of n, starting with n=0.
 //Unless otherwise listed all non-standard includes are my own creation and available from https://bibucket.org/Mattrixwv/myClasses
 /*
@@ -49,6 +49,7 @@ public:
 	int64_t getTopA() const;	//Returns the top A that was generated
 	int64_t getTopB() const;	//Returns the top B that was generated
 	int64_t getTopN() const;	//Returns the top N that was generated
+	int64_t getProduct() const;	//Returns the product of A and B for the answer
 };