Search Results for ""
871 - 880 of 1570 for Napoleon's_problemSearch Results
The average number of regions into which n randomly chosen planes divide a cube is N^_(n)=1/(324)(2n+23)n(n-1)pi+n+1 (Finch 2003, p. 482). The maximum number of regions is ...
Given four points chosen at random inside a unit cube, the average volume of the tetrahedron determined by these points is given by ...
A cubic triangular number is a positive integer that is simultaneously cubic and triangular. Such a number must therefore satisfy T_n=m^3 for some positive integers n and m, ...
The symbol union , used for the union of sets, and, sometimes, also for the logical connective OR instead of the symbol v (vee). In fact, for any two sets A and B x in A ...
The polar curve r=1+2cos(2theta) (1) that can be used for angle trisection. It was devised by Ceva in 1699, who termed it the cycloidum anomalarum (Loomis 1968, p. 29). It ...
Numbers which are not perfect and for which s(N)=sigma(N)-N<N, or equivalently sigma(n)<2n, where sigma(N) is the divisor function. Deficient numbers are sometimes called ...
In continuum theory, a dendrite is a locally connected continuum that contains no simple closed curve. A semicircle is therefore a dendrite, while a triangle is not. The term ...
sum_(1<=k<=n)(n; k)((-1)^(k-1))/(k^m)=sum_(1<=i_1<=i_2<=...<=i_m<=n)1/(i_1i_2...i_m), (1) where (n; k) is a binomial coefficient (Dilcher 1995, Flajolet and Sedgewick 1995, ...
A labeling phi of (the vertices) of a graph G with positive integers taken from the set {1,2,...,r} is said to be r-distinguishing if no graph automorphism of G preserves all ...
A module over a unit ring R is called divisible if, for all r in R which are not zero divisors, every element m of M can be "divided" by r, in the sense that there is an ...
...
View search results from all Wolfram sites (160175 matches)

