Search Results for ""

The adjacency matrix, sometimes also called the connection matrix, of a simple labeled graph is a matrix with rows and columns labeled by graph vertices, with a 1 or 0 in ...

Consider decomposition the factorial n! into multiplicative factors p_k^(b_k) arranged in nondecreasing order. For example, 4! = 3·2^3 (1) = 2·3·4 (2) = 2·2·2·3 (3) and 5! = ...

Baillie and Wagstaff (1980) and Pomerance et al. (1980, Pomerance 1984) proposed a test (or rather a related set of tests) based on a combination of strong pseudoprimes and ...

Find a way to stack a square of cannonballs laid out on the ground into a square pyramid (i.e., find a square number which is also square pyramidal). This corresponds to ...

Define a carefree couple as a pair of positive integers (a,b) such that a and b are relatively prime (i.e., GCD(a,b)=1) and a is squarefree. Similarly, define a strongly ...

A chordal graph is a simple graph in which every graph cycle of length four and greater has a cycle chord. In other words, a chordal graph is a graph possessing no chordless ...

The Church-Turing thesis (formerly commonly known simply as Church's thesis) says that any real-world computation can be translated into an equivalent computation involving a ...

Also called Macaulay ring, a Cohen Macaulay ring is a Noetherian commutative unit ring R in which any proper ideal I of height n contains a sequence x_1, ..., x_n of elements ...

Cospectral graphs, also called isospectral graphs, are graphs that share the same graph spectrum. The smallest pair of isospectral graphs is the graph union C_4 union K_1 and ...

A cyclic group is a group that can be generated by a single element X (the group generator). Cyclic groups are Abelian. A cyclic group of finite group order n is denoted C_n, ...