Repository navigation
Expand file tree
/
Copy pathExercises.java
More file actions
93 lines (83 loc) · 2.21 KB
/
Copy pathExercises.java
File metadata and controls
93 lines (83 loc) · 2.21 KB
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
import java.util.*;
public class Exercises {
public static void main(String args[]) {
System.out.println("5! = " + factorial(5));
System.out.println("Is 7 prime? " + isPrime(7));
System.out.print("First 5 prime numbers: ");
nPrimes(5);
}
public static int factorial(int number) {
int result = 1;
for (int i = 1; i <= number; i++) {
result *= i;
}
return result;
}
public static int factorial2(int number) {
if (number == 1) {
return 1;
}
return number * factorial2(number - 1);
}
public static boolean isPrime(int number) {
if (number <= 1)
return false;
int primecount = 0;
for (int i = 2; i < number; i++) {
if (number % i == 0) {
primecount++;
}
}
if (primecount == 0) {
return true;
}
return false;
}
public static void nPrimes(int number2) {
int count = 0;
int num = 2;
while (count < number2) {
if (isPrime(num)) {
System.out.print(num + ",");
count++;
}
num++;
}
}
public static boolean perfectNumber(int number) {
int sum = 0;
for (int i = 1; i <= number / 2; i++) {
if (number % i == 0) {
sum += i;
}
}
if (sum == number) {
return true;
}
return false;
}
public static void nPerfectNumber(int number) {
int count = 0;
int num = 1;
while (count < number) {
if (perfectNumber(num)) {
System.out.print(num + ", ");
count++;
}
num++;
}
}
public static void displayStatistic(int n) {
Scanner scn = new Scanner(System.in);
int sum = 0;
int originalN = n;
System.out.println("Enter a " + n + " numbers:");
while (n > 0) {
int number = scn.nextInt();
sum += number;
n--;
}
double mean = (double) sum / originalN;
System.out.println("Mean: " + mean);
}
}