Search Results for ""

Find the minimum size square capable of bounding n equal squares arranged in any configuration. The first few cases are illustrated above (Friedman). The only packings which ...

A number v=xy with an even number n of digits formed by multiplying a pair of n/2-digit numbers (where the digits are taken from the original number in any order) x and y ...

E. Pegg Jr. (pers. comm., Nov. 8, 2004) found an approximation to Apéry's constant zeta(3) given by zeta(3) approx 10+zeta(16)-sqrt(96), (1) which is good to 6 digits. M. ...

Feynman (1997, p. 116) noticed the curious fact that the decimal expansion 1/(243)=0.004115226337448559... (1) repeats pairs of the digits 0, 1, 2, 3, ... separated by the ...

Given a homogeneous linear second-order ordinary differential equation, y^('')+P(x)y^'+Q(x)y=0, (1) call the two linearly independent solutions y_1(x) and y_2(x). Then ...

Abel's integral is the definite integral I = int_0^infty(tdt)/((e^(pit)-e^(-pit))(t^2+1)) (1) = 1/2int_(-infty)^infty(tdt)/((e^(pit)-e^(-pit))(t^2+1)) (2) = ...

"Arabic numerals" are the numerical symbols 1, 2, 3, 4, 5, 6, 7, 8, 9, and 0. Historically, Indian numerals evolved in Arab usage roughly 1000 A.D., and there was rare ...

Let P(x) be defined as the power series whose nth term has a coefficient equal to the nth prime p_n, P(x) = 1+sum_(k=1)^(infty)p_kx^k (1) = 1+2x+3x^2+5x^3+7x^4+11x^5+.... (2) ...

An integer n is p-balanced for p a prime if, among all nonzero binomial coefficients (n; k) for k=0, ..., n (mod p), there are equal numbers of quadratic residues and ...

Let T(m) denote the set of the phi(m) numbers less than and relatively prime to m, where phi(n) is the totient function. Define f_m(x)=product_(t in T(m))(x-t). (1) Then a ...