Search Results for ""

A branch of mathematics that is a sort of generalization of calculus. Calculus of variations seeks to find the path, curve, surface, etc., for which a given function has a ...

A camel graph is a graph formed by all possible moves of a hypothetical chess piece called a "camel" which moves analogously to a knight except that it is restricted to moves ...

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

It is thought that the totient valence function N_phi(m)>=2, i.e., if there is an n such that phi(n)=m, then there are at least two solutions n. This assertion is called ...

Based on methods developer in collaboration with M. Leclert, Catalan (1865) computed the constant K=0.915965594177... (OEIS A006752) now known as Catalans' constant to 9 ...

A caterpillar graph, caterpillar tree, or simply "caterpillar," is a tree in which every graph vertex is on a central stalk or only one graph edge away from the stalk (in ...

The (connected) caveman graph is a graph arising in social network theory formed by modifying a set of isolated k-cliques (or "caves") by removing one edge from each clique ...

The Cayley-Purser algorithm is a public-key cryptography algorithm that relies on the fact that matrix multiplication is not commutative. It was devised by Sarah Flannery ...

The Celmins-Swart snarks are the two snarks on 26 vertices and 39 edges illustrated above. They are implemented in the Wolfram Language as GraphData["CelminsSwartSnark1"] and ...