Search Results for ""

The successive square method is an algorithm to compute a^b in a finite field GF(p). The first step is to decompose b in successive powers of two, b=sum_(i)delta_i2^i, (1) ...

A multimagic square such that the first, second, third, and fourth powers of the elements all yield magic squares is known as a tetramagic square. The first known tetramagic ...

A graph is said to be unswitchable if it cannot be reduced to another graph with the same degree sequence by edge-switching. Conversely, a graph that can be reduced to ...

A number n is called wasteful if the number of digits in the prime factorization of n (including powers) uses more digits than the number of digits in n. The first few ...

The Yiu A-circle of a reference triangle DeltaABC is the circle passing through vertex A and the reflections of vertices B and C with respect to the opposite sides. The Yiu ...

A Z-number is a real number xi such that 0<=frac[(3/2)^kxi]<1/2 for all k=1, 2, ..., where frac(x) is the fractional part of x. Mahler (1968) showed that there is at most one ...

A zero-symmetric graph is a vertex-transitive cubic graph whose edges are partitioned into three orbits by its automorphism group. The figures above show some small ...

A function that can be defined as a Dirichlet series, i.e., is computed as an infinite sum of powers, F(n)=sum_(k=1)^infty[f(k)]^n, where f(k) can be interpreted as the set ...

Calculus II

An equation is said to be a closed-form solution if it solves a given problem in terms of functions and mathematical operations from a given generally-accepted set. For ...