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
|
// list_cubics.cc: Program for listing integer cubics with given discriminant bound
//////////////////////////////////////////////////////////////////////////
//
// Copyright 1990-2012 John Cremona
//
// This file is part of the eclib package.
//
// eclib is free software; you can redistribute it and/or modify it
// under the terms of the GNU General Public License as published by the
// Free Software Foundation; either version 2 of the License, or (at your
// option) any later version.
//
// eclib is distributed in the hope that it will be useful, but WITHOUT
// ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
// FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
// for more details.
//
// You should have received a copy of the GNU General Public License
// along with eclib; if not, write to the Free Software Foundation,
// Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
//
//////////////////////////////////////////////////////////////////////////
#include <eclib/marith.h>
#include <eclib/unimod.h>
#include <eclib/polys.h>
#include <eclib/cubic.h>
int main()
{
initprimes("PRIMES");
bigint disc, absdisc, maxdisc;
int neg;
int verbose=0, include_reducibles=1, gl2=0;
cerr << "Verbosity level (0, 1 or 2): ";
cin >> verbose;
while(cerr << "Enter discriminant bound (positive or negative, 0 to stop): ", cin >> maxdisc, !is_zero(maxdisc))
{
cerr << "Include reducible cubics? (0 or 1): ";
cin >> include_reducibles;
cerr << "Use GL(2,Z)-equivalence instead of SL(2,Z)? (0 or 1): ";
cin >> gl2;
neg=(maxdisc<0);
if (include_reducibles)
cout << "Cubics with ";
else
cout << "Irreducible cubics with ";
if(neg)
{
::negate(maxdisc);
cout << "negative discriminant down to -";
}
else
{
cout << "positive discriminant up to ";
}
cout << maxdisc;
cout << " up to " << (gl2?"GL":"SL") << "(2,Z)-equivalence";
cout << endl;
for(absdisc=1; absdisc<=maxdisc; absdisc++)
{
disc=absdisc;
if(neg) ::negate(disc);
vector<cubic> glist = reduced_cubics(disc, include_reducibles, gl2, verbose);
if (glist.size()==0)
{
if(verbose>1)
{
cout<< "No ";
if (!include_reducibles) cout << "irreducible";
cout << " cubics with discriminant " << disc << endl;
}
}
else
{
cout << glist.size();
cout << " with discriminant " << disc;
if (glist.size()>0) cout<< " : " << glist;
cout << endl;
}
}
cout<<endl;
}
}
|
