Search Results for ""

To generate random points over the unit disk, it is incorrect to use two uniformly distributed variables r in [0,1] and theta in [0,2pi) and then take x = rcostheta (1) y = ...

A centered polygonal number consisting of a central dot with five dots around it, and then additional dots in the gaps between adjacent dots. The general term is ...

A centered polygonal number consisting of a central dot with four dots around it, and then additional dots in the gaps between adjacent dots. The general term is n^2+(n+1)^2, ...

A pseudoperfect number for which none of its proper divisors are pseudoperfect (Guy 1994, p. 46). The first few are 6, 20, 28, 88, 104, 272, ... (OEIS A006036). Primitive ...

An extremely fast factorization method developed by Pollard which was used to factor the RSA-130 number. This method is the most powerful known for factoring general numbers, ...

A solution zeta_k=e^(2piik/d) to the cyclotomic equation x^d=1. The de Moivre numbers give the coordinates in the complex plane of the polygon vertices of a regular polygon ...

A number theoretic character, also called a Dirichlet character (because Dirichlet first introduced them in his famous proof that every arithmetic progression with relatively ...

A figurate number corresponding to a pentagonal pyramid. The first few are 1, 6, 18, 40, 75, ... (OEIS A002411). The generating function for the pentagonal pyramidal numbers ...

A colossally abundant number is a positive integer n for which there is a positive exponent epsilon such that (sigma(n))/(n^(1+epsilon))>=(sigma(k))/(k^(1+epsilon)) for all ...

A generalization of the Fibonacci numbers defined by 1=G_1=G_2=...=G_(c-1) and the recurrence relation G_n=G_(n-1)+G_(n-c). (1) These are the sums of elements on successive ...