Commit 62a3c5d

authored

Update README.md

1 parent 73ace60 commit 62a3c5dCopy full SHA for 62a3c5d

File tree

-6

lines changed

-6

lines changed

Lines changed: 6 additions & 6 deletions

Original file line number	Diff line number	Diff line change
`@@ -5,17 +5,17 @@ Examples of first few prime numbers are {2, 3, 5, 7,...}`
`5`	`5`
`6`	`6`	`Examples:`
`7`	`7`
`8`		`-Input: n = 11`
	`8`	`+Input: n = 11`
`9`	`9`
`10`		`-Output: true`
	`10`	`+Output: true`
`11`	`11`
`12`		`-Input: n = 15`
	`12`	`+Input: n = 15`
`13`	`13`
`14`		`-Output: false`
	`14`	`+Output: false`
`15`	`15`
`16`		`-Input: n = 1`
	`16`	`+Input: n = 1`
`17`	`17`
`18`		`-Output: false`
	`18`	`+Output: false`
`19`	`19`
`20`	`20`	`A simple solution is to iterate through all numbers from 2 to n-1 and for every number check if it divides n. If we find`
`21`	`21`	`any number that divides, we return false. Instead of checking till n, we can check till √n because a larger factor of n`

Comments

(0)