Search Results for ""

If p is prime, then p|P(p), where P(p) is a member of the Perrin sequence 3, 0, 2, 3, 2, 5, 5, 7, 10, 12, 17, ... (OEIS A001608). A Perrin pseudoprime is a composite number n ...

Plouffe's constants are numbers arising in summations of series related to r_n=f(2^n) where f is a trigonometric function. Define the Iverson bracket function rho(x)={1 for ...

A public-key cryptography algorithm which uses prime factorization as the trapdoor one-way function. Define n=pq (1) for p and q primes. Also define a private key d and a ...

The word "rank" refers to several related concepts in mathematics involving graphs, groups, matrices, quadratic forms, sequences, set theory, statistics, and tensors. In ...

In algebraic topology, the Reidemeister torsion is a notion originally introduced as a topological invariant of 3-manifolds which has now been widely adapted to a variety of ...

Let G be a graph, and suppose each edge of G is independently deleted with fixed probability 0<=p<=1. Then the probability that no connected component of G is disconnected as ...

When discussing a rotation, there are two possible conventions: rotation of the axes, and rotation of the object relative to fixed axes. In R^2, consider the matrix that ...

Let a number n be written in binary as n=(epsilon_kepsilon_(k-1)...epsilon_1epsilon_0)_2, (1) and define b_n=sum_(i=0)^(k-1)epsilon_iepsilon_(i+1) (2) as the number of digits ...

The Schröder number S_n is the number of lattice paths in the Cartesian plane that start at (0, 0), end at (n,n), contain no points above the line y=x, and are composed only ...

A self-complementary graph is a graph which is isomorphic to its graph complement. The numbers of simple self-complementary graphs on n=1, 2, ... nodes are 1, 0, 0, 1, 2, 0, ...