Search Results for ""
3621 - 3630 of 13135 for Highly Composite NumberSearch Results
An algorithm for determining the order of an elliptic curve E/F_p over the finite field F_p.
Special functions which arise as solutions to second order ordinary differential equations are commonly said to be "of the first kind" if they are nonsingular at the origin, ...
A mathematical object defined for a set and a binary operator in which the multiplication operation is associative. No other restrictions are placed on a semigroup; thus a ...
A sequence is an ordered set of mathematical objects. Sequences of object are most commonly denoted using braces. For example, the symbol {2n}_(n=1)^infty denotes the ...
Define f(x_1,x_2,...,x_n) with x_i positive as f(x_1,x_2,...,x_n)=sum_(i=1)^nx_i+sum_(1<=i<=k<=n)product_(j=i)^k1/(x_j). (1) Then minf=3n-C+o(1) (2) as n increases, where the ...
Consider the sum (1) where the x_js are nonnegative and the denominators are positive. Shapiro (1954) asked if f_n(x_1,x_2,...,x_n)>=1/2n (2) for all n. It turns out ...
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, ...
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 ...
Squarefree factorization is a first step in many factoring algorithms. It factors nonsquarefree polynomials in terms of squarefree factors that are relatively prime. It can ...
A sequence s_n^((lambda))(x)=[h(t)]^lambdas_n(x), where s_n(x) is a Sheffer sequence, h(t) is invertible, and lambda ranges over the real numbers. If s_n(x) is an associated ...
...
View search results from all Wolfram sites (51615 matches)

