Find link

language:

Find link is a tool written by Edward Betts.

searching for Divisor function 7 found (116 total)

Divisor sum identities (2,878 words) [view diff] exact match in snippet view article find links to article

variants of these divisor sums with respect to the greatest common divisor function in the form of g m ( n ) := ∑ d ∣ ( m , n ) f ( d ) , 1 ≤ m ≤ n {\displaystyle

Numerically controlled oscillator (1,647 words) [view diff] exact match in snippet view article find links to article

{2^{N}}{{\mbox{GCD}}(\Delta F,2^{N})}}} where GCD is the greatest common divisor function. The GRR represents the true periodicity for a given Δ F {\displaystyle

Anonymous function (2,284 words) [view diff] exact match in snippet view article find links to article

half and third curry the divide function with a fixed divisor. The divisor function also forms a closure by binding the variable d. A higher-order function

Greatest common divisor (4,743 words) [view diff] exact match in snippet view article find links to article

Using this information, the expected value of the greatest common divisor function can be seen (informally) to not exist when k = 2. In this case the

Mathematics of apportionment (5,366 words) [view diff] exact match in snippet view article find links to article

method they use for rounding. A divisor method is parametrized by a divisor function d ( k ) {\displaystyle d(k)} which specifies, for each integer k ≥

Highest averages method (4,070 words) [view diff] exact match in snippet view article find links to article

that has the most votes per seat before the new seat is added. The divisor function is post(k) = k, which is equivalent to always rounding up. Adams' apportionment

Rank-index method (967 words) [view diff] exact match in snippet view article find links to article

methods are a special case of rank-index methods: a divisor method with divisor function d ( a ) {\displaystyle d(a)} is equivalent to a rank-index method with