Search Results for ""
571 - 580 of 2776 for Positive IntegerSearch Results
In many computer languages (such as FORTRAN or the Wolfram Language), the common residue of b (mod m) is written mod(b, m) (FORTRAN) or Mod[b, m] (Wolfram Language). The ...
P(n), sometimes also denoted p(n) (Abramowitz and Stegun 1972, p. 825; Comtet 1974, p. 94; Hardy and Wright 1979, p. 273; Conway and Guy 1996, p. 94; Andrews 1998, p. 1), ...
A test used to determine the statistical significance of an observation. Two main types of error can occur: 1. A type I error occurs when a false negative result is obtained ...
A symmetric bilinear form on a vector space V is a bilinear function Q:V×V->R (1) which satisfies Q(v,w)=Q(w,v). For example, if A is a n×n symmetric matrix, then ...
The Bernoulli numbers B_n are a sequence of signed rational numbers that can be defined by the exponential generating function x/(e^x-1)=sum_(n=0)^infty(B_nx^n)/(n!). (1) ...
The Euler-Mascheroni constant gamma, sometimes also called 'Euler's constant' or 'the Euler constant' (but not to be confused with the constant e=2.718281...) is defined as ...
The term "quotient" is most commonly used to refer to the ratio q=r/s of two quantities r and s, where s!=0. Less commonly, the term quotient is also used to mean the integer ...
An algorithm for finding integer relations whose running time is bounded by a polynomial in the number of real variables (Ferguson and Bailey 1992). Unfortunately, it is ...
Smarandache sequences are any of a number of simply generated integer sequences resembling those considered in published works by Smarandache such as the consecutive number ...
Apéry's constant is defined by zeta(3)=1.2020569..., (1) (OEIS A002117) where zeta(z) is the Riemann zeta function. Apéry (1979) proved that zeta(3) is irrational, although ...
...
View search results from all Wolfram sites (343865 matches)

