Search Results for ""

The fraction of odd values of the partition function P(n) is roughly 50%, independent of n, whereas odd values of Q(n) occur with ever decreasing frequency as n becomes ...

The "binary" Champernowne constant is obtained by concatenating the binary representations of the integers C_2 = 0.(1)(10)(11)(100)(101)(110)(111)..._2 (1) = ...

The pair group of a group G is the group that acts on the 2-subsets of {1,...,p} whose permutations are induced by G. Pair groups can be calculated using PairGroup[g] in the ...

Also called "Ethiopian multiplication." To multiply two numbers a and b, write a_0=a and b_0=b in two columns. Under a_0, write |_a_0/2_|, where |_x_| is the floor function, ...

A game played with two heaps of counters in which a player may take any number from either heap or the same number from both. The player taking the last counter wins. The rth ...

Given a real number q>1, the series x=sum_(n=0)^inftya_nq^(-n) is called the q-expansion, or beta-expansion (Parry 1957), of the positive real number x if, for all n>=0, ...

The spherical Bessel function of the first kind, denoted j_nu(z), is defined by j_nu(z)=sqrt(pi/(2z))J_(nu+1/2)(z), (1) where J_nu(z) is a Bessel function of the first kind ...

A multiplicative number theoretic function is a number theoretic function f that has the property f(mn)=f(m)f(n) (1) for all pairs of relatively prime positive integers m and ...

The spherical Hankel function of the first kind h_n^((1))(z) is defined by h_n^((1))(z) = sqrt(pi/(2z))H_(n+1/2)^((1))(z) (1) = j_n(z)+in_n(z), (2) where H_n^((1))(z) is the ...

It is thought that the totient valence function N_phi(m)>=2, i.e., if there is an n such that phi(n)=m, then there are at least two solutions n. This assertion is called ...