Kiyoto Kai b63a1115b2 Added a new Algorithm to check if a number is prime or not. (#487) ... * Added a new Algorithm to check if a number is prime or not. Added a new Algorithm to check if a number is prime or not. It takes one + half the amount of iterations of the square root of the number. Returns Boolean value. * Fixed possibility of being truncated Changed the 1/2 with a 0.5 * Fixed Major Error Instead of 3, 5, 7 The Loop as checking 2, 4, 6 which would cause all odd numbers to show prime. Fixed by subtracting one. * Fixed Minor Formatting issues Github Merged the 2 previous and current version to make a weird file. * Fixed possibility of being truncated Changed the 1/2 with a 0.5		2018-10-19 19:15:53 +02:00
..
BasicMaths.py	Update Maths/BasicMaths.py	2018-10-14 00:53:44 +05:30
FibonacciSequenceRecursion.py	Improved Code and removed warnings (#482)	2018-10-19 13:28:21 +05:30
GreaterCommonDivisor.py	Refactor gdc and rename two files GreaterCommonDivisor and FibonnaciSequenceRecursive	2018-10-13 22:17:57 +02:00
ModularExponential.py	Added Modular Exponential	2017-12-01 18:57:53 +05:30
PrimeCheck.py	Added a new Algorithm to check if a number is prime or not. (#487)	2018-10-19 19:15:53 +02:00
SegmentedSieve.py	Extra Algorithms added	2018-10-02 21:02:25 +05:30
SieveOfEratosthenes.py	Improved Code and removed Warnings (#483)	2018-10-19 14:00:31 +05:30
SimpsonRule.py	Update SimpsonRule.py	2018-03-19 03:28:00 +01:00
TrapezoidalRule.py	from __future__ import print_function For Python 3	2018-03-19 03:25:29 +01:00