Search Results for ""
211 - 220 of 695 for 2002Search Results
The Akhmim wooden tablet, often called the Cairo wooden tablet, is a document dating to 2000 BC, near the beginning of the Egyptian Middle Kingdom. It is housed in the Egypt ...
The area moment of inertia is a property of a two-dimensional plane shape which characterizes its deflection under loading. It is also known as the second moment of area or ...
A classic arithmetical problem probably first posed by Euclid and investigated by various authors in the Middle Ages. The problem is formulated as a dialogue between the two ...
An algorithm that can be used to factor a polynomial f over the integers. The algorithm proceeds by first factoring f modulo a suitable prime p via Berlekamp's method and ...
A reduction system is called confluent (or globally confluent) if, for all x, u, and w such that x->_*u and x->_*w, there exists a z such that u->_*z and w->_*z. A reduction ...
The Copeland-Erdős constant is the constant with decimal expansion 0.23571113171923... (OEIS A033308) obtained by concatenating consecutive primes: 2, 23, 235, 2357, 235711, ...
Denote the nth derivative D^n and the n-fold integral D^(-n). Then D^(-1)f(t)=int_0^tf(xi)dxi. (1) Now, if the equation D^(-n)f(t)=1/((n-1)!)int_0^t(t-xi)^(n-1)f(xi)dxi (2) ...
There are no fewer than two closely related but somewhat different notions of gerbe in mathematics. For a fixed topological space X, a gerbe on X can refer to a stack of ...
If n>1 and n|1^(n-1)+2^(n-1)+...+(n-1)^(n-1)+1, is n necessarily a prime? In other words, defining s_n=sum_(k=1)^(n-1)k^(n-1), does there exist a composite n such that s_n=-1 ...
The determination of whether a Turing machine will come to a halt given a particular input program. The halting problem is solvable for machines with less than four states. ...
...
View search results from all Wolfram sites (8950 matches)

