Search Results for ""

For every positive integer n, there is a unique finite sequence of distinct nonconsecutive (not necessarily positive) integers k_1, ..., k_m such that ...

The positive integers 216 and 12960000 appear in an obscure passage in Plato's The Republic. In this passage, Plato alludes to the fact that 216 is equal to 6^3, where 6 is ...

In Moralia, the Greek biographer and philosopher Plutarch states "Chrysippus says that the number of compound propositions that can be made from only ten simple propositions ...

The low-level language of topology, which is not really considered a separate "branch" of topology. Point-set topology, also called set-theoretic topology or general ...

A prime factorization algorithm also known as Pollard Monte Carlo factorization method. There are two aspects to the Pollard rho factorization method. The first is the idea ...

Let a convex polygon be inscribed in a circle and divided into triangles from diagonals from one polygon vertex. The sum of the radii of the circles inscribed in these ...

The mean triangle area of a triangle picked inside a regular n-gon of unit area is A^__n=(9cos^2omega+52cosomega+44)/(36n^2sin^2omega), (1) where omega=2pi/n (Alikoski 1939; ...

A prime ideal is an ideal I such that if ab in I, then either a in I or b in I. For example, in the integers, the ideal a=<p> (i.e., the multiples of p) is prime whenever p ...

A prime power is a prime or integer power of a prime. A test for a number n being a prime is implemented in the Wolfram Language as PrimePowerQ[n]. The first few prime powers ...

As first shown by Meyer and Ritchie (1967), do-loops (which have a fixed iteration limit) are a special case of while-loops. A function that can be implemented using only ...