TOPICS
Search

Search Results for ""


5201 - 5210 of 9247 for Random Walk 2 DimensionalSearch Results
Brown numbers are pairs (m,n) of integers satisfying the condition of Brocard's problem, i.e., such that n!+1=m^2 where n! is the factorial and m^2 is a square number. Only ...
Find consecutive powers, i.e., solutions to x^p-y^q=+/-1, excluding 0 and 1. Catalan's conjecture states that the only solution is 3^2-2^3=1, so 8 and 9 (2^3 and 3^2) are the ...
A circle bundle pi:E->M is a fiber bundle whose fibers pi^(-1)(x) are circles. It may also have the structure of a principal bundle if there is an action of SO(2) that ...
A polygonal number of the form n(5n-3)/2. The first few are 1, 7, 18, 34, 55, 81, 112, ... (OEIS A000566). The generating function for the heptagonal numbers is ...
A sequence {a_j} of positive integers is called an iteration sequence if there exists a strictly increasing sequence {s_k} of positive integers such that a_1=s_1>=2 and ...
Let f and g be nonnegative and continuous functions on the closed interval [a,b], then the solid of revolution obtained by rotating the curves f(x) and g(x) about the x-axis ...
A multiple root is a root with multiplicity n>=2, also called a multiple point or repeated root. For example, in the equation (x-1)^2=0, 1 is multiple (double) root. If a ...
A patch (also called a local surface) is a differentiable mapping x:U->R^n, where U is an open subset of R^2. More generally, if A is any subset of R^2, then a map x:A->R^n ...
Rubik's group is the group corresponding to possible rotations of a Rubik's Cube. There are six possible rotations, each corresponding to a generator of the group, and the ...
If the integral coefficients C_0, C_1, ..., C_(N-1) of the polynomial f(x)=C_0+C_1x+C_2x^2+...+C_(N-1)x^(N-1)+x^N are divisible by a prime number p, while the free term C_0 ...
1 ... 518|519|520|521|522|523|524 ... 925 Previous Next

...