typo

Author: vpoulailleau

interview/Print_PrimeNumbers.md

@@ -16,7 +16,7 @@ int countPrimes(int n)
 // Because 2,3,5,7 is prime numbers
 ```
 
-How would you progrma this function? I think you maybe write like this:
+How would you program this function? I think you maybe write like this:
 
 ```java
 int countPrimes(int n) {
@@ -148,4 +148,4 @@ int countPrimes(int n) {
 
 In parentheses, ther is the inverse of the prime number .The final result is  O(N * loglogN),and readers interested in this can refer to the time complexity of the algorithm
 
-That is all about how to find prime Numbers.The seemingly simple problem does has a lot of details to polish
+That is all about how to find prime Numbers.The seemingly simple problem does has a lot of details to polish