Search Results for ""

If the first case of Fermat's last theorem is false for the prime exponent p, then 3^(p-1)=1 (mod p^2).

B_(p+k)=B_k+B_(k+1) (mod p), when p is prime and B_n is a Bell number.

A congruence of the form ax^2+bx+c=0 (mod m), (1) where a, b, and c are integers. A general quadratic congruence can be reduced to the congruence x^2=q (mod p) (2) and can be ...

A linear congruence equation ax=b (mod m) (1) is solvable iff the congruence b=0 (mod d) (2) with d=GCD(a,m) is the greatest common divisor is solvable. Let one solution to ...

Let T(m) denote the set of the phi(m) numbers less than and relatively prime to m, where phi(n) is the totient function. Define f_m(x)=product_(t in T(m))(x-t). (1) Then a ...

A method for generating random (pseudorandom) numbers using the linear recurrence relation X_(n+1)=aX_n+c (mod m), where a and c must assume certain fixed values, m is some ...

Let three isoscelizers I_(AC)I_(AB), I_(BA)I_(BC), and I_(CA)I_(CB) be constructed on a triangle DeltaABC, one for each side. This makes all of the inner triangles similar to ...

The problem of finding the mean triangle area of a triangle with vertices picked inside a triangle with unit area was proposed by Watson (1865) and solved by Sylvester. It ...

The geometric centroid (center of mass) of the polygon vertices of a triangle is the point G (sometimes also denoted M) which is also the intersection of the triangle's three ...

A triangle DeltaA^'B^'C^' is said to be inscribed in a triangle DeltaABC if A^' lies on BC, B^' lies on CA, and C^' lies on AB (Kimberling 1998, p. 184). Examples include the ...