Search Results for ""

A zerofree number n is called right truncatable if n and all numbers obtained by successively removing the rightmost digits are prime. There are exactly 83 right truncatable ...

An (n,k)-banana tree, as defined by Chen et al. (1997), is a graph obtained by connecting one leaf of each of n copies of an k-star graph with a single root vertex that is ...

If theta is a given irrational number, then the sequence of numbers {ntheta}, where {x}=x-|_x_|, is dense in the unit interval. Explicitly, given any alpha, 0<=alpha<=1, and ...

Let the sum of squares function r_k(n) denote the number of representations of n by k squares, then the summatory function of r_2(k)/k has the asymptotic expansion ...

A Pierpont prime is a prime number of the form p=2^k·3^l+1. The first few Pierpont primes are 2, 3, 5, 7, 13, 17, 19, 37, 73, 97, 109, 163, 193, 257, 433, 487, 577, 769, ... ...

Consider two closed oriented space curves f_1:C_1->R^3 and f_2:C_2->R^3, where C_1 and C_2 are distinct circles, f_1 and f_2 are differentiable C^1 functions, and f_1(C_1) ...

Every irrational number x can be expanded in a unique continued fraction expansion x=b_0+(e_1)/(b_1+(e_2)/(b_2+(e_3)/(b_3+...)))=[b_0;e_1b_1,e_2b_2,e_3b_3,...] such that b_0 ...

Does there exist an algorithm for deciding whether or not a specific mathematical assertion does or does not have a proof? The decision problem is also known as the ...

For all n, there exists a k such that the kth term of the Goodstein sequence G_k(n)=0. In other words, every Goodstein sequence converges to 0. The secret underlying ...

The multinomial coefficients (n_1,n_2,...,n_k)!=((n_1+n_2+...+n_k)!)/(n_1!n_2!...n_k!) (1) are the terms in the multinomial series expansion. In other words, the number of ...