Search results

...ted with, all logarithms notably absent. If <math>z = n</math>, a positive integer, all but finitely many terms in the series cancel and we are left with ...ction as <math>\Gamma'(z) = \Gamma(z) \psi(z)</math>; the derivative at an integer is then <math>\Gamma'(n) = (H_{n-1} - \gamma)(n-1)!</math> and in particula

...th>+</math> (addition), the unary function <math>-</math> (which maps each integer to its [[inverse]]), and the binary relation <math><</math>. This structure ...<math>f\colon \mathbb Z\rightarrow\mathbb Z</math> which multiplies every integer by 2 is a homomorphism from the structure <math>(\mathbb Z, 0, +, -, <)</ma

...]. The ''n''-th cyclotomic polynomial, denoted by Φ_''n'' has [[integer]] cofficients. For a positive integer ''n'', let ζ be a primitive ''n''-th root of unity: then

...is a function defined on the set of [[positive integer]]s, usually with [[integer]], [[real number|real]] or [[complex number|complex]] values.

Given any positive integer ''n'' we can define functions ''f'' and ''F'' as follows: ...mial function each of whose coefficients is 1/n<nowiki>!</nowiki> times an integer. It satisfies the identity

{{r|integer factorisation}}

...n the [[multiplicative group]] taken [[modular arithmetic|modulo]] a given integer. Let ''N'' be a positive integer and write ('''Z'''/''N'')* for the multiplicative group of integers modulo

{{r|Integer factorization}}

...ber: ''a + 0 = 0 + a = a''. For any integer ''a'', ''(a + 1)'' means least integer greater than ''a'', also known as successor of ''a''.

{{r|integer}}

In the program, we create an instance of the class integer. ...cally, the traditional class relationship is held in the class diagram. An integer is a Real. A Real(float) is a (subset of) complex. An a complex number is a

...partition of a set or an ordered partition of a set, or a partition of an integer, or a partition of an interval.

{{r|Gaussian integer}}

{{r|Integer}}

...s thus [[group isomorphism|isomorphic]] to the [[additive group]] of the [[integer]]s, or to an additive group with respect to a fixed [[modular arithmetic|mo

In many languages, the 5 literal will represent an integer. It will be automatically cast into a string '5' and appended to the prior ...would be equal to the integer it is being compared with. Similarly, if the integer had been converted into a string, it would be equal to the string it is bei

Any efficient solution to the [[integer factorisation]] problem would break RSA; see the [[RSA algorithm#RSA_and_fa ...to speed up the sieving step in the [[number field sieve]] technique for [[integer factorisation]].

{{r|Integer}}

...range of [[holomorphism]] of function, but out of holomorphism of some its integer [[iterate]]

{{r|Integer}}