Search Results for ""

Let I be a set, and let U be an ultrafilter on I, let phi be a formula of a given language L, and let {A_i:i in I} be any collection of structures which is indexed by the set ...

If a group of men and women may date only if they have previously been introduced, then a complete set of dates is possible iff every subset of men has collectively been ...

Write the exact powers of 2 and 3 in sorted order as 1, 2, 3, 4, 8, 9, 16, 27, 32, ... (OEIS A006899), and let u_n be the nth term in the sequence. Then u_(n+1)-u_n tends to ...

A partial solution to the Erdős squarefree conjecture which states that the binomial coefficient (2n; n) is never squarefree for all sufficiently large n>=n_0. Sárkőzy (1985) ...

The perspectrix X of a pair of paralogic triangles DeltaA_1A_2A_3 and DeltaB_1B_2B_3 bisects the line joining the two orthocenters H_A and H_B (Johnson 1929, p. 259).

If f(omega) is square integrable over the real omega-axis, then any one of the following implies the other two: 1. The Fourier transform F(t)=F_omega[f(omega)](t) is 0 for ...

Given the incircle and circumcircle of a bicentric polygon of n sides, the centroid of the tangent points on the incircle is a fixed point W, known as the Weill point, ...

If p is a prime >3, then the numerator of the harmonic number H_(p-1)=1+1/2+1/3+...+1/(p-1) (1) is divisible by p^2 and the numerator of the generalized harmonic number ...

There are several definitions of the strength of a graph. Harary and Palmer (1959) and Harary and Palmer (1973, p. 66) define the strength of a tree as the maximum number of ...

There are several related theorems involving Hamiltonian cycles of graphs that are associated with Pósa. Let G be a simple graph with n graph vertices. 1. If, for every k in ...