Search Results for ""
4851 - 4860 of 13134 for complexity theorySearch Results
A pentagonal square triangular number is a number that is simultaneously a pentagonal number P_l, a square number S_m, and a triangular number T_n. This requires a solution ...
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 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 ...
Let p_n be the nth prime, then the primorial (which is the analog of the usual factorial for prime numbers) is defined by p_n#=product_(k=1)^np_k. (1) The values of p_n# for ...
...
View search results from all Wolfram sites (28442 matches)

