Search Results for ""

Given a sum and a set of weights, find the weights which were used to generate the sum. The values of the weights are then encrypted in the sum. This system relies on the ...

The numbers defined by the recurrence relation K_(n+1)=1+min(2K_(|_n/2_|),3K_(|_n/3_|)), with K_0=1. The first few values for n=0, 1, 2, ... are 1, 3, 3, 4, 7, 7, 7, 9, 9, ...

An equation proposed by Lambert (1758) and studied by Euler in 1779. x^alpha-x^beta=(alpha-beta)vx^(alpha+beta). (1) When alpha->beta, the equation becomes lnx=vx^beta, (2) ...

Lattice theory is the study of sets of objects known as lattices. It is an outgrowth of the study of Boolean algebras, and provides a framework for unifying the study of ...

The Lemoine ellipse is an inconic (that is always an ellipse) that has inconic parameters x:y:z=(2(b^2+c^2)-a^2)/(bc):(2(a^2+c^2)-b^2)/(ac): (2(a^2+b^2)-c^2)/(ab). (1) The ...

The log-likelihood function F(theta) is defined to be the natural logarithm of the likelihood function L(theta). More precisely, F(theta)=lnL(theta), and so in particular, ...

When P and Q are integers such that D=P^2-4Q!=0, define the Lucas sequence {U_k} by U_k=(a^k-b^k)/(a-b) for k>=0, with a and b the two roots of x^2-Px+Q=0. Then define a ...

A method for computing the prime counting function. Define the function T_k(x,a)=(-1)^(beta_0+beta_1+...+beta_(a-1))|_x/(p_1^(beta_0)p_2^(beta_1)...p_a^(beta_(a-1)))_|, (1) ...

The Markström graph is a cubic planar graph on 24 vertices which lacks cycles of length 4 and 8 but contains cycles of length 16. (In particular, it contains cycles of ...

An algorithm for finding roots which retains that prior estimate for which the function value has opposite sign from the function value at the current best estimate of the ...