Search Results for ""

An integer m such that if p|m, then p^2|m, is called a powerful number. There are an infinite number of powerful numbers, and the first few are 1, 4, 8, 9, 16, 25, 27, 32, ...

A prime factor is a factor that is prime, i.e., one that cannot itself be factored. In general, a prime factorization takes the form ...

The factorization of a number into its constituent primes, also called prime decomposition. Given a positive integer n>=2, the prime factorization is written ...

The prime zeta function P(s)=sum_(p)1/(p^s), (1) where the sum is taken over primes is a generalization of the Riemann zeta function zeta(s)=sum_(k=1)^infty1/(k^s), (2) where ...

Probability is the branch of mathematics that studies the possible outcomes of given events together with the outcomes' relative likelihoods and distributions. In common ...

A recurrence equation (also called a difference equation) is the discrete analog of a differential equation. A difference equation involves an integer function f(n) in a form ...

The regular heptagon is the seven-sided regular polygon illustrated above, which has Schläfli symbol {7}. According to Bankoff and Garfunkel (1973), "since the earliest days ...

A Riemann surface is a surface-like configuration that covers the complex plane with several, and in general infinitely many, "sheets." These sheets can have very complicated ...

Let a spherical triangle be drawn on the surface of a sphere of radius R, centered at a point O=(0,0,0), with vertices A, B, and C. The vectors from the center of the sphere ...

Let b(k) be the number of 1s in the binary expression of k, i.e., the binary digit count of 1, giving 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, ... (OEIS A000120) for k=1, 2, .... ...