Search Results for ""

Given the left factorial function Sigma(n)=sum_(k=1)^nk!, SK(p) for p prime is the smallest integer n such that p|1+Sigma(n-1). The first few known values of SK(p) are 2, 4, ...

Given the sum-of-factorials function Sigma(n)=sum_(k=1)^nk!, SW(p) is the smallest integer for p prime such that Sigma[SW(p)] is divisible by p. If pSigma(n) for all n<p, ...

The nth Smarandache-Wellin number is formed from the consecutive number sequence obtained by concatenating of the digits of the first n primes. The first few are 2, 23, 235, ...

SNTP(n) is the smallest prime such that p#-1, p#, or p#+1 is divisible by n, where p# is the primorial of p. Ashbacher (1996) shows that SNTP(n) only exists 1. If there are ...

Let A be some attribute (e.g., possible, present, perfect, etc.). If all is A, then the non-A must also be A. For example, "All is possible, the impossible too," and "Nothing ...

Let A be an n×n matrix over a field F. Using the three elementary row and column operations over elements in the field, the n×n matrix xI-A with entries from the principal ...

The expansion of the two sides of a sum equality in terms of polynomials in x^m and y^k, followed by closed form summation in terms of x and y. For an example of the ...

If a random variable X has a chi-squared distribution with m degrees of freedom (chi_m^2) and a random variable Y has a chi-squared distribution with n degrees of freedom ...

For d>=1, Omega an open subset of R^d, p in [1;+infty] and s in N, the Sobolev space W^(s,p)(R^d) is defined by W^(s,p)(Omega)={f in L^p(Omega): forall ...

The theory of analyzing a decision between a collection of alternatives made by a collection of n voters with separate opinions. Any choice for the entire group should ...