Search Results for ""
7071 - 7080 of 13131 for eulerstotienttheorem.htmlSearch Results

If one looks inside a flat origami without unfolding it, one sees a zigzagged profile, determined by an alternation of "mountain-creases" and "valley-creases." The numbers of ...
Consider the Lagrange interpolating polynomial f(x)=b_0+(x-1)(b_1+(x-2)(b_3+(x-3)+...)) (1) through the points (n,p_n), where p_n is the nth prime. For the first few points, ...
A set of n magic circles is a numbering of the intersections of the n circles such that the sum over all intersections is the same constant for all circles. The above sets of ...
The number M_2(n) = 1/nsum_(k=1)^(n^2)k (1) = 1/2n(n^2+1) (2) to which the n numbers in any horizontal, vertical, or main diagonal line must sum in a magic square. The first ...
A magic cube is an n×n×n version of a magic square in which the n^2 rows, n^2 columns, n^2 pillars, and four space diagonals each sum to a single number M_3(n) known as the ...
Let E be a compact connected subset of d-dimensional Euclidean space. Gross (1964) and Stadje (1981) proved that there is a unique real number a(E) such that for all x_1, ...
An edge-magic graph is a labeled graph with e graph edges labeled with distinct elements {1,2,...,e} so that the sum of the graph edge labels at each graph vertex is the ...
A magic hexagon of order n is an arrangement of close-packed hexagons containing the numbers 1, 2, ..., H_(n-1), where H_n is the nth hex number such that the numbers along ...
A magic hexagram is a hexagram partitioned into triangles such that the sums of numbers in the six directions illustrated above sum to the same number. There are exactly two ...
It is conjectured that every tree with e edges whose nodes are all trivalent or monovalent can be given a "magic" labeling such that the integers 1, 2, ..., e can be assigned ...

...