Search Results for ""

If n>1, (a,n)=1 (i.e., a and n are relatively prime), and m is the least integer >sqrt(n), then there exist an x and y such that ay=+/-x (mod n) where 0<x<m and 0<y<m (Nagell ...

A multiplicative character is called unitary if it has absolute value 1 everywhere.

Let p be an irregular prime, and let P=rp+1 be a prime with P<p^2-p. Also let t be an integer such that t^3≢1 (mod P). For an irregular pair (p,2k), form the product ...

Let N be an odd integer, and assume there exists a Lucas sequence {U_n} with associated Sylvester cyclotomic numbers {Q_n} such that there is an n>sqrt(N) (with n and N ...

n-minex is defined as 10^(-n).

n-plex is defined as 10^n.

The Jacobi symbol, written (n/m) or (n/m) is defined for positive odd m as (n/m)=(n/(p_1))^(a_1)(n/(p_2))^(a_2)...(n/(p_k))^(a_k), (1) where m=p_1^(a_1)p_2^(a_2)...p_k^(a_k) ...

Let L_n be the n×n matrix whose (i,j)th entry is 1 if j divides i and 0 otherwise, let Phi_n be the n×n diagonal matrix diag(phi(1),phi(2),...,phi(n)), where phi(n) is the ...

The first few prime Lucas numbers L_n are 2, 3, 7, 11, 29, 47, 199, 521, 2207, 3571, ... (OEIS A005479), corresponding to indices n=0, 2, 4, 5, 7, 8, 11, 13, 16, 17, 19, 31, ...

A method for finding solutions u and v to a linear congruence au+bv=d by constructing a matrix formed by adjoining a vector containing a and b with a unit matrix, M=[a 1 0; b ...