FilesExpand file tree

master

/

Task02.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

44 lines (40 loc) · 1.07 KB

master

/

Task02.java

Copy path

Top

File metadata and controls

• Code
• Blame

44 lines (40 loc) · 1.07 KB

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

35

36

37

38

39

40

41

42

43

44

/* Task02

*

* Implement a boolean method public static boolean isPrime(int x) which

* returns TRUE if number is prime and returns FALSE if number is not prime.

*/

public class Task02 {

public static void main(String[] args) {

/*

* No need to modify main method. Just make sure your method satisfies

* ALL possible test cases according to task instructions, such as

* below.

*/

System.out.println(isPrime(9)); // false

System.out.println(isPrime(8)); // false

System.out.println(isPrime(17)); // true

System.out.println(isPrime(47)); // true

System.out.println(isPrime(2)); // true

System.out.println(isPrime(1)); // false

System.out.println(isPrime(0)); // false

System.out.println(isPrime(-3)); // false

}

/**

*

* @param x

* given integer

* @return True if integer x is Prime and False otherwise

*/

public static boolean isPrime(int x) {

// First if statement for cases x=1 or x<=0

if (x == 1 || x <= 0) {

return false;

}

for (int i = 2; i < x; i++) {

if (x % i == 0) {

return false;

}

}

return true;

}

}