Kushal Naidu 75d11f9034 Correctly check for squares of primes (#549) ... As the for-loop was looping by two numbers, it would stop at 1 number less than the root of prime squares, resulting it in incorrectly classifying the squares as prime numbers. Incrementing the loop ensures the next number is also considered resulting in accurate classification.		2018-10-30 14:38:44 +01:00
..
basic_maths.py	snake_case all the things	2018-10-19 17:14:25 -05:00
fibonacci_sequence_recursion.py	snake_case all the things	2018-10-19 17:14:25 -05:00
greater_common_divisor.py	snake_case all the things	2018-10-19 17:14:25 -05:00
modular_exponential.py	snake_case all the things	2018-10-19 17:14:25 -05:00
PrimeCheck.py	Correctly check for squares of primes (#549)	2018-10-30 14:38:44 +01:00
segmented_sieve.py	snake_case all the things	2018-10-19 17:14:25 -05:00
sieve_of_eratosthenes.py	all valid python 3	2018-10-20 14:45:08 -05:00
simpson_rule.py	snake_case all the things	2018-10-19 17:14:25 -05:00
trapezoidal_rule.py	snake_case all the things	2018-10-19 17:14:25 -05:00