Search Results for ""

The term "Euler function" may be used to refer to any of several functions in number theory and the theory of special functions, including 1. the totient function phi(n), ...

A planted tree is a rooted tree whose root vertex has vertex degree 1. The number of planted trees of n nodes is T_(n-1), where T_(n-1) is the number of rooted trees of n-1 ...

The clique polynomial C_G(x) for the graph G is defined as the polynomial C_G(x)=1+sum_(k=1)^(omega(G))c_kx^k, (1) where omega(G) is the clique number of G, the coefficient ...

Smarandache sequences are any of a number of simply generated integer sequences resembling those considered in published works by Smarandache such as the consecutive number ...

Odd values of Q(n) are 1, 1, 3, 5, 27, 89, 165, 585, ... (OEIS A051044), and occur with ever decreasing frequency as n becomes large (unlike P(n), for which the fraction of ...

If r is a root of the polynomial equation x^n+a_(n-1)x^(n-1)+...+a_1x+a_0=0, where the a_is are integers and r satisfies no similar equation of degree <n, then r is called an ...

Salem constants, sometimes also called Salem numbers, are a set of numbers of which each point of a Pisot number is a limit point from both sides (Salem 1945). The Salem ...

Scientific notation is the expression of a number n in the form a×10^p, where p=|_log_(10)|n|_| (1) is the floor of the base-10 logarithm of n (the "order of magnitude"), and ...

A sphenic number is a positive integer n which is the product of exactly three distinct primes. The first few sphenic numbers are 30, 42, 66, 70, 78, 102, 105, 110, 114, ... ...

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