Search Results for ""

A sequence of approximations a/b to sqrt(n) can be derived by factoring a^2-nb^2=+/-1 (1) (where -1 is possible only if -1 is a quadratic residue of n). Then ...

The square root method is an algorithm which solves the matrix equation Au=g (1) for u, with A a p×p symmetric matrix and g a given vector. Convert A to a triangular matrix ...

That part of a positive integer left after all square factors are divided out. For example, the squarefree part of 24=2^3·3 is 6, since 6·2^2=24. For n=1, 2, ..., the first ...

Polynomials S_k(x) which form the Sheffer sequence for g(t) = e^(-t) (1) f^(-1)(t) = ln(1/(1-e^(-t))), (2) where f^(-1)(t) is the inverse function of f(t), and have ...

The probability density function for Student's z-distribution is given by f_n(z)=(Gamma(n/2))/(sqrt(pi)Gamma((n-1)/2))(1+z^2)^(-n/2). (1) Now define ...

The order n of an algebraic surface is the order of the polynomial defining a surface, which can be geometrically interpreted as the maximum number of points in which a line ...

Given a Lucas sequence with parameters P and Q, discriminant D!=0, and roots a and b, the Sylvester cyclotomic numbers are Q_n=product_(r)(a-zeta^rb), (1) where ...

The "ternary" Champernowne constant can be defined by concatenating the ternary representations of the integers C_3 = 0.(1)(2)(1,0)(1,1)(1,2)(2,0)..._3 (1) = ...

In each of the ten cases with zero or unit mass, the finite part of the scalar 3-loop tetrahedral vacuum Feynman diagram reduces to four-letter "words" that represent ...

A triangle-free graph is a graph containing no graph cycles of length three. A simple graph is triangle-free iff Tr(A^3)=0, where A is the adjacency matrix of the graph and ...