Differences between revisions 53 and 55 (spanning 2 versions)
 ⇤ ← Revision 53 as of 2014-12-20 22:07:00 → Size: 45946 Editor: akhi Comment: ← Revision 55 as of 2014-12-23 02:05:59 → ⇥ Size: 45948 Editor: akhi Comment: Deletions are marked like this. Additions are marked like this. Line 874: Line 874: == Word to composition =={{{#!sagecell@interactdef _( weight=(7,(2..30))): 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))))):  a=[v[i] for i in range(len(v))]  def bintocomp(a): b=[] count=1 for j in range(len(a)):  if(a[j]==0):   count=count+1  else:   b.append(count)   count=1  return(b)  print "Composition is ",bintocomp(a)}}}{{attachment:akhi2.png}}== Composition to Word =={{{#!sagecell@interactdef _( Depth=(7,(1..30))): n=Depth a=[] a.append(2) a=a+[1 for i in range(1,n)] @interact def _(v=('composition', input_grid(1, n, default=[a], to_value=lambda x: vector(flatten(x))))):  a=[v[i] for i in range(len(v))]  def comptobin(a): word=[] for i in range(len(a)):  word=word+[0]*(a[i]-1)+[1] return(word)  print "Word is ",comptobin(a)}}}{{attachment:akhi3.png}}== Dual of a Word =={{{#!sagecell@interactdef _( weight=(7,(2..30))): 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))))):  a=[v[i] for i in range(len(v))]  def dual(a): b=list() b=a b=b[::-1] for i in range(len(b)):  b[i]=1-b[i]  return(b)  print "Dual word is ",dual(a)}}}{{attachment:akhi4.png}} Line 1071: Line 1002: == Word to composition =={{{#!sagecell@interactdef _( weight=(7,(2..30))): 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))))):  a=[v[i] for i in range(len(v))]  def bintocomp(a): b=[] count=1 for j in range(len(a)):  if(a[j]==0):   count=count+1  else:   b.append(count)   count=1  return(b)  print "Composition is ",bintocomp(a)}}}{{attachment:akhi2.png}}== Composition to Word =={{{#!sagecell@interactdef _( Depth=(7,(1..30))): n=Depth a=[] a.append(2) a=a+[1 for i in range(1,n)] @interact def _(v=('composition', input_grid(1, n, default=[a], to_value=lambda x: vector(flatten(x))))):  a=[v[i] for i in range(len(v))]  def comptobin(a): word=[] for i in range(len(a)):  word=word+[0]*(a[i]-1)+[1] return(word)  print "Word is ",comptobin(a)}}}{{attachment:akhi3.png}}== Dual of a Word =={{{#!sagecell@interactdef _( weight=(7,(2..30))): 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))))):  a=[v[i] for i in range(len(v))]  def dual(a): b=list() b=a b=b[::-1] for i in range(len(b)):  b[i]=1-b[i]  return(b)  print "Dual word is ",dual(a)}}}{{attachment:akhi4.png}} Line 1454: Line 1455: c=Regshuf0(a) c=Regshuf1(a)

# 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 1

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