Search Results for ""

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 ...

A divisor d of a positive integer n is biunitary if the greatest common unitary divisor of d and n/d is 1. For a prime power p^y, the biunitary divisors are the powers 1, p, ...

The Bernoulli numbers B_n are a sequence of signed rational numbers that can be defined by the exponential generating function x/(e^x-1)=sum_(n=0)^infty(B_nx^n)/(n!). (1) ...

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 ...

Let p be a prime with n digits and let A be a constant. Call p an "A-prime" if the concatenation of the first n digits of A (ignoring the decimal point if one is present) ...

Let D be a planar Abelian difference set and t be any divisor of n. Then t is a numerical multiplier of D, where a multiplier is defined as an automorphism alpha of a group G ...

Define the zeta function of a variety over a number field by taking the product over all prime ideals of the zeta functions of this variety reduced modulo the primes. Hasse ...

A test for the primality of Fermat numbers F_n=2^(2^n)+1, with n>=2 and k>=2. Then the two following conditions are equivalent: 1. F_n is prime and (k/F_n)=-1, where (n/k) is ...

The graph sum of graphs G and H is the graph with adjacency matrix given by the sum of adjacency matrices of G and H. A graph sum is defined when the orders of G and H are ...

Take K a number field and L an Abelian extension, then form a prime divisor m that is divided by all ramified primes of the extension L/K. Now define a map phi_(L/K) from the ...