Search Results for ""

Let |sum_(n=1)^pa_n|<K, (1) where K is independent of p. Then if f_n>=f_(n+1)>0 and lim_(n->infty)f_n=0, (2) it follows that sum_(n=1)^inftya_nf_n (3) converges.

An element of an adèle group, sometimes called a repartition in older literature (e.g., Chevalley 1951, p. 25). Adèles arise in both number fields and function fields. The ...

Let a prime number generated by Euler's prime-generating polynomial n^2+n+41 be known as an Euler prime. (Note that such primes are distinct from prime Euler numbers, which ...

The Hall-Janko graph, also known as the Hall-Janko-Wales graph, is a strongly regular graph on 100 nodes with parameters (nu,k,lambda,mu)=(100,36,14,12). It is also a ...

Honaker's problem asks for all consecutive prime number triples (p,q,r) with p<q<r such that p|(qr+1). Caldwell and Cheng (2005) showed that the only Honaker triplets for ...

The pathwidth of a graph G, also called the interval thickness, vertex separation number, and node searching number, is one less than the size of the largest set in a path ...

For the rational curve of an unperturbed system with rotation number r/s under a map T (for which every point is a fixed point of T^s), only an even number of fixed points ...

A radical integer is a number obtained by closing the integers under addition, multiplication, subtraction, and root extraction. An example of such a number is RadicalBox[7, ...

The sequence obtained from reversing the digits of a number n and adding the result to the original number. For n=1, 2, ..., this gives 2, 4, 6, 8, 10, 12, 14, 16, 18, 11, ...

In the 1980s, Samuel Yates defined a titanic prime to be a prime number of at least 1000 decimal digits. The smallest titanic prime is 10^(999)+7. As of 1990, more than 1400 ...