Search Results for ""
81 - 90 of 316 for Dragon FractalSearch Results
A sequence {x_n} is called an infinitive sequence if, for every i, x_n=i for infinitely many n. Write a(i,j) for the jth index n for which x_n=i. Then as i and j range ...
The tetrix is the three-dimensional analog of the Sierpiński sieve illustrated above, also called the Sierpiński sponge or Sierpiński tetrahedron. The nth iteration of the ...
Determining the length of a country's coastline is not as simple as it first appears, as first considered by L. F. Richardson (1881-1953) and sometimes known as the ...
Informally, self-similar objects with parameters N and s are described by a power law such as N=s^d, where d=(lnN)/(lns) is the "dimension" of the scaling law, known as the ...
An array A=a_(ij), i,j>=1 of positive integers is called an interspersion if 1. The rows of A comprise a partition of the positive integers, 2. Every row of A is an ...
Find the m×n array of single digits which contains the maximum possible number of primes, where allowable primes may lie along any horizontal, vertical, or diagonal line. For ...
Let phi(t)=sum_(n=0)^(infty)A_nt^n be any function for which the integral I(x)=int_0^inftye^(-tx)t^pphi(t)dt converges. Then the expansion where Gamma(z) is the gamma ...
A topological space in which every point has a countable neighborhood system base for its neighborhood system.
If M is continuous and int_a^bM(x)h(x)dx=0 for all infinitely differentiable h(x), then M(x)=0 on the open interval (a,b).
A 60-sided polygon.
...
View search results from all Wolfram sites (1680 matches)

