diff --git a/src/main/java/org/rancore/math/CollatzConjecture.java b/src/main/java/org/rancore/math/CollatzConjecture.java index 75090fc..8a4190d 100644 --- a/src/main/java/org/rancore/math/CollatzConjecture.java +++ b/src/main/java/org/rancore/math/CollatzConjecture.java @@ -10,14 +10,11 @@ *

The CollatzConjecture class provides a method for calculating the Hailstone sequence, * also known as the 3n+1 problem. The conjecture asks whether repeating two simple arithmetic * operations will eventually transform every positive integer into 1.

- * Some values produce intermediates as high as 2.7*10^7 (for n = 9663) + * Some values produce intermediates as high as 2.7*10^7 (for n = 9663). * *

Instance Variables:

*

bool debug

* - *

Constructor:

- *

CollatzConjecture(): Constructs a new instance of the CollatzConjecture class.

- * *

Methods:

*

collatzConjecture(int n): Calculates the Collatz conjecture.

*/