Search Results for ""
181 - 190 of 729 for modular sieve methodSearch Results

If replacing each number by its square or cube in a magic square produces another magic square, the square is said to be a trimagic square. Trimagic squares are also called ...
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 bootstrap method is a computer-based method for assigning measures of accuracy to sample estimates (Efron and Tibshirani 1994). This technique allows estimation of the ...
An additive cellular automaton is a cellular automaton whose rule is compatible with an addition of states. Typically, this addition is derived from modular arithmetic. ...
In the early 1960s, B. Birch and H. P. F. Swinnerton-Dyer conjectured that if a given elliptic curve has an infinite number of solutions, then the associated L-series has ...
A function tau(n) related to the divisor function sigma_k(n), also sometimes called Ramanujan's tau function. It is defined via the Fourier series of the modular discriminant ...
At least one power series solution will be obtained when applying the Frobenius method if the expansion point is an ordinary, or regular, singular point. The number of roots ...
In abstract topology, a machine is method for producing infinite loop spaces and spectra. In automata theory, an abstract machine that is implemented in hardware is simply ...
A popular acronym for "principal ideal domain." In engineering circles, the acronym PID refers to the "proportional-integral-derivative method" algorithm for controlling ...
Let the elliptic modulus k satisfy 0<k^2<1. (This may also be written in terms of the parameter m=k^2 or modular angle alpha=sin^(-1)k.) The incomplete elliptic integral of ...

...