Update README.md

codeIIEST · Dec 29, 2017 · 73ace60 · 73ace60
1 parent 3f8bd12
commit 73ace60
Showing 1 changed file with 1 addition and 1 deletion.
diff --git a/Competitive Coding/Math/Primality Test/Optimized School Method/README.md b/Competitive Coding/Math/Primality Test/Optimized School Method/README.md
@@ -25,4 +25,4 @@ as (6k + i) for some integer k and for i = ?1, 0, 1, 2, 3, or 4; 2 divides  (6k
 (6k + 3).  So a more efficient method is to test if n is divisible by 2 or 3,  then to check through all the numbers of 
 form 6k ± 1.
 
-Time complexity of this solution is O(√n).
+Time complexity of this solution is O(root(n)).