Differences between revisions 51 and 52
 ⇤ ← Revision 51 as of 2014-12-20 21:29:37 → Size: 41707 Editor: akhi Comment: ← Revision 52 as of 2014-12-20 22:00:11 → ⇥ Size: 42371 Editor: akhi Comment: Deletions are marked like this. Additions are marked like this. Line 1178: Line 1178: b=[]        n=len(a)        for i in range(n):                b.append(a[i])        for j in range(l-1,-1,-1):                k=0                for t in range(m+1):                        for i in range(n):                                 if(a[i][j]== t):                                        b[k]=a[i]                                        k=k+1                for i in range(n):                        a[i]=b[i]        return(a) b=[] n=len(a) for i in range(n):  b.append(a[i]) for j in range(l-1,-1,-1):  k=0  for t in range(m+1):   for i in range(n):     if(a[i][j]== t):     b[k]=a[i]     k=k+1  for i in range(n):   a[i]=b[i] return(a)  def sort1(a,l,m): b=[] b.append([]) b.append([]) n=len(a[0]) for i in range(n):  b[0].append(a[0][i])  b[1].append(a[1][i]) for j in range(l-1,-1,-1):  k=0  for t in range(m+1):   for i in range(n):     if(a[0][i][j]== t):     b[0][k]=a[0][i]     b[1][k]=a[1][i]     k=k+1  for i in range(n):   a[0][i]=b[0][i]   a[1][i]=b[1][i] return(a) Line 1193: Line 1215: n=len(a)        b=[]        b.append(a[0])        m=[]        m.append(1)        c=0        for i in range(1,n):                if(a[i]==a[i-1]):                        m[c]=m[c]+1                else:                        b.append(a[i])                        m.append(1)                        c=c+1        return(b,m) n=len(a) b=[] b.append(a[0]) m=[] m.append(1) c=0 for i in range(1,n):  if(a[i]==a[i-1]):   m[c]=m[c]+1  else:   b.append(a[i])   m.append(1)   c=c+1 return(b,m)  def count1(a): n=len(a[0]) b=[] b.append([]) b.append([]) b[0].append(a[0][0]) b[1].append(a[1][0]) c=0 for i in range(1,n):  if(a[0][i]==a[0][i-1]):   b[1][c]=b[1][c]+a[1][i]  else:   b[0].append(a[0][i])   b[1].append(a[1][i])   c=c+1 return(b) Line 1235: Line 1276: r=[] r.append([]) r.append([]) t=0 c=1 for i in range(len(a)+1):  if(t==0):   b=shufflenew2.shuffle(a[:len(a)-i],a[len(a)-i:])   for j in range(len(b[0])):    r[0].append(b[0][j])    r[1].append(b[1][j]*c)   c=-c   if(i

# Integer Factorization

by William Stein

## Factor Trees

by William Stein

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/

by William Stein

by David Runde

by David Runde

by William Stein

by William Stein

by William Stein

by Emily Kirkman

by Emily Kirkman

by Emily Kirkman

by Emily Kirkman

# Elliptic Curves

## Adding points on an elliptic curve

by David Møller Hansen

# Cryptography

## The Diffie-Hellman Key Exchange Protocol

by Timothy Clemans and William Stein

# Other

by William Stein

## Computing Generalized Bernoulli Numbers

by William Stein (Sage-2.10.3)

by Robert Miller

# Multiple Zeta Values

by Akhilesh P.

## Shuffle Regularization at 0

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