Book a Demo!
CoCalc Logo Icon
StoreFeaturesDocsShareSupportNewsAboutPoliciesSign UpSign In
Download
241818 views
1
2
def test1(B=10**4):
3
from sage.all import polygen, primes, QQ, EllipticCurve
4
import psage.libs.smalljac.wrapper
5
x = polygen(QQ, 'x')
6
J = psage.libs.smalljac.wrapper.SmallJac(x**3 + 17*x + 3)
7
E = EllipticCurve([17,3])
8
N = E.conductor()
9
for p in primes(B):
10
if N%p:
11
assert E.ap(p) == J.ap(p)
12
13
def test2(B=500):
14
from sage.all import polygen, primes, QQ, GF, HyperellipticCurve
15
import psage.libs.smalljac.wrapper
16
x = polygen(QQ, 'x')
17
J = psage.libs.smalljac.wrapper.SmallJac(x**5 + 17*x + 3)
18
N = 97*3749861
19
for p in primes(45,B): # 45 comes from "(2g+1)(2N-1) = 45"
20
if N%p:
21
x = polygen(GF(p), 'x')
22
C = HyperellipticCurve(x**5 + 17*x + 3)
23
assert C.frobenius_polynomial() == J.frob(p).charpoly()
24
25
26
27
28