Primality Certificate for (5^3407-1)/4

This certificate uses a theorem of Atkin and Morain to prove an integer N prime by using elliptic curves.

Factorizing N-1

As N is a Generalized Repunit, we make use of the algebraic factorization of N-1 to arrive at the following 10.988807% factorization of N-1:

This partial factorization is insufficient for any of the proving methods that could make use of it. Accordingly, we treat N as an integer with no special form and prove its primality with Marcel Martin's ECPP implementation, "Primo". The certificate has been PKZIPped into this file.