Search Results for ""
661 - 670 of 680 for Log Log PlotSearch Results
Let N steps of equal length be taken along a line. Let p be the probability of taking a step to the right, q the probability of taking a step to the left, n_1 the number of ...
A regular polygon is an n-sided polygon in which the sides are all the same length and are symmetrically placed about a common center (i.e., the polygon is both equiangular ...
Spherical coordinates, also called spherical polar coordinates (Walton 1967, Arfken 1985), are a system of curvilinear coordinates that are natural for describing positions ...
Expanding the Riemann zeta function about z=1 gives zeta(z)=1/(z-1)+sum_(n=0)^infty((-1)^n)/(n!)gamma_n(z-1)^n (1) (Havil 2003, p. 118), where the constants ...
The Thue-Morse sequence, also called the Morse-Thue sequence or Prouhet-Thue-Morse sequence (Allouche and Cosnard 2000), is one of a number of related sequences of numbers ...
N_phi(m) is the number of integers n for which the totient function phi(n)=m, also called the multiplicity of m (Guy 1994). Erdős (1958) proved that if a multiplicity occurs ...
The triangular number T_n is a figurate number that can be represented in the form of a triangular grid of points where the first row contains a single element and each ...
The Wiener sum index WS is a graph index defined for a graph on n nodes by WS=1/2sum_(i=1)^nsum_(j=1)^n((d)_(ij))/((Omega)_(ij)), where (d)_(ij) is the graph distance matrix ...
Zero is the integer denoted 0 that, when used as a counting number, means that no objects are present. It is the only integer (and, in fact, the only real number) that is ...
The binomial coefficient (n; k) is the number of ways of picking k unordered outcomes from n possibilities, also known as a combination or combinatorial number. The symbols ...
...
View search results from all Wolfram sites (65967 matches)

