Search Results for ""

A binomial coefficient (N; k) with k>=2 is called good if its least prime factor satisfies lpf(N; k)>k (Erdős et al. 1993). This is equivalent to the requirement that GCD((N; ...

The Simson cubic is the triangle cubic that is the locus of tripoles of the Simson lines of a triangle DeltaABC. It has trilinear equation ...

The circumcircle is a triangle's circumscribed circle, i.e., the unique circle that passes through each of the triangle's three vertices. The center O of the circumcircle is ...

An ordinary differential equation (frequently called an "ODE," "diff eq," or "diffy Q") is an equality involving a function and its derivatives. An ODE of order n is an ...

A quartic symmetric graph is a symmetric graph that is also quartic (i.e., regular of degree 4). The numbers of symmetric quartic graphs on n=1, 2, ... are 0, 0, 0, 0, 1, 1, ...

An addition chain for a number n is a sequence 1=a_0<a_1<...<a_r=n, such that each member after a_0 is the sum of two earlier (not necessarily distinct) ones. The number r is ...

A series is called artistic if every three consecutive terms have a common three-way ratio P[a_i,a_(i+1),a_(i+2)]=((a_i+a_(i+1)+a_(i+2))a_(i+1))/(a_ia_(i+2)). A series is ...

In a cochain complex of modules ...->C^(i-1)->^(d^(i-1))C^i->^(d^i)C^(i+1)->..., the module B^i of i-coboundaries is the image of d^(i-1). It is a submodule of C^i and is ...

One million (10^6) bytes. Unfortunately, the term is sometimes also used to mean 2^(20)=1024^2=1048576 bytes. Furthermore, a third meaning of the term refers to 1024000 bytes ...

What is the longest ladder that can be moved around a right-angled hallway of unit width? For a straight, rigid ladder, the answer is 2sqrt(2), which allows the ladder to ...