FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
Java/src/main/java/com/examplehub/maths/PrimeCheck.java at master · examplehub/Java · GitHub
Uh oh!
There was an error while loading.
Please reload this page
.
examplehub
/
Java
Public
Notifications
You must be signed in to change notification settings
Fork
22
Star
26
Code
Issues
0
Pull requests
1
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
Java
/
src
/
main
/
java
/
com
/
examplehub
/
maths
/
PrimeCheck.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
34 lines (29 loc) · 788 Bytes
Breadcrumbs
Java
/
src
/
main
/
java
/
com
/
examplehub
/
maths
/
PrimeCheck.java
Copy path
File metadata and controls
34 lines (29 loc) · 788 Bytes
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
package
com
.
examplehub
.
maths
;
public
class
PrimeCheck
{
/**
* Check if a number is prime number or not.
*
* @param number the number to be checked.
* @return {@code true} if the given {@code number} is prime, otherwise {@code false}.
*/
public
static
boolean
isPrime
(
long
number
) {
/* negative numbers and 0, 1 are not primes */
if
(
number
<
2
) {
return
false
;
}
/* both of 2 and 3 is primes */
if
(
number
==
2
||
number
==
3
) {
return
true
;
}
/* all even numbers which is larger than 2 are not primers */
if
(
number
%
2
==
0
) {
return
false
;
}
for
(
int
i
=
3
,
limit
= (
int
) (
Math
.
sqrt
(
number
));
i
<=
limit
;
i
+=
2
) {
if
(
number
%
i
==
0
) {
return
false
;
}
}
return
true
;
}
}
Back
|
FazBrowse Home
|
New Git URL