Differences between revisions 21 and 33 (spanning 12 versions)
⇤ ← Revision 21 as of 2012-05-09 04:45:34 →
Size: 30472
Editor: jason
Comment:
← Revision 33 as of 2014-12-20 15:24:18 → ⇥
Size: 32140
Editor: akhi
Comment:
Deletions are marked like this. Additions are marked like this.
Line 51: Line 51:
                    g += line([(j*2-len(cur),-i), ((k*2)-len(rows[i-1]),-i+1)],                      g += line([(j*2-len(cur),-i), ((k*2)-len(rows[i-1]),-i+1)],
Line 101: Line 101:
    REFERENCES:      REFERENCES:
Line 106: Line 106:
        Weisstein, Eric W. "Prime-Generating Polynomial." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/Prime-GeneratingPolynomial.html          Weisstein, Eric W. "Prime-Generating Polynomial." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/Prime-GeneratingPolynomial.html
Line 114: Line 114:
        elif y<0 and -x >= y and y<x: return 4*(y+1)^2 -11*(y+1) + (start+7) +x          elif y<0 and -x >= y and y<x: return 4*(y+1)^2 -11*(y+1) + (start+7) +x
Line 117: Line 117:
    #Takes in an n and the start value of the spiral and gives its (x,y) coordinate      #Takes in an n and the start value of the spiral and gives its (x,y) coordinate
Line 119: Line 119:
        num = num - start +1          num = num - start +1
Line 121: Line 121:
        top = ceil(sqrt(num))             top = ceil(sqrt(num))
Line 126: Line 126:
            else:              else:
Line 133: Line 133:
            else:              else:
Line 145: Line 145:
        N = M.copy()         N = copy(M)
Line 149: Line 149:
 
    #These functions return an int based on where the t is located in the spiral 
    #These functions return an int based on where the t is located in the spiral
Line 162: Line 162:
    if n !=0: x_cord, y_cord = find_xy(n, start) #Overrides the user given x and y coordinates      if n !=0: x_cord, y_cord = find_xy(n, start) #Overrides the user given x and y coordinates
Line 170: Line 170:
    
Line 173: Line 173:
    if show_lines: 
        for t in [(-size-1)..size+1]: 		     if show_lines:
        for t in [(-size-1)..size+1]:
Line 176: Line 176:
            if m.is_pseudoprime(): main_list.add(m)              if m.is_pseudoprime(): main_list.add(m)
Line 181: Line 181:
    #This for loop changes the matrix by spiraling out from the center and changing each entry as it goes. It is faster than the find_xy function above.      #This for loop changes the matrix by spiraling out from the center and changing each entry as it goes. It is faster than the find_xy function above.
Line 186: Line 186:
            else: x-=1              else: x-=1
Line 188: Line 188:
        
        elif county < overcount: 
        elif county < overcount:
Line 191: Line 191:
            else: y-=1              else: y-=1
Line 193: Line 193:
        else:          else:
Line 199: Line 199:
    
        if not invert and num in main_list: 
        if not invert and num in main_list:
Line 207: Line 207:
    
    if n != 0: 
    if n != 0:
Line 224: Line 224:
    else:      else:
Line 235: Line 235:
def polar_prime_spiral(start=1, end=2000, show_factors = false, highlight_primes = false, show_curves=true, n = 0): 

    #For more information about the factors in the spiral, visit http://www.dcs.gla.ac.uk/~jhw/spirals/index.html by John Williamson. 		 def polar_prime_spiral(start=1, end=2000, show_factors = false, highlight_primes = false, show_curves=true, n = 0):

    #For more information about the factors in the spiral, visit http://www.dcs.gla.ac.uk/~jhw/spirals/index.html by John Williamson.
Line 243: Line 243:
    
Line 251: Line 251:
        R = points(list2, alpha = .1) #Faded Composites 
    else: 		         R = points(list2, alpha = .1) #Faded Composites
    else:
Line 259: Line 259:
        R=points(list2, hue = .1, pointsize = p_size) 
    		         R=points(list2, hue = .1, pointsize = p_size)
Line 263: Line 263:
        
Line 270: Line 270:
        Q = plot(W1+W2+W3+W4, alpha = .1)                   Q = plot(W1+W2+W3+W4, alpha = .1)
Line 273: Line 273:
        if show_curves:          if show_curves:
Line 278: Line 278:
            if n > (floor(sqrt(n)))^2 and n <= (floor(sqrt(n)))^2 + floor(sqrt(n)):              if n > (floor(sqrt(n)))^2 and n <= (floor(sqrt(n)))^2 + floor(sqrt(n)):
Line 281: Line 281:
            else:              else:
Line 286: Line 286:
            def g(m): return (a*m^2+b*m+c);              def g(m): return (a*m^2+b*m+c);
Line 292: Line 292:
            c= c2;              c= c2;
Line 305: Line 305:
== Computing modular forms FIXME == == Computing modular forms ==
Line 308: Line 308:
j = 0
@interact
def _(N=[1..100], k=selector([2,4,..,12],nrows=1), prec=(3..40), 		 @interact
def _(N=[1..100], k=selector([2,4,..,12],nrows=1), prec=(3..40),
Line 313: Line 312:
    print j; global j; j += 1
Line 340: Line 338:
== A Charpoly and Hecke Operator Graph FIXME == == A Charpoly and Hecke Operator Graph ==
Line 351: Line 349:
    G = Graph(T, multiedges=True, loops=not three_d)     G = DiGraph(T, multiedges=not three_d)
    if three_d:
        G.remove_loops()
Line 472: Line 472:
        MP += line([(i,0),(i,r)], rgbcolor='black')          MP += line([(i,0),(i,r)], rgbcolor='black')
Line 553: Line 553:
    S += point(e_pt,pointsize=50, rgbcolor='red')      S += point(e_pt,pointsize=50, rgbcolor='red')
Line 556: Line 556:
    S += point(f_gs_pt,pointsize=75, rgbcolor='black')             S += point(f_gs_pt,pointsize=75, rgbcolor='black')
Line 561: Line 561:
        S += text('$J(%s,%s) = %s$'%(latex2(e),latex2(f),latex(js)),          S += text('$J(%s,%s) = %s$'%(latex2(e),latex2(f),latex(js)),
Line 633: Line 633:
    S += point(e_pt,pointsize=50, rgbcolor='red')      S += point(e_pt,pointsize=50, rgbcolor='red')
Line 678: Line 678:
    else:      else:
Line 685: Line 685:

def line_from_curve_points(E,P,Q,style='-',rgb=(1,0,0),length=25):
 """
 P,Q two points on an elliptic curve.
 Output is a graphic representation of the straight line intersecting with P,Q.
 """
 # The function tangent to P=Q on E
 if P == Q:
  if P[2]==0:
   return line([(1,-length),(1,length)],linestyle=style,rgbcolor=rgb)
  else:
   # Compute slope of the curve E in P
   l=-(3*P[0]^2 + 2*E.a2()*P[0] + E.a4() - E.a1()*P[1])/((-2)*P[1] - E.a1()*P[0] - E.a3())
   f(x) = l * (x - P[0]) + P[1]
   return plot(f(x),-length,length,linestyle=style,rgbcolor=rgb)
 # Trivial case of P != R where P=O or R=O then we get the vertical line from the other point
 elif P[2] == 0:
  return line([(Q[0],-length),(Q[0],length)],linestyle=style,rgbcolor=rgb)
 elif Q[2] == 0:
  return line([(P[0],-length),(P[0],length)],linestyle=style,rgbcolor=rgb)
 # Non trivial case where P != R
 else:
  # Case where x_1 = x_2 return vertical line evaluated in Q
  if P[0] == Q[0]:
   return line([(P[0],-length),(P[0],length)],linestyle=style,rgbcolor=rgb)

  #Case where x_1 != x_2 return line trough P,R evaluated in Q"
  l=(Q[1]-P[1])/(Q[0]-P[0])
  f(x) = l * (x - P[0]) + P[1]
  return plot(f(x),-length,length,linestyle=style,rgbcolor=rgb)
Line 687: Line 718:
 curve = E.plot(rgbcolor = (0,0,1),xmin=25,xmax=25,plot_points=300)  curve = E.plot(rgbcolor = (0,0,1),xmin=-5,xmax=5,plot_points=300)
Line 713: Line 744:

def line_from_curve_points(E,P,Q,style='-',rgb=(1,0,0),length=25):
 """
 P,Q two points on an elliptic curve.
 Output is a graphic representation of the straight line intersecting with P,Q.
 """
 # The function tangent to P=Q on E
 if P == Q:
  if P[2]==0:
   return line([(1,-length),(1,length)],linestyle=style,rgbcolor=rgb)
  else:
   # Compute slope of the curve E in P
   l=-(3*P[0]^2 + 2*E.a2()*P[0] + E.a4() - E.a1()*P[1])/((-2)*P[1] - E.a1()*P[0] - E.a3())
   f(x) = l * (x - P[0]) + P[1]
   return plot(f(x),-length,length,linestyle=style,rgbcolor=rgb)
 # Trivial case of P != R where P=O or R=O then we get the vertical line from the other point
 elif P[2] == 0:
  return line([(Q[0],-length),(Q[0],length)],linestyle=style,rgbcolor=rgb)
 elif Q[2] == 0:
  return line([(P[0],-length),(P[0],length)],linestyle=style,rgbcolor=rgb)
 # Non trivial case where P != R
 else:
  # Case where x_1 = x_2 return vertical line evaluated in Q
  if P[0] == Q[0]:
   return line([(P[0],-length),(P[0],length)],linestyle=style,rgbcolor=rgb)
  
  #Case where x_1 != x_2 return line trough P,R evaluated in Q"
  l=(Q[1]-P[1])/(Q[0]-P[0])
  f(x) = l * (x - P[0]) + P[1]
  return plot(f(x),-length,length,linestyle=style,rgbcolor=rgb)
Line 777: Line 778:
    print """
<html>		     html("""
Line 802: Line 802:
</ol></html>
    """ % (bits, p, g, a, g, a, p, (g^a), b, g, b, p, (g^b), (g^b), a, p, 
       (g^ b)^a, g^a, b, p, (g^a)^b)		 </ol>
    """ % (bits, p, g, a, g, a, p, (g^a), b, g, b, p, (g^b), (g^b), a, p,
       (g^ b)^a, g^a, b, p, (g^a)^b))
Line 816: Line 816:
def _(number=e, ymax=selector([None,5,20,..,400],nrows=2), clr=Color('purple'), prec=[500,1000,..,5000]): def _(number=e, ymax=selector([5,20,..,400],nrows=2), clr=Color('purple'), prec=[500,1000,..,5000]):
Line 853: Line 853:
def _(gen = selector(['t+1', 't-1', '-1/t'], nrows=1)): def _(gen = selector(['t+1', 't-1', '-1/t'], buttons=True,nrows=1)):
Line 871: Line 871:

= Multiple Zeta Values =
by Akhilesh P.
== Computing Multiple Zeta values ==
{{{#!sagecell
R=RealField(10)
@interact
def _( weight=(7,(3..10))):
 n=weight
 a=[0 for i in range(n-1)]
 a.append(1)
 @interact
 def _(v=('word', input_grid(1, n, default=[a], to_value=lambda x: vector(flatten(x)))), accuracy=(100..100000)):
  D=accuracy
  a=[v[i] for i in range(len(v))]
  DD=int(3.321928*D)+int(R(log(3.321928*D))/R(log(10)))+4
  RIF=RealIntervalField(DD)
  def Li(word):
        n=int(DD*log(10)/log(2))+1
        B=[]
        L=[]
        S=[]
        count=-1
        k=len(word)
        for i in range(k):
                B.append(RIF('0'))
                L.append(RIF('0'))
                if(word[i]==1 and i<k-1):
                        S.append(RIF('0'))
                        count=count+1
        T=RIF('1')
        for m in range(n):
                T=T/2
                B[k-1]=RIF('1')/(m+1)
                j=count
                for i in range(k-2,-1,-1):
                        if(word[i]==0):
                                B[i]=B[i+1]/(m+1)
                        elif(word[i]==1):
                                B[i]=S[j]/(m+1)
                                S[j]=S[j]+B[i+1]
                                j=j-1
                        L[i]=T*B[i]+L[i]
                L[k-1]=T*B[k-1]+L[k-1]
        return(L)
  def dual(a):
        b=list()
        b=a
        b=b[::-1]
        for i in range(len(b)):
                b[i]=1-b[i]
        return(b)
  def zeta(a):
        b=dual(a)
        l1=Li(a)+[1]
        l2=Li(b)+[1]
        Z=RIF('0')
        for i in range(len(l1)):
                Z=Z+l1[i]*l2[len(a)-i]
        return(Z)
  print zeta(a)
}}}
{{attachment:akhi1.png}}

Contents

  1. Integer Factorization
    1. Divisibility Poset
    2. Factor Trees
    3. Factoring an Integer
  2. Prime Numbers
    1. Illustrating the prime number theorem
    2. Prime Spiral - Square FIXME
    3. Prime Spiral - Polar
  3. Modular Forms
    1. Computing modular forms
    2. Computing the cuspidal subgroup
    3. A Charpoly and Hecke Operator Graph
  4. Modular Arithmetic
    1. Quadratic Residue Table FIXME
    2. Cubic Residue Table FIXME
  5. Cyclotomic Fields
    1. Gauss and Jacobi Sums in Complex Plane
    2. Exhaustive Jacobi Plotter
  6. Elliptic Curves
    1. Adding points on an elliptic curve
    2. Plotting an elliptic curve over a finite field
  7. Cryptography
    1. The Diffie-Hellman Key Exchange Protocol
  8. Other
    1. Continued Fraction Plotter
    2. Computing Generalized Bernoulli Numbers
    3. Fundamental Domains of SL_2(ZZ)
  9. Multiple Zeta Values
    1. Computing Multiple Zeta values

Integer Factorization

Divisibility Poset

by William Stein

divposet.png

Factor Trees

by William Stein

factortree.png

More complicated demonstration using Mathematica: http://demonstrations.wolfram.com/FactorTrees/

Factoring an Integer

by Timothy Clemans

Sage implementation of the Mathematica demonstration of the same name. http://demonstrations.wolfram.com/FactoringAnInteger/

Prime Numbers

Illustrating the prime number theorem

by William Stein

primes.png

Prime Spiral - Square FIXME

by David Runde

SquareSpiral.PNG

Prime Spiral - Polar

by David Runde

PolarSpiral.PNG

Modular Forms

Computing modular forms

by William Stein

modformbasis.png

Computing the cuspidal subgroup

by William Stein

cuspgroup.png

A Charpoly and Hecke Operator Graph

by William Stein

heckegraph.png

Modular Arithmetic

Quadratic Residue Table FIXME

by Emily Kirkman

quadres.png

quadresbig.png

Cubic Residue Table FIXME

by Emily Kirkman

cubres.png

Cyclotomic Fields

Gauss and Jacobi Sums in Complex Plane

by Emily Kirkman

jacobising.png

Exhaustive Jacobi Plotter

by Emily Kirkman

jacobiexh.png

Elliptic Curves

Adding points on an elliptic curve

by David Møller Hansen

PointAddEllipticCurve.png

Plotting an elliptic curve over a finite field

ellffplot.png

Cryptography

The Diffie-Hellman Key Exchange Protocol

by Timothy Clemans and William Stein

dh.png

Other

Continued Fraction Plotter

by William Stein

contfracplot.png

Computing Generalized Bernoulli Numbers

by William Stein (Sage-2.10.3)

bernoulli.png

Fundamental Domains of SL_2(ZZ)

by Robert Miller

fund_domain.png

Multiple Zeta Values

by Akhilesh P.

Computing Multiple Zeta values

akhi1.png

interact/number_theory (last edited 2020-06-14 09:10:48 by chapoton)