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
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
|
// FILE CHECKAP.CC: program for checking ap are in valid range
//////////////////////////////////////////////////////////////////////////
//
// 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
//
//////////////////////////////////////////////////////////////////////////
// (Now essentially redundant as we do the check as they are computed)
#include <fstream>
using namespace std;
#include <eclib/arith.h>
#include <eclib/moddata.h> // for nf_filename
const long MAXNAP = 100000;
int main(void)
{
long firstn, lastn, n, nnf, naq, nap, n2ds, ap, i, j, p;
int ok, allok=1;
short temp;
cout<<"Enter first and last N: "; cin>>firstn>>lastn;
for(n=firstn; n<=lastn; n++)
{
ok=1;
string name = nf_filename(n,'x');
ifstream datafile(name.c_str());
if(!datafile.is_open())
{
cout<<"\nFile "<<name<<" does not exist!"<<endl;
}
else
{
short temp_short;
int temp_int;
datafile.read((char*)&temp_int,sizeof(int)); // = number of newforms
nnf=temp_int;
datafile.read((char*)&temp_int,sizeof(int)); // = number of bad primes
naq=temp_int;
datafile.read((char*)&temp_int,sizeof(int)); // = number of eigs
nap=temp_int;
if(nnf>0)
{
// skip over extra data for each newform
long ntotal = 16*nnf;
int* batch_i = new int[ntotal];
datafile.read((char*)batch_i,ntotal*sizeof(int));
delete[] batch_i;
// skip over aq for each newform
ntotal = naq*nnf;
short* batch = new short[ntotal];
datafile.read((char*)batch,ntotal*sizeof(short));
// read and check ap for each newform
ntotal = nap*nnf;
delete[] batch;
batch = new short[ntotal];
datafile.read((char*)batch,ntotal*sizeof(short));
short* batchptr = batch;
primevar pr;
for(j=0; j<nap; j++, pr++)
{
p = (long)pr;
for(i=0; i<nnf; i++)
{
long ap=*batchptr++;
if(ap*ap>4*p)
{
cout << "\nError: N = " << n << ", form # " << (j+1)
<< ", p = " << p << " has ap = " << ap << flush;
ok=0;
}
}
}
delete[] batch;
} // ends if(nnf>0)
} // ends if(datafile)
datafile.close();
if(ok) cout << n << " ";
else
{
cout << "\nN = " << n << ": errors found!\n";
allok=0;
}
if(n%10==0) cout<<endl;
}
if(allok) cout << "\nAll checked ok\n"; else cout << "\nerrors found\n";
}
|
