-
Notifications
You must be signed in to change notification settings - Fork 44
Expand file tree
/
Copy pathmiddleSquareMethod.java
More file actions
38 lines (34 loc) · 918 Bytes
/
middleSquareMethod.java
File metadata and controls
38 lines (34 loc) · 918 Bytes
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
import java.util.Random;
public class Main {
static int rangeArray[]
= { 1, 10, 100, 1000, 10000,
100000, 1000000, 10000000, 100000000 };
static long middleSquareNumber(long num, int digit)
{
long sqn = num * num, nextNum = 0;
int trim = (digit / 2);
sqn = sqn / rangeArray[trim];
for (int i = 0; i < digit; i++) {
nextNum += (sqn % (rangeArray[trim]))
* (rangeArray[i]);
sqn = sqn / 10;
}
return nextNum;
}
public static void main(String args[])
{
int numberOfDigit = 3;
int start = rangeArray[numberOfDigit - 1],
end = rangeArray[numberOfDigit];
Random rand = new Random();
long nextNumber = rand.nextInt(end - start) + start;
System.out.print(
"The random numbers are:\n"
+ nextNumber + ", ");
for (int i = 0; i < 9; i++) {
nextNumber = middleSquareNumber(nextNumber,
numberOfDigit);
System.out.print(nextNumber + ", ");
}
}
}