David Terr


Raytheon

Active since 2004

Followers: 0   Following: 0

Message

I received a Ph.D. in number theory from UC Berkeley in 1997. I also enjoy other areas of math, as well as physics and computer programming. I live in Goleta, CA, near Santa Barbara and work at Raytheon in Goleta.

Statistics

  • Personal Best Downloads Level 2
  • 5-Star Galaxy Level 5
  • First Submission

View badges

Feeds

View by

Submitted


Pell.m
Pell(d,s,n) returns the first n positive integer solution to the modified Pell's equation x^2-dy^2=+

16 years ago | 2 downloads |

Submitted


LaguerrePoly.m
This program returns the coefficients of the Laguerre polynomial L_n, given n.

16 years ago | 3 downloads |

Thumbnail

Submitted


numerical.zip
Archive containing numerical function files.

20 years ago | 1 download |

Submitted


Lucas.m
Given a nonnegative integer n, return the nth Lucas number.

20 years ago | 1 download |

Submitted


rqf.m
Reduce a binary quadratic form, given as a row vector of length 3.

20 years ago | 1 download |

Submitted


qftimes.m
This function composes two quadratic forms.

20 years ago | 0 downloads |

Submitted


Physics.zip
Archive containing various files pertaining to physics.

20 years ago | 1 download |

Thumbnail

Submitted


ClebschGordan.m
ClebschGordan(j1,j2,j,m1,m2,m) is the Clebsch-Gordan coefficient <j1,j2,m1,m2|j1,j2,j,m>.

20 years ago | 7 downloads |

Submitted


GeneralizedLucas.m
GeneralizedLucas(n,a,b) returns the generalized Lucas number with index n and parameters a and b.

20 years ago | 1 download |

Submitted


GeneralizedFibonacci.m
GeneralizedFibonacci(n,a,b) returns the generalized Fibonacci number.

20 years ago | 1 download |

Submitted


RoundQCF.m
RoundQCF(d,u,v) returns the "round" continued fraction expansion of (u+sqrt(d))/v.

20 years ago | 1 download |

Submitted


harmonic.m
Harmonic(n) is an estimate of the nth harmonic number.

20 years ago | 1 download |

Submitted


fromcfrac.m
Returns the number with the given continued fraction expansion.

20 years ago | 2 downloads |

Submitted


QCF.m
QCF(d,u,v,quiet) returns the continued fraction expansion of (u+sqrt(d))/v.

20 years ago | 3 downloads |

Submitted


roundcfrac.m
Computes the "round continued fraction" of a given complex number.

20 years ago | 0 downloads |

Submitted


cfrac.m
cfrax(x,n) returns the first n terms in the contined fraction expansion of x.

20 years ago | 1 download |

Submitted


SpecialFunctions.zip
Special functions archive.

20 years ago | 1 download |

Submitted


Wigner3j.m
Wigner3j(j1,j2,j,m1,m2,m) returns the Wigner 3j-symbol.

20 years ago | 5 downloads |

Submitted


AssociatedLaguerrePoly.m
This program returns the coefficients of the Associated Laguerre polynomial L_{n,m}, given n and m.

20 years ago | 4 downloads |

Submitted


HermitePoly.m
This program returns the coefficients of the Hermite polynomial H_n, given n.

20 years ago | 3 downloads |

Thumbnail

Submitted


LegendrePoly
This program returns the coefficients of the Legendre polynomial P_n, given n.

20 years ago | 2 downloads |

Thumbnail

Submitted


ChebyshevPoly.m
This program returns the coefficients of the Chebyshev polynomial T_n, given n.

20 years ago | 7 downloads |

Thumbnail

Submitted


partitiontable.m
Given a nonnegative integer n, compute a table of the unrestricted partition function p(m) for m<=n.

20 years ago | 1 download |

Thumbnail

Submitted


Fibonacci.m
Given an integer n, return the nth Fibonacci number.

20 years ago | 5 downloads |

Submitted


binomial.m
This program computes the binomial coefficient C(n,m).

20 years ago | 2 downloads |

Submitted


MinkowskiQM.m
Given x from 0 to 1, compute ?(x), where ? is the Minkowski question mark function.

20 years ago | 1 download |

Thumbnail

Submitted


ChebyshevExpansion.m
Given a polynomial f(x) expressed as a column vector, compute the coefficients of the expansion ...

20 years ago | 2 downloads |

Submitted


LegendreExpansion.m
Given a polynomial f(x) expressed as a column vector, compute the coefficients of the expansion ...

20 years ago | 2 downloads |

Submitted


tau.m
Given a nonnegative integer n, tau(n) is the Ramanujan tau function of n.

20 years ago | 2 downloads |

Submitted


sigma.m
Given nonnegative integers k and n, sigma(k,n) is the sum of the kth powers of the divisors of n.

20 years ago | 1 download |

Load more