Search Results for ""

A polygonal number is a type of figurate number that is a generalization of triangular, square, etc., to an n-gon for n an arbitrary positive integer. The above diagrams ...

An integer m such that if p|m, then p^2|m, is called a powerful number. There are an infinite number of powerful numbers, and the first few are 1, 4, 8, 9, 16, 25, 27, 32, ...

A primality test is a test to determine whether or not a given number is prime, as opposed to actually decomposing the number into its constituent prime factors (which is ...

A prism graph, denoted Y_n, D_n (Gallian 1987), or Pi_n (Hladnik et al. 2002), and sometimes also called a circular ladder graph and denoted CL_n (Gross and Yellen 1999, p. ...

A quadratic map is a quadratic recurrence equation of the form x_(n+1)=a_2x_n^2+a_1x_n+a_0. (1) While some quadratic maps are solvable in closed form (for example, the three ...

A number which is simultaneously square and triangular. Let T_n denote the nth triangular number and S_m the mth square number, then a number which is both triangular and ...

The Steiner circumellipse is the circumellipse that is the isotomic conjugate of the line at infinity and the isogonal conjugate of the Lemoine axis. It has circumconic ...

A superellipse is a curve with Cartesian equation |x/a|^r+|y/b|^r=1, (1) first discussed in 1818 by Lamé. A superellipse may be described parametrically by x = acos^(2/r)t ...

A (p,q)-torus knot is obtained by looping a string through the hole of a torus p times with q revolutions before joining its ends, where p and q are relatively prime. A ...

The Tucker circles are a generalization of the cosine circle and first Lemoine circle which can be viewed as a family of circles obtained by parallel displacing sides of the ...