Search Results for ""

An integer-relation algorithm which is based on a partial sum of squares approach, from which the algorithm takes its name.

Given any set B, the associated pair groupoid is the set B×B with the maps alpha(a,b)=a and beta(a,b)=b, and multiplication (a,b)·(b,c)=(a,c). The inverse is ...

Apply the 196-algorithm, which consists of taking any positive integer of two digits or more, reversing the digits, and adding to the original number. Now sum the two and ...

The n-Pasechnik graph is a strongly regular graph on (4n-1)^2 vertices constructed from a skew Hadamard matrix of order 4n. It has regular parameters . The 1-Pasechnik is ...

A path gamma is a continuous mapping gamma:[a,b]|->C^0, where gamma(a) is the initial point, gamma(b) is the final point, and C^0 denotes the space of continuous functions. ...

One would think that by analogy with the matching-generating polynomial, independence polynomial, etc., a path polynomial whose coefficients are the numbers of paths of ...

The theory of natural numbers defined by the five Peano's axioms. Paris and Harrington (1977) gave the first "natural" example of a statement which is true for the integers ...

A figurate number corresponding to a pentagonal pyramid. The first few are 1, 6, 18, 40, 75, ... (OEIS A002411). The generating function for the pentagonal pyramidal numbers ...

The pentanacci numbers are a generalization of the Fibonacci numbers defined by P_0=0, P_1=1, P_2=1, P_3=2, P_4=4, and the recurrence relation ...

The pentatope graph is the skeleton of the pentatope, namely the complete graph K_5. It is sometimes also known as the Kuratowski graph (Nikolić et al. 2000, p. 281). Since ...