Search Results for ""
11361 - 11370 of 13135 for Inline 8Search Results
Euler (1772ab) conjectured that there are no positive integer solutions to the quartic Diophantine equation A^4=B^4+C^4+D^4. This conjecture was disproved by Elkies (1988), ...
The Euler triangle of a triangle DeltaABC is the triangle DeltaE_AE_BE_C whose vertices are the midpoints of the segments joining the orthocenter H with the respective ...
An Eulerian cycle, also called an Eulerian circuit, Euler circuit, Eulerian tour, or Euler tour, is a trail which starts and ends at the same graph vertex. In other words, it ...
Euler's 6n+1 theorem states that every prime of the form 6n+1, (i.e., 7, 13, 19, 31, 37, 43, 61, 67, ..., which are also the primes of the form 3n+1; OEIS A002476) can be ...
Euler conjectured that there do not exist Euler squares of order n=4k+2 for k=1, 2, .... In fact, MacNeish (1921-1922) published a purported proof of this conjecture (Bruck ...
Given a triangle, extend two sides in the direction opposite their common vertex. The circle tangent to these two lines and to the other side of the triangle is called an ...
The so-called explicit formula psi(x)=x-sum_(rho)(x^rho)/rho-ln(2pi)-1/2ln(1-x^(-2)) gives an explicit relation between prime numbers and Riemann zeta function zeros for x>1 ...
Let X be a set of urelements, and let V(^*X) be an enlargement of the superstructure V(X). Let A in V(X) be a finitary algebra with finitely many fundamental operations. Then ...
A fan graph F_(m,n) is defined as the graph join K^__m+P_n, where K^__m is the empty graph on m nodes and P_n is the path graph on n nodes. The case m=1 corresponds to the ...
A dissection of a rectangle into smaller rectangles such that the original rectangle is not divided into two subrectangles. Rectangle dissections into 3, 4, or 6 pieces ...
...
View search results from all Wolfram sites (166057 matches)

