Search Results for ""

A variant of the Pollard p-1 method which uses Lucas sequences to achieve rapid factorization if some factor p of N has a decomposition of p+1 in small prime factors.

q-calculus or quantum calculus is a methodology comparable to the usual study of calculus but which is centered on the idea of deriving q-analogous results without the use of ...

A finite group is a group having finite group order. Examples of finite groups are the modulo multiplication groups, point groups, cyclic groups, dihedral groups, symmetric ...

Bertelsen's number is an erroneous name erroneously given to the erroneous value of pi(10^9)=50847478, where pi(x) is the prime counting function. This value is 56 lower than ...

The degree to which a given quantity is correct and free from error. For example, a quantity specified as 100+/-1 has an (absolute) accuracy of +/-1 (meaning its true value ...

An angle bracket is the combination of a bra and ket (bra+ket = bracket) which represents the inner product of two functions or vectors (or 1-forms), <f|g>=intf(x)g^|(x)dx in ...

The Buchstab function omega(u) is defined by the delay differential equation {uomega(u)=1 for 1<=u<=2; (uomega(u))^'=omega(u-1) for u>2 (1) (Panario 1998). It approaches the ...

A map f:X-->Y is called constant with constant value y if f(x)=y for all x in X, i.e., if all elements of X are sent to same element y of Y.

A method which can be used to solve any quadratic congruence equation. This technique relies on the fact that solving x^2=b (mod p) is equivalent to finding a value y such ...

Let the elements in a payoff matrix be denoted a_(ij), where the is are player A's strategies and the js are player B's strategies. Player A can get at least min_(j<=n)a_(ij) ...