TOPICS
Search

Search Results for ""


2611 - 2620 of 8520 for 1Search Results
A number which is simultaneously a nonagonal number N_m and pentagonal number P_n and therefore satisfies the Diophantine equation 1/2m(7m-5)=1/2n(3n-1). (1) Completing the ...
A set in which no element divides the sum of any nonempty subset of the other elements. For example, {2,3,5} is dividing, since 2|(3+5) (and 5|(2+3)), but {4,6,7} is ...
To solve the system of differential equations (dx)/(dt)=Ax(t)+p(t), (1) where A is a matrix and x and p are vectors, first consider the homogeneous case with p=0. The ...
An n-persistent number is a positive integer k which contains the digits 0, 1, ..., 9 (i.e., is a pandigital number), and for which 2k, ..., nk also share this property. No ...
There appears to be no standard term for a simple connected graph with exactly n edges, though the words "polynema" (Kyrmse) and "polyedge" (Muñiz 2011) have been proposed. ...
Polysticks, sometimes also known as polyedges, are polyforms obtained from the edges of a regular grid. Square polysticks are polyforms obtained from the edges of a regular ...
A power mean is a mean of the form M_p(a_1,a_2,...,a_n)=(1/nsum_(k=1)^na_k^p)^(1/p), (1) where the parameter p is an affinely extended real number and all a_k>=0. A power ...
For X a topological space, the presheaf F of Abelian groups (rings, ...) on X is defined such that 1. For every open subset U subset= X, an Abelian group (ring, ...) F(U), ...
The set of numbers generated by excluding the sums of two or more consecutive earlier members is called the prime numbers of measurement, or sometimes the segmented numbers. ...
A pseudoforest is an undirected graph in which every connected component contains at most one graph cycle. A pseudotree is therefore a connected pseudoforest and a forest ...
1 ... 259|260|261|262|263|264|265 ... 852 Previous Next

...