Commit 73ace60

authored

Update README.md

1 parent 3f8bd12 commit 73ace60Copy full SHA for 73ace60

File tree

-1

lines changed

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -25,4 +25,4 @@ as (6k + i) for some integer k and for i = ?1, 0, 1, 2, 3, or 4; 2 divides (6k`
`25`	`25`	`(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`
`26`	`26`	`form 6k ± 1.`
`27`	`27`
`28`		`-Time complexity of this solution is O(√n).`
	`28`	`+Time complexity of this solution is O(root(n)).`

Comments

(0)