Search Results for ""

All triangles are bicentric, i.e., possess both an incircle and a circumcircle. This is not necessarily the case for polygons with four or more sides. The inradius r and ...

A connected graph is graph that is connected in the sense of a topological space, i.e., there is a path from any point to any other point in the graph. A graph that is not ...

A requirement necessary for a given statement or theorem to hold. Also called a condition.

A natural number n>3 such that n|(a^(n-2)-a) whenever (a,n)=1 (a and n are relatively prime) and a<=n. (Here, n|m means that n divides m.) There are an infinite number of ...

An illusion due to Franz Joseph Delboeuf, a Belgian philosopher and expert on hypnosis. If the same circle is placed inside two different concentric circles, its size will ...

Given a module M over a unit ring R, the set End_R(M) of its module endomorphisms is a ring with respect to the addition of maps, (f+g)(x)=f(x)+g(x), for all x in M, and the ...

An Eulerian graph is a graph containing an Eulerian cycle. The numbers of Eulerian graphs with n=1, 2, ... nodes are 1, 1, 2, 3, 7, 15, 52, 236, ... (OEIS A133736), the first ...

A line segment connecting nonadjacent polyhedron vertices sharing a common face in a parallelepiped or other similar solid.

A game which is not biased toward any player. A game in which a given player can always win by playing correctly is therefore called an unfair game.

Since |(a+ib)(c+id)| = |a+ib||c+di| (1) |(ac-bd)+i(bc+ad)| = sqrt(a^2+b^2)sqrt(c^2+d^2), (2) it follows that (a^2+b^2)(c^2+d^2) = (ac-bd)^2+(bc+ad)^2 (3) = e^2+f^2. (4) This ...