Search Results for ""

A sequence of numbers V={nu_n} is complete if every positive integer n is the sum of some subsequence of V, i.e., there exist a_i=0 or 1 such that n=sum_(i=1)^inftya_inu_i ...

The Darboux cubic Z(X_(20)) of a triangle DeltaABC is the locus of all pedal-cevian points (i.e., of all points whose pedal triangle is perspective with DeltaABC). It is a ...

In 1657, Fermat posed the problem of finding solutions to sigma(x^3)=y^2, and solutions to sigma(x^2)=y^3, where sigma(n) is the divisor function (Dickson 2005). The first ...

The Fibonacci numbers are the sequence of numbers {F_n}_(n=1)^infty defined by the linear recurrence equation F_n=F_(n-1)+F_(n-2) (1) with F_1=F_2=1. As a result of the ...

The Fibonacci Q-matrix is the matrix defined by Q=[F_2 F_1; F_1 F_0]=[1 1; 1 0], (1) where F_n is a Fibonacci number. Then Q^n=[F_(n+1) F_n; F_n F_(n-1)] (2) (Honsberger ...

The fibonorial n!_F, also called the Fibonacci factorial, is defined as n!_F=product_(k=1)^nF_k, where F_k is a Fibonacci number. For n=1, 2, ..., the first few fibonorials ...

Let p>3 be a prime number, then 4(x^p-y^p)/(x-y)=R^2(x,y)-(-1)^((p-1)/2)pS^2(x,y), where R(x,y) and S(x,y) are homogeneous polynomials in x and y with integer coefficients. ...

An independent dominating set of a graph G is a set of vertices in G that is both an independent vertex set and a dominating set of G. The minimum size of an independent ...

The Morgan-Voyce polynomials are polynomials related to the Brahmagupta and Fibonacci polynomials. They are defined by the recurrence relations b_n(x) = ...

A pivotal isocubic is an isocubic on the lines connecting pairs of isoconjugates that pass through a fixed point P (the pivot point). Pivotal isocubics intersect the ...