Search results
Jump to navigation
Jump to search
Page title matches
- The '''integers''' ([[Latin]] word ''integer'' means "untouched") are the [[natural number]]s ([[1 (number)|1]], [[2 (nu ...d]] of [[rational number]]s, from other "integers" such as the [[algebraic integer]]s.10 KB (1,566 words) - 08:34, 2 March 2024
- 242 bytes (31 words) - 08:58, 8 December 2008
- 12 bytes (1 word) - 19:33, 3 November 2007
- 141 bytes (13 words) - 13:12, 13 June 2008
- 108 bytes (16 words) - 13:07, 14 June 2008
- * [http://www.research.att.com/~njas/sequences/ On-Line Encyclopedia of Integer Sequences] cf [[OEIS]]224 bytes (29 words) - 08:56, 8 December 2008
- Auto-populated based on [[Special:WhatLinksHere/Integer]]. Needs checking by a human.2 KB (247 words) - 17:28, 11 January 2010
Page text matches
- The product of an integer with another integer.84 bytes (11 words) - 10:06, 4 September 2009
- #REDIRECT[[integer]]20 bytes (2 words) - 21:02, 7 August 2007
- The smallest integer which is divided evenly by all given numbers.103 bytes (14 words) - 07:56, 29 June 2009
- ...'d''(''n'') or τ(''n'') or σ<sub>0</sub>(''n''), is the number of positive integer [[divisor]]s of the number ''n''. The value of ''d'' on a general integer ''n'' with prime factorisation720 bytes (123 words) - 04:26, 1 November 2013
- {{r|unit (algebraic integer)}} {{r|Gaussian integer}}887 bytes (126 words) - 02:29, 22 December 2008
- ...lic key]] encryption algorithm whose strength depends on the difficulty of integer factorisation.152 bytes (19 words) - 18:53, 29 July 2010
- ...'multiple''' of an [[integer]] is the product of that integer with another integer. For instance, 6 is a multiple of 2, since 6=2x3. Similarly, -6 is a mult924 bytes (151 words) - 22:50, 31 March 2008
- ...nent (group theory)|exponent]] of the [[multiplicative group]] modulo that integer. The value of λ on a general integer ''n'' with prime factorisation796 bytes (127 words) - 15:10, 2 December 2008
- Every positive integer can be expressed as a product of prime numbers in essentially only one way.134 bytes (20 words) - 15:55, 20 May 2008
- The number of additive partitions of a positive integer.92 bytes (12 words) - 16:28, 13 December 2008
- The exponent of the multiplicative group modulo an integer.95 bytes (12 words) - 17:59, 21 November 2008
- The number of integers less than or equal to and coprime to a given integer.112 bytes (18 words) - 17:47, 29 October 2008
- Holomorphic function characterized in that at integer values of its argument it can be interpreted as iterated exponent.156 bytes (21 words) - 14:27, 8 March 2009
- * [http://www.research.att.com/~njas/sequences/ On-Line Encyclopedia of Integer Sequences] cf [[OEIS]]224 bytes (29 words) - 08:56, 8 December 2008
- A function defined on the set of positive integers, usually with integer, real or complex values, studied in number theory.159 bytes (23 words) - 15:51, 2 December 2008
- ...uccessive positive integers raised to powers of a variable, typically with integer, real or complex coefficients.189 bytes (25 words) - 16:55, 4 December 2008
- A number which is the residue of a square integer with respect to a given modulus.118 bytes (19 words) - 02:28, 28 October 2008
- Probable prime (an integer which shares a property common to all prime numbers) which is not actually145 bytes (21 words) - 11:15, 4 September 2009
- A digital [[circuit]] that performs integer [[addition]] in the [[Arithmetic Logic Unit]] in a [[computer]].144 bytes (18 words) - 14:17, 8 December 2008
- ...mber which is not algebraic: that is, does not satisfy any polynomial with integer or rational coefficients.148 bytes (21 words) - 15:21, 31 October 2008
- The number of positive integer divisors of a given number.94 bytes (13 words) - 16:56, 6 December 2008
- ...tion an + bn = cn has no solutions in positive integers a, b, c if n is an integer greater than 2.156 bytes (26 words) - 07:18, 4 September 2009
- A real number and is the integer between 1 and -1, which signifies a value of nothing.122 bytes (19 words) - 02:51, 3 June 2008
- ...nction whose value is the sum of all positive divisors of a given positive integer.125 bytes (19 words) - 13:14, 5 December 2008
- ...maximize a real function by systematically choosing the values of real or integer variables from within an allowed set.206 bytes (31 words) - 10:34, 4 September 2009
- The assignment of data types (such as integer or string) to variables at the time of execution of a computer program, rat196 bytes (30 words) - 00:23, 2 October 2009
- ...uations and the theory of distributions, by generalising the concept of an integer index to a vector of indices.237 bytes (32 words) - 10:04, 4 September 2009
- ...f 27 data types with tag values starting with 1; for example, Boolean (1), integer (2), and bit string (3).224 bytes (27 words) - 03:37, 14 March 2024
- * [http://branchandcut.org/ COIN-OR SYMPHONY] - integer programming software, [[Common Public License]] *[[MINTO]] - integer programming solver using branch and bound algorithm. Freeware for personal2 KB (239 words) - 06:44, 20 March 2008
- ...rder''' of a [[group (mathematics)|group]] element is the least positive [[integer]] (if one exists) such that raising the element to that power gives the [[i The '''exponent''' of a group is the least positive [[integer]] (if one exists) such that raising any element of the group to that power857 bytes (146 words) - 13:24, 1 February 2009
- ...number]] ''p'' is a [[divisor]] of the [[multiplication|product]] of two [[integer]]s, ''ab'', then either ''p'' is a divisor of ''a'' or ''p'' is a divisor o ...and ''q'' are [[relatively prime]] integers and that ''p''|''kq'' for some integer ''k''. Then ''p''|''k''.2 KB (322 words) - 12:51, 18 December 2007
- For a group, its cardinality; for an element of a group, the least positive integer (if one exists) such that raising the element to that power gives the ident199 bytes (32 words) - 17:17, 20 November 2008
- ...ely prime in pairs and if b1, b2, …, bn are integers, then there exists an integer that is congruent to bi modulo mi for i=1,2, …, n.230 bytes (38 words) - 06:25, 4 September 2009
- An adder is a [[digital circuit]] designed to perform [[integer]] [[addition]] in the Arithmetic Logic Unit on board a computer. These circ *Where ''n'' is an integer from zero to (base - 1)2 KB (368 words) - 05:19, 17 March 2024
- ...tional relation between a part and the whole consisting of a numerator (an integer — the part) and a denominator (a natural number — the whole).217 bytes (33 words) - 08:31, 2 June 2008
- .../math> and <math>x</math> and <math>y</math> represent the smallest such [[integer|integers]] (i.e., they are [[mutually prime]]). ...; therefore <math>x</math> must also be even. This means that there is an integer <math>k</math> such that <math>x = 2 \times k</math>. Inserting it back int2 KB (307 words) - 04:13, 14 October 2010
- ...ometry]] a '''divisor''' on an [[algebraic variety]] is a formal sum (with integer coefficients) of [[subvariety|subvarieties]]. An '''effective divisor''' is a sum with non-negative integer coefficients.818 bytes (138 words) - 10:54, 18 February 2009
- ...ion with parameter ''n'' assigns probability proportional to 1/''r'' to an integer ''r'' ≤ ''n'' and zero otherwise, with [[normalization]] factor ''H''<su ...nd ''s'' assigns probability proportional to 1/''r''<sup>''s''</sup> to an integer ''r'' ≤ ''n'' and zero otherwise, with normalization factor <math>\sum_{1 KB (168 words) - 16:41, 6 February 2009
- ...roper divisor''. The number 0 is not considered to be a divisor of ''any'' integer. :5 divides 0 because <math>5 \cdot 0 = 0</math>. In fact, every integer except zero divides zero.4 KB (594 words) - 02:37, 16 May 2009
- In [[number theory]] the '''sum-of-divisors function''' of a positive integer, denoted σ(''n''), is the sum of all the positive [[divisor]]s of the numb The value of σ on a general integer ''n'' with prime factorisation1 KB (172 words) - 04:53, 1 November 2013
- ...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 particula3 KB (488 words) - 10:34, 13 November 2007
- ...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, +, -, <)</ma2 KB (348 words) - 16:37, 10 March 2009
- ...]. The ''n''-th cyclotomic polynomial, denoted by Φ<sub>''n''</sub> has [[integer]] cofficients. For a positive integer ''n'', let ζ be a primitive ''n''-th root of unity: then1 KB (206 words) - 14:55, 11 December 2008
- ...is a function defined on the set of [[positive integer]]s, usually with [[integer]], [[real number|real]] or [[complex number|complex]] values.1 KB (159 words) - 06:03, 15 June 2009
- 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 identity2 KB (325 words) - 06:31, 15 September 2009
- {{r|integer factorisation}}259 bytes (33 words) - 18:53, 29 July 2010
- ...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 modulo2 KB (335 words) - 06:03, 15 June 2009
- {{r|Integer factorization}}307 bytes (40 words) - 11:59, 15 June 2009
- ...ber: ''a + 0 = 0 + a = a''. For any integer ''a'', ''(a + 1)'' means least integer greater than ''a'', also known as successor of ''a''.1 KB (163 words) - 02:33, 30 October 2008
- {{r|integer}}207 bytes (26 words) - 19:20, 23 June 2009