Search Results for ""

Find nontrivial solutions to sigma(x^2)=sigma(y^2) other than (x,y)=(4,5), where sigma(n) is the divisor function. Nontrivial solutions means that solutions which are ...

A number n is called wasteful if the number of digits in the prime factorization of n (including powers) uses more digits than the number of digits in n. The first few ...

Apéry's constant is defined by zeta(3)=1.2020569..., (1) (OEIS A002117) where zeta(z) is the Riemann zeta function. B. Haible and T. Papanikolaou computed zeta(3) to 1000000 ...

The Euler-Mascheroni constant gamma=0.577215664901532860606512090082402431042... (OEIS A001620) was calculated to 16 digits by Euler in 1781 and to 32 decimal places by ...

Let the sum of the squares of the digits of a positive integer s_0 be represented by s_1. In a similar way, let the sum of the squares of the digits of s_1 be represented by ...

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

Let the nth composition of a function f(x) be denoted f^((n))(x), such that f^((0))(x)=x and f^((1))(x)=f(x). Denote the composition of f and g by f degreesg(x)=f(g(x)), and ...

A mathematical object (such as a set or function) is said to bounded if it possesses a bound, i.e., a value which all members of the set, functions, etc., are less than.

If a and n are relatively prime so that the greatest common divisor GCD(a,n)=1, then a^(lambda(n))=1 (mod n), where lambda is the Carmichael function.

A discrete space is simply a topological space equipped with the discrete topology. A discrete space is always a metric space, namely the metric space with the same ...