Search Results for ""

A (0,1)-matrix is an integer matrix in which each element is a 0 or 1. It is also called a logical matrix, binary matrix, relation matrix, or Boolean matrix. The number of ...

The number obtained by adding the reciprocals of the odd twin primes, B=(1/3+1/5)+(1/5+1/7)+(1/(11)+1/(13))+(1/(17)+1/(19))+.... (1) By Brun's theorem, the series converges ...

Many algorithms have been devised for determining the prime factors of a given number (a process called prime factorization). They vary quite a bit in sophistication and ...

An even alternating permutation number, more commonly called a tangent number.

The following are equivalent definitions for a Galois extension field (also simply known as a Galois extension) K of F. 1. K is the splitting field for a collection of ...

A Latin square is said to be odd if it contains an odd number of rows and columns that are odd permutations. Otherwise, it is said to be even. Let the number of even Latin ...

Define a Bouniakowsky polynomial as an irreducible polynomial f(x) with integer coefficients, degree >1, and GCD(f(1),f(2),...)=1. The Bouniakowsky conjecture states that ...

Given an arithmetic progression of terms an+b, for n=1, 2, ..., the series contains an infinite number of primes if a and b are relatively prime, i.e., (a,b)=1. This result ...

A partition {a_1,...,a_n} is called graphical if there exists a graph G having degree sequence {a_1,...,a_n}. The number of graphical partitions of length n is equal to the ...

Legendre's constant is the number 1.08366 in Legendre's guess at the prime number theorem pi(n)=n/(lnn-A(n)) with lim_(n->infty)A(n) approx 1.08366. Legendre first published ...