Testing new Ranges for Sierpinski/Riesel

[lalera]

gcc --version
gcc (GCC) 4.4.7 20120313 (Red Hat 4.4.7-11)
Copyright (C) 2010 Free Software Foundation, Inc.
This is free software; see the source for copying conditions. There is NO
warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.

[rogue]

Originally Posted by lalera

gcc --version
gcc (GCC) 4.4.7 20120313 (Red Hat 4.4.7-11)
Copyright (C) 2010 Free Software Foundation, Inc.
This is free software; see the source for copying conditions. There is NO
warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.

I might need to make a change to the code. Once you build and run, show the first few lines of pl_MOB.txt so that I know if it output the k correctly.

[lalera]

and now with the new source

gcc *.cpp -lstdc++ -O2 -m64 -o srbsieve
main.cpp: In function ‘void removeTrivial()’:
main.cpp:271: error: expected ‘)’ before ‘PRId64’
main.cpp: In function ‘void removeGFN()’:
main.cpp:328: error: expected ‘)’ before ‘PRId64’
main.cpp: In function ‘void removeMOB()’:
main.cpp:421: error: expected ‘)’ before ‘PRId64’
main.cpp: In function ‘void processNewpgenFile(uint32_t)’:
main.cpp:479: error: expected ‘)’ before ‘PRId64’
main.cpp: In function ‘void doPhase(int)’:
main.cpp:517: error: expected ‘)’ before ‘PRId64’
main.cpp: In function ‘void prp_test_ABC_file()’:
main.cpp:599: warning: deprecated conversion from string constant to ‘char*’
main.cpp: In function ‘void output_remain(char*)’:
main.cpp:708: error: expected ‘)’ before ‘PRId64’

this produced no binary
--
and with the modification
#define PRId64 "%lld"
as a test

gcc *.cpp -lstdc++ -O2 -m64 -o srbsieve
main.cpp: In function ‘void prp_test_ABC_file()’:
main.cpp:599: warning: deprecated conversion from string constant to ‘char*’

srbsieve produced the same output-files as before

[rogue]

Solving your problem would require someone to use a debugger.

[lalera]

Originally Posted by rogue

Solving your problem would require someone to use a debugger.

i can not do this - unfortunately

[rogue]

Runs on my Mac without a problem.

[Batalov]

I found a problem for trivial removals for Sierp (c=+1) conjectures.
I debugged on S256 (maxk = 1220), for which I know that four k should survive, of which now only one is standing (k=831).

minK, maxK and k and uint64, so if minK = 1, then k will be computed as 0, then k -=1 will make it INT_MAX and no removals will happen. Suggested patch:

***************
*** 252,263 ****
--- 253,268 ----

        if (c == -1)
           k += 1;
+       else if (k == 0)
+          k = factors[f] - 1;
        else
           k -= 1;

        while (k < minK)
           k += factors[f];

        // Remove all odd k because k*b^n+c will always be even
        for ( ; k <= maxK; k += factors[f])
        {

Result:

Status (00:00:00): Started with 1221 terms
Status (00:00:00): Removed 608 terms due to trivial factorization

[Batalov]

Originally Posted by rogue

You can delete the #include <windows.h> line. Replace with this:

#define PRId64 "%lld"

#define PRId64 "lld"

"%" is already provided in every printf statement.

That solves the compilation problem on linux.

[pepi37]

It looks like new srbsieve V5 is coming soon :)
And will remove composite from pl.remain :)

[rogue]

Thanks Serge! Updated source and exe attached. The change for the PRId64 was removed because I can include inttypes.h on non-Windows environments.

[pepi37]

for great tool Rogue!