Search Results for ""

A Carmichael number is an odd composite number n which satisfies Fermat's little theorem a^(n-1)-1=0 (mod n) (1) for every choice of a satisfying (a,n)=1 (i.e., a and n are ...

The Johnson midpoint is the point of concurrence of the line segments joining the vertices of a reference triangle with the centers of a certain set of circles (that resemble ...

Any two rectilinear figures with equal area can be dissected into a finite number of pieces to form each other. This is the Wallace-Bolyai-Gerwien theorem. For minimal ...

A Sierpiński number of the second kind is a number k satisfying Sierpiński's composite number theorem, i.e., a Proth number k such that k·2^n+1 is composite for every n>=1. ...

Proportionally cutting circles are circles that intersect the sidelines of a reference triangle DeltaABC such that length of the chords that are cut off have lengths mua, ...

The partial order width of a set P is equal to the minimum number of chains needed to cover P. Equivalently, if a set P of ab+1 elements is partially ordered, then P contains ...

Let a^p+b^p=c^p be a solution to Fermat's last theorem. Then the corresponding Frey curve is y^2=x(x-a^p)(x+b^p). (1) Ribet (1990a) showed that such curves cannot be modular, ...

A matrix whose entries are all integers. Special cases which arise frequently are those having only (-1,1) as entries (e.g., Hadamard matrix), (0,1)-matrices having only ...

Let A be a matrix and x and b vectors. Then the system Ax=b, x>=0 has no solution iff the system A^(T)y>=0, b^(T)y<0 has a solution, where y is a vector (Fang and Puthenpura ...

The correspondence which relates the Hanoi graph to the isomorphic graph of the odd binomial coefficients in Pascal's triangle, where the adjacencies are determined by ...