FilesExpand file tree

 main

/

AmandaInteger.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

105 lines (89 loc) · 1.74 KB

 main

/

AmandaInteger.java

Copy path

Top

File metadata and controls

• Code
• Blame

105 lines (89 loc) · 1.74 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

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

63

64

65

66

67

68

69

70

71

72

73

74

75

76

77

78

79

80

81

82

83

84

85

86

87

88

89

90

91

92

93

94

95

96

97

98

99

100

101

102

103

104

105

/* Amanda Sherman

* 01/22/2023

* Bellevue University

* Module 3 Assignment */

package module_23;

class AmandaInteger {

int amanda;

//constructor

public AmandaInteger(int amanda) {

this.amanda = amanda;

}

//getter

public int getAmanda() {

return amanda;

}

//setter

public void setAmanda(int newAmanda) {

this.amanda = newAmanda;

}

public boolean isEven() {

if (amanda % 2 == 0)

return true;

else

return false;

}

public boolean isOdd() {

if (amanda % 2 != 0)

return true;

else

return false;

}

public boolean isPrime() {

boolean flag = false; //taken from https://www.programiz.com/java-programming/examples/prime-number

for (int i = 2; i <= amanda / 2; ++i) {

if (amanda % i == 0) {

flag = true;

break;

}

}

if (!flag)

return true;

else

return false;

}

public static boolean isEven(int amanda) {

return amanda % 2 == 0;

}

public static boolean isOdd(int amanda) {

return amanda % 2 != 0;

}

public static boolean isPrime(int amanda) {

boolean flag = false;

for (int i =2; i <= amanda / 2; ++i) {

if (amanda % i == 0) {

flag = true;

break;

}

}

if (!flag)

return true;

else

return false;

}

public static boolean isEven(Integer amanda) {

return amanda % 2 == 0;

}

public static boolean isOdd(Integer amanda) {

return amanda % 2 != 0;

}

public static boolean isPrime(Integer amanda) {

boolean flag = false;

for (int i =2; i <= amanda / 2; ++i) {

if (amanda % i == 0) {

flag = true;

break;

}

}

if (!flag)

return true;

else

return false;

}

public boolean equals(int amanda) {

return this.amanda == amanda;

}

public boolean equals(Integer amanda) {

return this.amanda == amanda.intValue();

}

}