Square form factorization: Difference between revisions
m
Minor code improvement.
m (Added a comment) |
m (Minor code improvement.) |
||
Line 1,201:
for ( long test : tests ) {
long factor = squfof(test);
if ( factor == 0 ) {
System.out.println(test + "
} else if ( factor == 1 ) {
System.out.println(test + " is a prime number");
} else {
System.out.println(test + " = " + factor + " * " + test / factor);
}
System.out.println();
Line 1,274 ⟶ 1,273:
}
private static class BQF { // Binary quadratic form
public BQF(long aA, long aB, long aC) {
Line 1,301 ⟶ 1,300:
{{ out }}
<pre>
</pre>
| |||