Search Results for ""

The inverse of a square matrix A, sometimes called a reciprocal matrix, is a matrix A^(-1) such that AA^(-1)=I, (1) where I is the identity matrix. Courant and Hilbert (1989, ...

A maximum clique of a graph G is a clique (i.e., complete subgraph) of maximum possible size for G. Note that some authors refer to maximum cliques simply as "cliques." The ...

Mills (1947) proved the existence of a real constant A such that |_A^(3^n)_| (1) is prime for all integers n>=1, where |_x_| is the floor function. Mills (1947) did not, ...

Minkowski's question mark function is the function y=?(x) defined by Minkowski for the purpose of mapping the quadratic surds in the open interval (0,1) into the rational ...

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 ...

Consider the process of taking a number, multiplying its digits, then multiplying the digits of numbers derived from it, etc., until the remaining number has only one digit. ...

A Mycielski graph M_k of order k is a triangle-free graph with chromatic number k having the smallest possible number of vertices. For example, triangle-free graphs with ...

The numerical value of ln10 is given by ln10=2.302585092994045684... (OEIS A002392). It was computed to 10^(11) decimal digits by S. Kondo on May 20, 2011 (Yee). The Earls ...

In the technical combinatorial sense, an a-ary necklace of length n is a string of n characters, each of a possible types. Rotation is ignored, in the sense that b_1b_2...b_n ...