Search Results for ""
2031 - 2040 of 13135 for random number generatorSearch Results
Critical damping is a special case of damped simple harmonic motion x^..+betax^.+omega_0^2x=0, (1) in which D=beta^2-4omega_0^2=0, (2) where beta is the damping constant. ...
A sophisticated checksum (often abbreviated CRC), which is based on the algebra of polynomials over the integers (mod 2). It is substantially more reliable in detecting ...
A Turing machine is called deterministic if there is always at most one instruction associated with a given present internal state/tape state pair (q,s). Otherwise, it is ...
A table made by subtracting adjacent entries in a sequence, then repeating the process with those numbers.
Let O and I be the circumcenter and incenter of a triangle with circumradius R and inradius r. Let d be the distance between O and I. Then d^2=R(R-2r) (Mackay 1886-1887; ...
The Euler triangle formula states that the distance d between the incenter and circumcenter of a triangle is given by d^2=R(R-2r), where R is the circumradius and r is the ...
The expectation value of a function f(x) in a variable x is denoted <f(x)> or E{f(x)}. For a single discrete variable, it is defined by <f(x)>=sum_(x)f(x)P(x), (1) where P(x) ...
In a given acute triangle DeltaABC, find the inscribed triangle whose perimeter is as small as possible. The answer is the orthic triangle of DeltaABC. The problem was ...
The first Fermat point X (or F_1) (sometimes simply called "the Fermat point," Torricelli point, or first isogonic center) is the point X which minimizes the sum of distances ...
Let (Omega)_(ij) be the resistance distance matrix of a connected graph G on n nodes. Then Foster's theorems state that sum_((i,j) in E(G)))Omega_(ij)=n-1, where E(g) is the ...
...
View search results from all Wolfram sites (185340 matches)

