Search Results for ""

Given binomial coefficient (N; k), write N-k+i=a_ib_i, for 1<=i<=k, where b_i contains only those prime factors >k. Then the number of i for which b_i=1 (i.e., for which all ...

An n-dimensional disk (sometimes spelled "disc") of radius r is the collection of points of distance <=r (closed disk) or <r (open disk) from a fixed point in Euclidean ...

The radius of an excircle. Let a triangle have exradius r_A (sometimes denoted rho_A), opposite side of length a and angle A, area Delta, and semiperimeter s. Then r_1 = ...

Given the Lucas sequence U_n(b,-1) and V_n(b,-1), define Delta=b^2+4. Then an extra strong Lucas pseudoprime to the base b is a composite number n=2^rs+(Delta/n), where s is ...

In 1750, Benjamin Franklin constructed the above 8×8 semimagic square having magic constant 260. Any half-row or half-column in this square totals 130, and the four corners ...

A Goldbach number is a positive integer that is the sum of two odd primes (Li 1999). Let E(x) (the "exceptional set of Goldbach numbers") denote the number of even numbers ...

The eccentricity epsilon(v) of a graph vertex v in a connected graph G is the maximum graph distance between v and any other vertex u of G. For a disconnected graph, all ...

To solve the heat conduction equation on a two-dimensional disk of radius a=1, try to separate the equation using U(r,theta,t)=R(r)Theta(theta)T(t). (1) Writing the theta and ...

Let G be a k-regular graph with girth 5 and graph diameter 2. (Such a graph is a Moore graph). Then, k=2, 3, 7, or 57. A proof of this theorem is difficult (Hoffman and ...

Let a chord of constant length be slid around a smooth, closed, convex curve C, and choose a point on the chord which divides it into segments of lengths p and q. This point ...