Search Results for ""

Let x be a positive number, and define lambda(d) = mu(d)[ln(x/d)]^2 (1) f(n) = sum_(d)lambda(d), (2) where the sum extends over the divisors d of n, and mu(n) is the Möbius ...

A Størmer number is a positive integer n for which the greatest prime factor p of n^2+1 is at least 2n. Every Gregory number t_x can be expressed uniquely as a sum of t_ns ...

The tetranacci numbers are a generalization of the Fibonacci numbers defined by T_0=0, T_1=1, T_2=1, T_3=2, and the recurrence relation T_n=T_(n-1)+T_(n-2)+T_(n-3)+T_(n-4) ...

By way of analogy with the eban numbers, uban numbers are defined as numbers whose English names do not contain the letter "u" (i.e., "u" is banned). Note that this ...

Whipple derived a great many identities for generalized hypergeometric functions, many of which are consequently known as Whipple's identities (transformations, etc.). Among ...

The prime counting function is the function pi(x) giving the number of primes less than or equal to a given number x (Shanks 1993, p. 15). For example, there are no primes ...

Just as many interesting integer sequences can be defined and their properties studied, it is often of interest to additionally determine which of their elements are prime. ...

The cuban primes, named after differences between successive cubic numbers, have the form n^3-(n-1)^3. The first few are 7, 19, 37, 61, 127, 271, ... (OEIS A002407), which ...

[scale=.3]/troves/MathOzTeX/graphics/gifs/melencol.jpg Dürer's magic square is a magic square with magic constant 34 used in an engraving entitled Melencolia I by Albrecht ...

The EKG sequence is the integer sequence having 1 as its first term, 2 as its second, and with each succeeding term being the smallest number not already used that shares a ...