wball/PolymathREU-Walking-to-infinity-on-special-sequences
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

fixed minor bug in prime testing java function

Browse source
This commit is contained in:
William Ball 2020-07-17 22:41:46 -07:00
parent 0e62b02c92
commit 4abb208669
3 changed files with 10 additions and 8 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

10
java/append_primes/Main.java
View file

@ -6,14 +6,8 @@ public class Main
{
Util.init();
ArrayList<Long> vals = new ArrayList<Long>();
vals.add(2l);
vals.add(3l);
vals.add(5l);
vals.add(7l);
Tree tree = new Tree(0, vals);
for (int i = 0; i < 20; i++) {
Tree tree = new Tree(0, new ArrayList<Long>());
for (int i = 0; i < 9; i++) {
tree.step();
Util.printList(tree.longestPath());
}

4
java/append_primes/Util.java
View file

@ -17,6 +17,10 @@ class Util
if (primes.containsKey(val)) {
return primes.get(val);
}
if (val < 2) {
primes.put(val, false);
return false;
}
for (int i = 2; i * i <= val; i++) {
if (val % i == 0) {
primes.put(val, false);

4
java/template/Util.java
View file

@ -21,6 +21,10 @@ class Util
if (primes.containsKey(val)) {
return primes.get(val);
}
if (val < 2) {
primes.put(val, false);
return false;
}
for (int i = 2; i * i <= val; i++) {
if (val % i == 0) {
primes.put(val, false);