Search Results for ""

In combinatorial logic minimization, a device known as a Karnaugh map is frequently used. It is similar to a truth table, but the various variables are represented along two ...

Kobon Fujimura asked for the largest number N(n) of nonoverlapping triangles that can be constructed using n lines (Gardner 1983, p. 170). A Kobon triangle is therefore ...

In the fields of functional and harmonic analysis, the Littlewood-Paley decomposition is a particular way of decomposing the phase plane which takes a single function and ...

A function f is said to be an entire modular form of weight k if it satisfies 1. f is analytic in the upper half-plane H, 2. f((atau+b)/(ctau+d))=(ctau+d)^kf(tau) whenever [a ...

By way of analogy with the prime counting function pi(x), the notation pi_(a,b)(x) denotes the number of primes of the form ak+b less than or equal to x (Shanks 1993, pp. ...

A Diophantine problem (i.e., one whose solution must be given in terms of integers) which seeks a solution to the following problem. Given n men and a pile of coconuts, each ...

A group whose group operation is identified with multiplication. As with normal multiplication, the multiplication operation on group elements is either denoted by a raised ...

Poker is a card game played with a normal deck of 52 cards. Sometimes, additional cards called "jokers" are also used. In straight or draw poker, each player is normally ...

The Pratt certificate is a primality certificate based on Fermat's little theorem converse. Prior to the work of Pratt (1975), the Lucas-Lehmer test had been regarded purely ...

A public-key cryptography algorithm which uses prime factorization as the trapdoor one-way function. Define n=pq (1) for p and q primes. Also define a private key d and a ...