Search Results for ""
6701 - 6710 of 13131 for htmlSearch Results
Let L_n be the n×n matrix whose (i,j)th entry is 1 if j divides i and 0 otherwise, let Phi_n be the n×n diagonal matrix diag(phi(1),phi(2),...,phi(n)), where phi(n) is the ...
A procedure for determining the behavior of an nth order ordinary differential equation at a removable singularity without actually solving the equation. Consider ...
Leakage, more explicitly called spectral leakage, is a smearing of power across a frequency spectrum that occurs when the signal being measured is not periodic in the sample ...
The term "(a,b)-leaper" (sometimes explicitly called a "single-pattern leaper") describes a fairy chess piece such as a knight that may make moves which simultaneously change ...
The least common denominator of a collection of fractions (p_1)/(q_1),...,(p_n)/(q_n) is the least common multiple LCM(q_1,...,q_n) of their denominators.
The least common multiple of two numbers a and b, variously denoted LCM(a,b) (this work; Zwillinger 1996, p. 91; Råde and Westergren 2004, p. 54), lcm(a,b) (Gellert et al. ...
Let S={x_1,...,x_n} be a set of n distinct positive integers. Then the matrix [S]_n having the least common multiple LCM(x_i,x_j) of x_i and x_j as its i,jth entry is called ...
The smallest n for which a point x_0 is a periodic point of a function f so that f^n(x_0)=x_0. For example, for the function f(x)=-x, all points x have period 2 (including ...
Let n>1 be any integer and let lpf(n) (also denoted LD(n)) be the least integer greater than 1 that divides n, i.e., the number p_1 in the factorization ...
The value of the 2^0 bit in a binary number. For the sequence of numbers 1, 2, 3, 4, ..., the least significant bits are therefore the alternating sequence 1, 0, 1, 0, 1, 0, ...
...
View search results from all Wolfram sites (229878 matches)

