Search Results for ""
181 - 190 of 933 for Catalan Dickson ConjectureSearch Results
Thâbit ibn Kurrah's rules is a beautiful result of Thâbit ibn Kurrah dating back to the tenth century (Woepcke 1852; Escott 1946; Dickson 2005, pp. 5 and 39; Borho 1972). ...
A concordant form is an integer triple (a,b,N) where {a^2+b^2=c^2; a^2+Nb^2=d^2, (1) with c and d integers. Examples include {14663^2+111384^2=112345^2; ...
Consider the number of sequences that can be formed from permutations of a set of elements such that each partial sum is nonnegative. The number of sequences with nonnegative ...
Let T(x,y,z) be the number of times "otherwise" is called in the TAK function, then the Takeuchi numbers are defined by T_n(n,0,n+1). A recursive formula for T_n is given by ...
The Kronecker symbol is an extension of the Jacobi symbol (n/m) to all integers. It is variously written as (n/m) or (n/m) (Cohn 1980; Weiss 1998, p. 236) or (n|m) (Dickson ...
A Dyck path is a staircase walk from (0,0) to (n,n) that lies strictly below (but may touch) the diagonal y=x. The number of Dyck paths of order n is given by the Catalan ...
The Archimedean duals are the 13 duals of the 13 Archimedean solids, sometimes called the Catalan solids. They are summarized in the following table and illustrated below ...
Nice approximations for the golden ratio phi are given by phi approx sqrt((5pi)/6) (1) approx (7pi)/(5e), (2) the last of which is due to W. van Doorn (pers. comm., Jul. 18, ...
A planted plane tree (V,E,v,alpha) is defined as a vertex set V, edges set E, root v, and order relation alpha on V which satisfies 1. For x,y in V if rho(x)<rho(y), then ...
A polygonal diagonal is a line segment connecting two nonadjacent polygon vertices of a polygon. The number of ways a fixed convex n-gon can be divided into triangles by ...
...
View search results from all Wolfram sites (2395 matches)

