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 p-adic integer is a p-adic number of the form sum_(k=m)^(infty)a_kp^k, where m>=0, a_k are integers, and p is prime. It is sufficient to take a_k in the set {0,1,...,p-1}. ...

In general, polynomial equations higher than fourth degree are incapable of algebraic solution in terms of a finite number of additions, subtractions, multiplications, ...

The Farey sequence F_n for any positive integer n is the set of irreducible rational numbers a/b with 0<=a<=b<=n and (a,b)=1 arranged in increasing order. The first few are ...

In the theory of transfinite ordinal numbers, 1. Every well ordered set has a unique ordinal number, 2. Every segment of ordinals (i.e., any set of ordinals arranged in ...

The average number of regions into which n randomly chosen planes divide a cube is N^_(n)=1/(324)(2n+23)n(n-1)pi+n+1 (Finch 2003, p. 482). The maximum number of regions is ...

The symbol used to separate the integer part of a decimal number from its fractional part is called the decimal point. In the United States, the decimal point is denoted with ...

A Dirichlet L-series is a series of the form L_k(s,chi)=sum_(n=1)^inftychi_k(n)n^(-s), (1) where the number theoretic character chi_k(n) is an integer function with period k, ...

The term "Euler function" may be used to refer to any of several functions in number theory and the theory of special functions, including 1. the totient function phi(n), ...

The number of bases in which 1/p is a repeating decimal (actually, repeating b-ary) of length l is the same as the number of fractions 0/(p-1), 1/(p-1), ..., (p-2)/(p-1) ...