New Code
Rentonn - Airbnb clone 1.0
VisualNEO for Windows
SentiVeillance SDK Trial 7.0.191272
dbForge SQL Complete 6.1
Uber for E-Scooters 1.0
ODBC Driver for MySQL 2.4
dbForge Schema Compare for MySQL 4.4
dbForge Studio for MySQL 8.1
dbForge Query Builder for MySQL 4.4
dbForge Data Compare for MySQL 5.5
Aqua Data Studio 19.5
ConyEdit for Windows 1.1.1
Database Workbench Pro 5.6.0
.Net VCL for Delphi
Top Code
Paste phpSoftPro 1.4.1
Deals and Discounts Website Script 1.0.2
ADO.NET Provider for ExactTarget 1.0
Solid File System OS edition 5.1
Classified Ad Lister 1.0
Aglowsoft SQL Query Tools 8.2
ICPennyBid Penny Auction Script 4.0
PHP Review Script 1.0
ATN Resume Finder 2.0
ATN Site Builder 3.0
Availability Booking Calendar PHP 1.0
PHP GZ Blog Script 1.1
ATN Jobs Software 4.0
ATN Mall 2.0
WeBuilder 2015 13.3
Code Listing by David Terr

Code 1-10 of 11   Pages: Go to  1  2  Next >>  page  

This program returns the coefficients of the Legendre polynomial P_n, given n. The result is a row vector with powers of x decreasing from left to right (standard MATLAB notation). Like for other polynomials, LegendrePoly(n) can be evaluated at x by typing


Wigner3j(j1,j2,j,m1,m2,m) returns the Wigner 3j-symbol, where j1, j2, j, m1, m2, and m are half-integers. Physically, the Wigner 3j-symbol is closely related to the Clebsch-Gordon coefficient <j1,j2,m1,m2|j1,j2,j,m>, the square of which is...

ClebschGordan(j1,j2,j,m1,m2,m) is the Clebsch-Gordan coefficient <j1,j2,m1,m2|j1,j2,j,m>. This is used in the theory of angular momentum in quantum mechanics.

For fixed integers a and b such that D = a^2 + 4*b is nonnegative, the sequence V_n = GeneralizedLucas(n,a,b) satisfies the recurrence
V_n = V_{n-1} + V_{n-2} and the initial conditions V_0 = 2 and V_1 = a. When a=b=1, this is the Lucas...

Given a nonnegative integer n, return the nth Lucas number. Return an error message if the argument is not an integer.

Archive containing various files pertaining to physics.

Archive containing numerical function files.

Given x from 0 to 1, this program computes ?(x), where ? is the Minkowski question mark function, defined by

?(0)=0, ?(1)=1, and ?((a+b)/(c+d))=
(?(a/c) + ?(b/d))/2, where a/b and c/d are consecutive terms in the Farey sequence....

For fixed integers a and b with D = a^2 + 4*b positive, the sequence U_n = GeneralizedFibonacci(n,a,b) satisfies the recurrence U_n = a U_{n-1} + b U_{n-2} with initial conditions U_0 = 0 and U_1 = 1. If a=b=1, this is the Fibonacci sequence.