David Terr
Raytheon
自 2004 起处于活动状态
Followers: 0 Following: 0
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.
Feeds
已提交
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 前 | 2 次下载 |
已提交
LaguerrePoly.m
This program returns the coefficients of the Laguerre polynomial L_n, given n.
16 years 前 | 3 次下载 |
已提交
ClebschGordan.m
ClebschGordan(j1,j2,j,m1,m2,m) is the Clebsch-Gordan coefficient <j1,j2,m1,m2|j1,j2,j,m>.
20 years 前 | 6 次下载 |
已提交
GeneralizedLucas.m
GeneralizedLucas(n,a,b) returns the generalized Lucas number with index n and parameters a and b.
20 years 前 | 1 次下载 |
已提交
GeneralizedFibonacci.m
GeneralizedFibonacci(n,a,b) returns the generalized Fibonacci number.
20 years 前 | 1 次下载 |
已提交
RoundQCF.m
RoundQCF(d,u,v) returns the "round" continued fraction expansion of (u+sqrt(d))/v.
20 years 前 | 1 次下载 |
已提交
fromcfrac.m
Returns the number with the given continued fraction expansion.
20 years 前 | 2 次下载 |
已提交
QCF.m
QCF(d,u,v,quiet) returns the continued fraction expansion of (u+sqrt(d))/v.
20 years 前 | 3 次下载 |
已提交
roundcfrac.m
Computes the "round continued fraction" of a given complex number.
20 years 前 | 0 次下载 |
已提交
cfrac.m
cfrax(x,n) returns the first n terms in the contined fraction expansion of x.
20 years 前 | 2 次下载 |
已提交
AssociatedLaguerrePoly.m
This program returns the coefficients of the Associated Laguerre polynomial L_{n,m}, given n and m.
20 years 前 | 4 次下载 |
已提交
HermitePoly.m
This program returns the coefficients of the Hermite polynomial H_n, given n.
20 years 前 | 4 次下载 |
已提交
LegendrePoly
This program returns the coefficients of the Legendre polynomial P_n, given n.
20 years 前 | 2 次下载 |
已提交
ChebyshevPoly.m
This program returns the coefficients of the Chebyshev polynomial T_n, given n.
20 years 前 | 12 次下载 |
已提交
partitiontable.m
Given a nonnegative integer n, compute a table of the unrestricted partition function p(m) for m<=n.
20 years 前 | 1 次下载 |
已提交
MinkowskiQM.m
Given x from 0 to 1, compute ?(x), where ? is the Minkowski question mark function.
20 years 前 | 1 次下载 |
已提交
ChebyshevExpansion.m
Given a polynomial f(x) expressed as a column vector, compute the coefficients of the expansion ...
20 years 前 | 3 次下载 |
已提交
LegendreExpansion.m
Given a polynomial f(x) expressed as a column vector, compute the coefficients of the expansion ...
20 years 前 | 1 次下载 |
已提交
tau.m
Given a nonnegative integer n, tau(n) is the Ramanujan tau function of n.
20 years 前 | 2 次下载 |
已提交
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 前 | 1 次下载 |