Search Results for ""

Let f(x) be a monic polynomial of degree d with discriminant Delta. Then an odd integer n with (n,f(0)Delta)=1 is called a Frobenius pseudoprime with respect to f(x) if it ...

The Frobenius equation is the Diophantine equation a_1x_1+a_2x_2+...+a_nx_n=b, where the a_i are positive integers, b is an integer, and the solutions x_i are nonnegative ...

The Frobenius norm, sometimes also called the Euclidean norm (a term unfortunately also used for the vector L^2-norm), is matrix norm of an m×n matrix A defined as the square ...

The Frobenius number is the largest value b for which the Frobenius equation a_1x_1+a_2x_2+...+a_nx_n=b, (1) has no solution, where the a_i are positive integers, b is an ...

A map x|->x^p where p is a prime.

Let F be a field of field characteristic p. Then the Frobenius automorphism on F is the map phi:F->F which maps alpha to alpha^p for each element alpha of F.

Let A=a_(ij) be a matrix with positive coefficients so that a_(ij)>0 for all i,j=1, 2, ..., n, then A has a positive eigenvalue lambda_0, and all its eigenvalues lie on the ...

If x_0 is an ordinary point of the ordinary differential equation, expand y in a Taylor series about x_0. Commonly, the expansion point can be taken as x_0=0, resulting in ...

A pseudoprime which obeys an additional restriction beyond that required for a Frobenius pseudoprime. A number n with (n,2a)=1 is a strong Frobenius pseudoprime with respect ...

rho_(n+1)(x)=intrho_n(y)delta[x-M(y)]dy, where delta(x) is a delta function, M(x) is a map, and rho is the natural invariant.