Search Results for ""
231 - 240 of 376 for Divide fractionsSearch Results
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 ...
The highest order power in a univariate polynomial is known as its order (or, more properly, its polynomial degree). For example, the polynomial ...
A nonzero and noninvertible element a of a ring R which generates a prime ideal. It can also be characterized by the condition that whenever a divides a product in R, a ...
Given an integer sequence {a_n}_(n=1)^infty, a prime number p is said to be a primitive prime factor of the term a_n if p divides a_n but does not divide any a_m for m<n. It ...
Also called "Ethiopian multiplication." To multiply two numbers a and b, write a_0=a and b_0=b in two columns. Under a_0, write |_a_0/2_|, where |_x_| is the floor function, ...
A siteswap is a sequence encountered in juggling in which each term is a positive integer, encoded in binary. The transition rule from one term to the next consists of ...
The average number of regions N(n) into which n lines divide a square is N^_(n)=1/(16)n(n-1)pi+n+1 (Santaló 1976; Finch 2003, p. 481). The maximum number of sequences is ...
A tesseral harmonic is a spherical harmonic of the form cos; sin(mphi)P_l^m(costheta). These harmonics are so named because the curves on which they vanish are l-m parallels ...
A brute-force method of finding a divisor of an integer n by simply plugging in one or a set of integers and seeing if they divide n. Repeated application of trial division ...
In an integral domain R, the decomposition of a nonzero noninvertible element a as a product of prime (or irreducible) factors a=p_1...p_n, (1) is unique if every other ...
...
View search results from all Wolfram sites (4887 matches)

