Redirect to:
This talk page is a redirect. The following categories are used to track and monitor this redirect:
|
Integer-is colloquially defined as a number that can be written without fractional (component for example ,21,04,0and-2048 are integers 41.116.100.253...
Click to read more »sequence; integer sequences should be reserved for sequences whose terms are integers. --AxelBoldt Integer sequences ARE sequences whose terms are integers. (see...
Click to read more »Eisenstein integer is always an ordinary (rational) integer." Isn't every integer already rational? Obscurans 17:43, 12 May 2007 (UTC) "Rational integer" is...
Click to read more »Can "-13/2" really be a half-integer, insomuch as integers are positive numbers? Perhaps someone smarter than me can address that edit? --TheEditrix2...
Click to read more »Integer arithmetics are frequently used in computer programs on all types of systems, since floating-point operations may incur higher overhead (depending...
Click to read more »definition of algebraic integer as defined in the article does not satisfy many desirable properties of integers, i.e. that: Algebraic integers defined for arbitrarily...
Click to read more »transposable integers and cyclic numbers look very similar. The article states, "These specific integers, known as transposable integers, can be but are...
Click to read more »sources I've seen only state the Fundamental Theorem of Arithmetic for integers strictly greater than 1. Of course, I understand the argument about 1 being...
Click to read more »an integer. The predecessor of an integer z, p(z), is also an integer. The successor of the predecessor of an integer z, s(p(z)), is the same integer, z...
Click to read more »User:TakuyaMurata, integer or integral, that is the question. I believe that it should be integer: as the solutions should be integer numbers. Integral...
Click to read more »that there is no real justification in having both Heronian triangle and Integer triangle as separate articles. the two concepts are essentially the same...
Click to read more »Programming, not Integer. I would recommend removing this banner. StitchProgramming (talk) 14:02, 8 July 2011 (UTC) The German page is on integer linear programming...
Click to read more »Maybe this should really be Square-free integer? -- Walt Pohl 01:40, 2 March 2004 (UTC) The separable polynomial page does use the term more generally...
Click to read more »homed integer pops up in the VisualC++ header files in reference to the DEC Alpha. Anybody know what that's about? Hackwrench 21:08, 5 November 2005 (UTC)...
Click to read more »Hello fellow Wikipedians, I have just modified one external link on Integer triangle. Please take a moment to review my edit. If you have any questions...
Click to read more »May I query this: "A Gaussian integer is a complex number whose real and imaginary part are both integers." That can't be right. The imaginary part is...
Click to read more »is more common, natural and useful to round up in the event of a half-integer. 137.205.139.149 22:46, 13 January 2007 (UTC) Agreed. In fortran 95 the...
Click to read more »Sloane's request, a few sequences from PrimeFan's Listing of Esoteric Integer Sequences, which I'm not counting in this total. User:Robert Happelberg...
Click to read more »(UTC) Hello fellow Wikipedians, I have just modified one external link on Integer BASIC. Please take a moment to review my edit. If you have any questions...
Click to read more »The norm of a Gaussian integer is the natural number defined as N(a + bi) = a2 + b2. According to MathWorld, this definition should be deprecated. Any...
Click to read more »computers? I would interpret this as meaning that a deeper understanding of integer factorization would lead to a deeper understanding of complexity theory...
Click to read more »pages (e.g. Integer (computer science)) --HappyDog 23:29, 28 Oct 2004 (UTC) Microsoft SQL Server 2000 has the following sizes of integer data types: bigint...
Click to read more »beauty of Newton's Iteration for finding the integer square root of a number n is that it can use solely integers," and was wondering what you thought about...
Click to read more »and .... Does this sentence mean that no one considered this encoding of integers (in a verifiable way) before the standard MIDI file format was defined...
Click to read more »SIAM news dropped the ball in their description of integer relation finding in "Top Ten Algorithms of the Century". They give the credit to 1977/1979...
Click to read more »that β > 1 and that the coefficients in the expansion are nonnegative integers less than β. It would be very difficult to structure a coherent article...
Click to read more »terminology here, so I'm not making any editions, but why is this called "Integer Complexity"? Surely it should be called "Natural Number Complexity", and...
Click to read more »aweful lot by turning this into something that makes sense. The range of integer values stored in 2 bytes is always the same (2^16), and you're right that...
Click to read more »This review is transcluded from Talk:Integer sorting/GA1. The edit link for this section can be used to add comments to the review. Reviewer: KSFT (talk...
Click to read more »basis sets are simply cosets of subgroups of the integers" be used to justify that "The evenly spaced integer topology is the coarsest topology that includes...
Click to read more »12 July 2020 (UTC) List of OEIS sequences → List of integer sequences – Entries here are integer sequences and are included because of that (and existing...
Click to read more »coefficients. Doing a google scholar search not only seems to confirm that "integer valued polynomial" is more common, as in this title, it also returns this...
Click to read more »I don't see any integer programming article (how to merge it) ? It's part of Linear programming. In fact, there is already a paragraph in that article...
Click to read more »three integers have a common divisor greater than 1. Example: 4, 6, 8; 4, 6, and 8 are all divisible by 2. 2. Exactly one pair of the three integers have...
Click to read more »fellow Wikipedians, I have just modified 2 external links on Artocarpus integer. Please take a moment to review my edit. If you have any questions, or...
Click to read more »extensions reads as follows: "If d {\displaystyle d} is a square-free integer and K = Q ( d ) {\displaystyle K=\mathbb {Q} ({\sqrt {d}})} is the corresponding...
Click to read more »Which "Blum" are Blum Integers named after? Meekohi 15:49, 6 November 2005 (UTC) Manuel Blum, I believe. I should track down the relevant paper. If I remember...
Click to read more »more accurate to say that "God made the whole numbers...", and not the integers? — Preceding unsigned comment added by 24.16.199.186 (talk) 21:36, 6 February...
Click to read more »Factoring Integers by SVP Algorithms, corrected (Schnorr) which appeared to be an preprint that never got published and Factoring integers with sublinear...
Click to read more »should cover only the sense in abstract algebra (possibly restricted to integers), with a hatnote with a redirect to the other sense. To get rid of the...
Click to read more »±1 is coprime to every integer, including zero. -- EJ 13:46, 8 October 2007 (UTC) The statement about probability of two integers being coprime is fairly...
Click to read more »"The table might have been further reduced to the integers in the first octant of the complex plane using the symmetry y + ix =i (x − iy)." That symmetry...
Click to read more »This page and Table of Gaussian integer factorizations cover the exact same topic in a slightly different way, although this one includes some more details...
Click to read more »is: Does a multiple of an integer have to be the product with the and an integer, a natural number, or non-negative integers? —Preceding unsigned comment...
Click to read more »number is an integer and that every integer is a whole number. Explain the error.Smcnell 03:40, 23 February 2006 (UTC) "Because -1 is an integer but not a...
Click to read more »question: how do you use the division algorithm to find the GCD of two integers? I know Euclid's Theorem, but it is different, right? joaoferreira The...
Click to read more »had not done integer division correctly. Jc3s5h (talk) 05:05, 29 December 2024 (UTC) Is there a formula that doesn't depend on integer division? Maybe...
Click to read more »does not exclude 1,2,2,4,... except for the claim that 3 is the unique integer that satisfies the conditions. See the comment in oeis:A001462 for the...
Click to read more »to Gaussian integers: a number is the sum of two squares a 2 + b 2 {\displaystyle a^{2}+b^{2}} iff it is the norm of some Gaussian integer a + b i {\displaystyle...
Click to read more »integers” is redundant. Thx-Singer ArtfulSinger95 (talk) 17:39, 7 September 2022 (UTC) "Ratioal integer" is correct and less ambiguous than "integer"...
Click to read more »Favonian (talk) 18:37, 30 April 2026 (UTC) Evil number → Even-parity integer – The current title "Evil number" is an inappropriate and unprofessional...
Click to read more »April 2007 (UTC) You can't use the ring homomorphism from the integers to the integers mod n to show that the multiplication in the latter system is associative...
Click to read more »should be avoided". Here "positive integer" is a (mathematical) specialized terminology, as "positive" and "integer" are taught to kids a long time after...
Click to read more »August 2006 (UTC) I think it makes no sense to put "result must be an integer" in the post-condition. It is not dynamically testable by an assertion...
Click to read more »requiring integer matrices: "Integer and Combinatorial Optimization", Geroge L. Nemhauser, Laurence A. Wolsey, 1988, page 189 "Theory of Linear and Integer Programming"...
Click to read more »that are too low in an integer variable (e.g., attempting to store −1 in an unsigned integer) is properly referred to as integer overflow[citation needed]...
Click to read more »named after David P. Robbins, is a cyclic polygon with five integer sides and integer area. It also has the property that all its diagonals are rational...
Click to read more »integer problems. With slight editing, it could easily embrace rational relaxations of integer programs, as in "Dantzig's 2-stage method of integer programming":...
Click to read more »What about 1/6+1/12=1/4? This solution is not generated by integer m and n, but rather by Sqrt[2] and 2 Sqrt[2]. Posted 13 Sept. 2015 This was fixed on...
Click to read more »(class field theory?) Put in another way the non-abelian-ness of profinite integers are hidden in the commutator subgroup of G (this stuff is beyond me). --...
Click to read more »a_{n}=A^{n}-B^{n}} a_n = A^n - B^n for integers {\displaystyle A>B>0} A>B>0 is a divisibility sequence." does it have to have integer A and B? The Fibonacci and other...
Click to read more »2019 (UTC) Rounding is to the nearest integer—not necessarily to the nearest greater integer or nearest least integer. For example, 1.4 rounded is 1, the...
Click to read more »specific type of binary quadratic form, namely, one whose coefficients are integers. I just went through all the links at the "what links here" page and found...
Click to read more »to solve than integer factorization, so the assumption that this problem is hard to solve is stronger than the assumption that integer factorization is...
Click to read more »{Q} ^{2}} and the statement That is, we may take d to be a square free integer don't match up; the equation makes d a non-zero square free rational, that...
Click to read more »previous articles on 16:03, 4 May 2006 (UTC). Their talk pages are Talk:Integer partition and Talk:Partition function (number theory). Hi, does anybody...
Click to read more »Matthias; Robins, Sinai (2007), Computing the Continuous Discretely, Integer-point enumeration in polyhedra, Undergraduate Texts in Mathematics, New...
Click to read more »conjecture, also called Lawson's Conjecture, states for every positive integer I greater than 3 there exists a minimum of one pair of prime numbers a...
Click to read more »Approximately: pretend r is a signed integer with the same bit pattern, negate that number, then the result is the unsigned integer with the same bit pattern. In...
Click to read more »arbitrary integer x by a positive integer y, the quotient is always q=floor(x/y) so that the remainder x-qy lies in the range [0,y-1]. Python integer division...
Click to read more »group of integers modulo n," I believe the zero should be included in the set { 0 , 1 , … , n − 1 } {\displaystyle \{0,1,\dots ,n-1\}} of n integers from...
Click to read more »Why is this limited to integers? What about Pythagorean triples such as 1:1:sqrt(2) or 1:sqrt(3):2? 62.0.181.212 20:09, 4 July 2002 (UTC) Probably because...
Click to read more »restriction to positive integers. Is this restriction necessary to maintain on Wikipedia? That definition uses the phrase "least integer" - I'd contend that...
Click to read more »are given only for integers. A definition for Gaussian integers is given in section "Generalization". In fact, Gaussian integers form a unique factorization...
Click to read more »that this constant cannot be expressed as a/b with a and b being positive integers? Kwékwlos (talk) 21:49, 19 June 2023 (UTC) It does say in "http://www.bdim...
Click to read more »clearer to nonexperts, and added more references. The page mentioned "integer valued integral quadratic forms". How are they different from integral...
Click to read more »August 2017 (UTC) About all integer primes and composites. Except for some low integers, they together include all integers. (if I'm not too dizzy) EditorÆ...
Click to read more »(UTC)weavehole m is any positive integer (whole number) that is less than n. The definition says that a positive integer n is superabundant if the ratio...
Click to read more »negative integer in two's complement format with positive integer. Or negative integer in two's complement format must be converted to positive integer, added...
Click to read more »said: In combinatorics, Schur's theorem states that any sufficently large integer can be obtained from a linear combination of a fixed set of relatively...
Click to read more »my original reference to Integer Linear Programming was more appropriate, because Hilbert bases are so specific to integer programming, but currently...
Click to read more »are the set of integers and the set of non-integer fractions. The members which make the set of integers are the set of negative integers and the set of...
Click to read more »positive-integer factor of every positive integer? Betrothed Numbers can be defined with reference to sums that exclude BOTH of the "obvious" positive-integer...
Click to read more »constrain a and n to be integers. Rather, the evaluation of a mod n in computers is carried out such that quotient q is an integer and remainder r is allowed...
Click to read more »non-zero constant sequences are harmonic sequences and constant integer sequences sum to integers. I think it should say finite harmonic series of distinct...
Click to read more »defined as rational triples, the convention has been to define them as integer triples, which has the advantage of being more elementary and therefore...
Click to read more »result into an integer literal. What is the meaning of the phrase 'integer literal' here? I have always understood the term to mean an integer that is in...
Click to read more »fundamental to it. "an integer which is the square of some other integer, i.e. can be written in the form n2 for some integer n (and because of this a...
Click to read more »arithmetic, allowing it to factor integers of any length, not limited by the machine's native integer type. The “integers of any length” claim is probably...
Click to read more »integer: %d", &d); printf("entered integer: %d\n", d); return 0; } gives $ ./a.out 10 entered integer: 0 $ ./a.out enter integer: 10 entered integer:...
Click to read more »perfectly legitimate 'base by' notation, which does support fractional integers. Binary-coded decimal is an example. In the case of us money, one would...
Click to read more »sizes using integers? A very short google showed articles at mathworld, but no mention of integers ... maybe I'm imagining the bit about integers?? linas...
Click to read more »"an integer type"; size_t is specified as being "an unsigned integer type" and ssize_t and some other types are specified as being "signed integer types"...
Click to read more »even crashes the program because of integer overflow. You cannot use unsigned integer algorithms on signed integers without knowing what's going on. The...
Click to read more »2017 (UTC) Would be interesting to see cases d=2 and d=3 for first ~20 integers, and see their coefficients, similar to what most other pages about numbering...
Click to read more »If a number is not the root of any polynomial with integer and rational coefficients, but is the root of a number with irrational coefficients (say the...
Click to read more »equivalent with having half-integer spin. But if a particle were found to violate that theorem, say a particle with integer spin and antisymmetric wavefunction...
Click to read more »Because data (specifically integers) and the addresses of data are stored using the same hardware, and the data is stored in one or more octets (23), double...
Click to read more »p-1 (for any prime greater than 3) is an even integer, it will always have divisors: 1,2, some integer k,itself, and maybe more. so since (p-1)+1+2 >...
Click to read more »is any positive integer having M digits, there exists a positive integer N such that the first M digits of N! constitute the integer A." However, I haven't...
Click to read more »_{i=1}^{k}{\frac {1}{1-x^{i}}}.} More generally, if T is a set of positive integers then the number of partitions of n, all of whose parts belong to T, has...
Click to read more »"mixed integer programming" no longer describes what it is. It redirects to Linear programming. --Mortense (talk) 15:40, 8 April 2022 (UTC) Integer programming...
Click to read more »prime number, 4 is the first whole number that is the square of another integer, 5 is significant in Biology (many vertebrates have some version or form...
Click to read more »... and all other critical values are integers greater than or equal to 4π. Or equal to? Could "integer multiples of 4π" perhaps be intended? —Tamfang...
Click to read more »positive integer, two integers a and b are called congruent modulo n if a − b is divisible by n." I think that there is no need to a and b to be a integers. Definition...
Click to read more »history ) ... that any tetrahedron that has integer edge lengths, face areas, and volume can be given integer vertex coordinates? Source: [1] Reviewed:...
Click to read more »September 2005 (UTC) When proving the converse you are using that there is no integer between n and n+1. The problem is that the standard proof of this use well-ordering...
Click to read more »definition of a whole number. Whole number is an integer, which includes 0, all positive and all negative integers. Any decent book on math defines whole numbers...
Click to read more »of the integers between 1 and 200, then there are two among them, such that one divides the other. (Recall that the integer a divides the integer b, if...
Click to read more »optimization over more powerful mathematical programming models, usually integer programming models. While they acknowledge that the use of heuristics,...
Click to read more »output all the primes, using 26 integer variables, of 1976 (p199-200 GB 2003 edition) seem to be: (K+2) [an integer] multiplied by [opening curly bracket]...
Click to read more »output: an array of integers, P (positions in S at which W is found) an integer, nP (number of positions) define variables: an integer, m ← 0 (the beginning...
Click to read more »properly. --Cubbi 20:37, 4 July 2007 (UTC) "whereas particles of half-integer spin (fermions) can be described only by spinor fields." is this strictly...
Click to read more »talking about integer division, granted, but integer division is faster and easier than floating point division, which itself is based on integer operations...
Click to read more »Integer+ 1/(prime number) is not integer. Here's you know that atleast one new prime number in between m and 2m. In between m and 2m is not any number...
Click to read more »set, an obvious example being the integers modulo N, for not-extremely-large N. --Will Sure, and a one-bit integer is "infinite precision" in your sense...
Click to read more »integer number...", but then proceeds to show "Unix time" values (like in the tables below) that are not integers. I realize a time_t is an integer,...
Click to read more »about bases refers to integers only. Now, when I think about it, we don't really use bases for any numbers apart from integers, do we? I mean, most multi-base...
Click to read more »implementation of BCD, but doesn't quite explain it. x87 converts external BCD integers to internal floating point values in its internal 64 bit significant format...
Click to read more »some integer n such that rn is the identity, and we have a finite dihedral group of order 2n." Should it not say "there is some *least* integer n"? This...
Click to read more »are integer, overall division ratio is integer as well and hence low resolution due to prescaler M·fref may be made fref only. Hence a basic integer-N resolution...
Click to read more »representation of integers, but you're right that a note somewhere about how fixed-point fractions and floating-point mantissas use these integers with a power-of-two...
Click to read more »a float? I've only ever seen integers. One of our references claims it's an integer, and it makes sense to use an integer if the units are resolution units...
Click to read more »same directions( straigt line, Fig 7b), and the winding number can be an integer plus a half. However,the winding number was called the turn number in this...
Click to read more »Removed "replacing integer division by a constant with reciprocal multiplication". Since when is dividing by 3 faster than converting to floating-point...
Click to read more »words RR^{-1} = kN + 1 where k is a positive integer. " Does k have to be a positive integer? or just an integer? - either positive or negative? I mean it...
Click to read more »91.91 (talk • contribs) Wouldn't it be simpler to say 'the smallest positive integer that can be written as the sum of two integer cubes in n ways'?...
Click to read more »\left({\frac {a}{n}}\right)^{k}} , where a is integer, k is nonnegative integer, n is positive integer. ( a m n ) {\displaystyle \left({\frac {a}{mn}}\right)}...
Click to read more »epsilon = 1.0/(10**12) integer_value=0 while X < 1: integer_value = integer_value - 1 X = X * 2 while X >= 2: integer_value = integer_value + 1 X = X / 2...
Click to read more »are superscalar in nature -- they can issue two instructions into the integer execution units every cycle. See, for example, Figure 9 in the whitepaper...
Click to read more »following identities hold, provided that the base is non-zero whenever the integer exponent is not positive: ( b m ) n = b m ∗ n {\displaystyle (b^{m})^{n}=b^{m*n}}...
Click to read more »function#Properties. When you generalize from integers to reals, it may be the case that part of a formula that vanish for integers becomes visible for reals. So although...
Click to read more »in that equation! h(x) is an integer, so h(x)+1 is an integer, and we can multiply the rational number y by the integer h(x)+1. What is abusive about...
Click to read more »a Somos sequence is an integer, but nevertheless many Somos sequences have the property that all of their members are integers. The phrase "It is not...
Click to read more »be represented as a number, would this number be an integer or a decimal? I would hope an integer, but I can't say for sure because the "." has no explanation...
Click to read more »equation over the positive rationals. But I've changed "naturals" to "integers" in the article. Ben Standeven 05:14, 7 April 2007 (UTC) It didn't work...
Click to read more »it stands is seemingly self-contradictory: the ratios whose integers, including integer multiples of the limit, are lower are generally more consonant...
Click to read more »the actual value of the integer. HoCkster As a further note, Integers Overload, Atoms Approximate. Integers handle exact integer values NOT up until 32...
Click to read more »up to an integer (integer-irrational=irrational). It does make sense that one non-integer squares requires more (all?), to add up to an integer in both...
Click to read more »as integers" has, in my interpretation, two problems. The first is the obvious one: that it appears to try to draw a distinction between the integers as...
Click to read more »00:18, 8 August 2011 (UTC) x must be an integer Given the fact that a,b,n are integers do not assume x is an integer,such assumption need to be mentioned...
Click to read more »would have (1 + INT_MAX) + 5 = 1 + (INT_MAX + 5) = INT_MIN + 5 Saturating integer arithmetic, floating point arithmetic, and exceptions-on-overflow are non-associative...
Click to read more »final expression is an integer and the second term in the right hand side is an integer, so the first term better be an integer. This better be because...
Click to read more »within the 32 bit integer range. Somewhere along the way, the program's author had jammed rather than properly cast a 32 bit integer input into a type...
Click to read more »The Statistics graphs look strange with y-axis labels at half integer values : 2.5, 7.5, 12.5 - Could it be changed to nx2 or nx3 ? - - Can horizontal...
Click to read more »not 1772. I don't like the phrasing of this theorem: "Every positive integer is a sum of at most n n-polygonal numbers". Clearly 4 = 1 + 1 + 1 + 1 is...
Click to read more »for the integers modulo p is used only when no confusion is possible with p-adic integers, in particular at elementaty level where p-adic integers are unknown...
Click to read more »be integers (or perhaps natural numbers). The word "number" by itself is ambiguous. For example, there is also the problem of expressing integers as sums...
Click to read more »number of the form a − b {\displaystyle a-b\,} where for some positive integer n, ( a b ) n {\displaystyle \left({\frac {a}{b}}\right)^{n}} is rational...
Click to read more »current : integer method deposit_savings(amount : integer) deposit_current(-amount) deposit_savings(amount) method deposit_current(amount : integer) current :=...
Click to read more »Why ? If your arithmetic function is integer valued (and most "interesting" arithmetic functions have integer values), then its Bell series must be either...
Click to read more »series resonant circuit and to be open at βl =π (and integer multiples) and short at βl =π/2 (and integer multiples). On my side, I would have insisted on...
Click to read more »a long time ago. For quadratic integers, this is reported in Quadratic integer#Euclidean rings of quadratic integers. My opinion is that these results...
Click to read more »atmosphere interrupted continuity of the drawn line. The cosmology of the integers, as well as the forms of hands, are all formed in an atmosphere that is...
Click to read more »describe it for integer values of r. And I do not think that it is worthwhile including an induction proof, which only gives the result for integer values of...
Click to read more »more rarely) a polynomial with integer coefficients (which MathWorld calls an integer polynomial, although our integer polynomial redirects to polynomial...
Click to read more »scope of a type checker, including division by zero, array out of bounds, integer overflow and null dereferences." This is not strictly true. With subtypes...
Click to read more »Gardner.' Phyrion (talk) 09:31, 30 June 2025 (UTC) The redirect The largest integer that has an entry on Wikipedia has been listed at redirects for discussion...
Click to read more »exclusion principle: observations of exclusion imply half-integer spin, and observations of half-integer spin imply exclusion" HilmarHansWerner (talk) 11:29...
Click to read more »as the base case in the Euclidean algorithm. 5) If m is a non-negative integer, then gcd(m⋅a, m⋅b) = m⋅gcd(a, b). Darcourse (talk) 10:20, 21 February...
Click to read more »instead), if "integer + decimal exponent" was used for storage. Alternatively, maybe it was a rational value (fraction, integer numerator + integer denominator)...
Click to read more »section into Given a nonnegative integer n, two integers a and b are said to be congruent modulo n, if there is an integer k such that a ≡ b (mod n). This...
Click to read more »non-negative integers, and multiply it by a non-integer scalar, the resulting distribution will not be supported by the non-negative integers. But there...
Click to read more »for integers a, b, c, d, so it can be expressed as (ad + bc i)/bd. This can then be expressed in "lowest terms" by canceling any common integer factor...
Click to read more »one non-integer edge (currently referred to as the "angle-based special right triangles) Right triangles with one integer edge and two non-integer edges...
Click to read more »magic numbers, they are fundamental. The article Integer (computer science), to which Integer typeInteger type redirects, has them, but only in decimal (and...
Click to read more »or view Article history ) ... that Otis Barrett introduced Artocarpus integer, claimed to be superior to jackfruit, to Puerto Rico? "Artocarpus polyphemia...
Click to read more »data type of integer: class Individual{ //normally DifrentialEvolution uses floating point variables var float data1,data2 //but using integers is possible...
Click to read more »in graphene isn't half-integer, as in fractional (interacting electrons with non-integer eff. charge), but the good old integer QHE with plateaus shifted...
Click to read more »of holding integer values precisely. Inaccurate. What is true is that a floating-point representation of n bits can never hold all integer values of n...
Click to read more »Integers and Floats. Array.newInstance() using my first element of my list (which an instance of class Number) I end up with an array of type Integer[]...
Click to read more »value is the "music set theory" paragraph adding. My understanding is that integer notation is not specific to "music set theory", but common to atonal music...
Click to read more »For example, the integers are integrally closed in their fraction field (the rationals) but not every monic polynomial with integer coefficients has all...
Click to read more »In integer matrix computations, it may not be possible to all the leading coeff's one - one cannot divide columns by arbitrary integers and keep the matrix...
Click to read more »23:30 Jan 16, 2003 (UTC) It was rather ridiculous that [[Even]], [[Even integer]], and [[Even number]] all redirected to [[Odd number]]. So, I've expanded...
Click to read more »Topkapi Museum, Istanbul.Cite error: The <ref> tag name cannot be a simple integer (see the help page). References Casale, Sinem Arcak (2023). Gifts in the...
Click to read more »cited in the AMS conference, included in Neil Sloane's Encyclopedia of Integers, in Hadronic Journal, and cited in SLAC SPIRES and INSPIRE sites, etc.:...
Click to read more »However, while his proof is more standard, it only applies for r a positive integer, whereas my proof can be extended to the whole complex plane. Essentially...
Click to read more »why: S: Number of solved murders (is a positive integer) T: Total number of murders (is a positive integer) Taking rounding into account: S/T >= 0.5155 &...
Click to read more »the same size and contain values that represent almost anything, such as integers, machine addresses, truth values, characters, etc. BCPL has typeless variables...
Click to read more »where k is a non-negative integer and ai is an integer in [0,9]. As it is I think you might be assuming that a non-negative integer looks a certain way. —Preceding...
Click to read more »identities and properties shown above for integer exponents are true for positive real numbers with non-integer exponents as well. which then allows one...
Click to read more »Should the definition restrict the term to integers only, or is it meaningful to include rational numbers such as 0.5 or 0.6? Depending on the radix of...
Click to read more »incorrect to say that p-adic valuations are only defined for non-zero integers. The article itself clearly and correctly says otherwise. Please don't...
Click to read more »\mathbb {Z} } of integers, the first two polynomials are reducible, but the last two are irreducible (the third does not have integer coefficients)". Shouldn't...
Click to read more »4 is its index in the sequence (also an integer; generally in sequences, indexes usually will carry integer values, outside of functions with varying...
Click to read more »December 2022 (UTC) As the remainder of the article cannot be understood if integer exponents are not understood, this would be a nonsense to remove the section...
Click to read more »each of which can hold any integer, and a finite number of arithmetic registers capable of holding any integer. Integers may be decoded into the usual...
Click to read more »say that any integer multiple of an even integer is even, then, since 0 × 10 = 0, the 0 of the RHS is even since 10 is an even integer. Given the nature...
Click to read more »}} The facility ID number or FIN is a unique positive integer Positive int or unsigned int? 75.92.135.196 (talk) 10:36, 17 June 2009 (UTC) FIN 0 has not...
Click to read more »using bit strings as reference, instead Natural numbers. The formula with integer log2 is not valid for bit sitrings because its length can be bigger, as...
Click to read more »from a string to a unique integer, meaning that each comparison is now an integer comparison. As above. Identity integers also lose this property: Additionally...
Click to read more »integer. The lead section doesn’t say which, and my addition of integer factorial notation was reverted on the grounds that x need not be an integer....
Click to read more »balanced quinary with the digits -2,-1,0,1,2 show how you can convert an integer N to its unique representation by repeatedly casting out remainders mod...
Click to read more »appears to be wrong. A 32-bit unsigned integer can encode values up to 4,294,967,295, while a signed integer can encode values up to 2,147,483,647. Neither...
Click to read more »April 2009 (UTC) BUFSIZ - an integer which is the size of the buffer used by the setbuf() function. EOF - a negative integer of type int used to indicate...
Click to read more »only be discussing integers. -- Beland (talk) 03:55, 17 January 2024 (UTC) I have 2 formulas for representing any positive integer to 3rd degree(same...
Click to read more »value from 0.1 to 5", yet, the article says that "b is a positive odd integer". This is a contradiction. Which statement is correct? SmokeyVW (talk)...
Click to read more »n for which e π n {\displaystyle e^{\pi {\sqrt {n}}}} is very near an integer, for example n = 58 and 652. How come? - Fredrik | talk 21:39, 16 September...
Click to read more »article in the reference section, the ADX instruction set only allows large integer arithmetic, not arbitrary precision arithmetic. The former is a very small...
Click to read more »Unimodular transformation redirects to a page that assumes integer entries. Which would alter the definition but not what is defined (?!). I think the...
Click to read more »for positive integer exponents (for example), but those don't form a group. In the example given, the exponents are just boring old integers. Sławomir Biały...
Click to read more »that is optional); even those commonly implemented in processors, such as integers (signed and unsigned) from 8-bit to 64-bit, defaulting to signed 32-bit...
Click to read more »Hi, I wrote a script today that looked for integer solutions to the equation a^5 + b^5 = c^5 + d^5. The script randomly created candidate solutions, so...
Click to read more »any reference, what "x" means in integer notation. These chords have an "x": Without the "x", the image and the integer notation would perfectly match....
Click to read more »Maxwell’s multipole representation Sylvester's formula for partitions of an integer. Sylvester's rule for converting partitions Sylvester's theorem on partitions...
Click to read more »composite, but not conversely. See also the links to the encyclopedia of integer sequences. Revolver 6 July 2005 18:32 (UTC) They're two completely different...
Click to read more »2019 (UTC) It should be made precise where n (or j etc) is assumed to be integer and where this is not required. As Leibniz wrote already in the 1680's...
Click to read more »application of the Fundamental theorem of arithmetic: For any rational non-integer in lowest terms there must be a prime in the denominator which does not...
Click to read more »criterion alone is sufficient condition. We can also say: An odd composite integer n is called an Euler pseudoprime to base a, if: a(n-1)/2 = 1 (mod n). The...
Click to read more »proof was completely wrong. For example, you had That is, there are two integers b1 and b2, both in {1,...,33}, such that c(b1·5 + k) = c(b2·5 + k) for...
Click to read more »Whats with this rephrasing: ...Størmer's theorem states that the set of integers p 1 e 1 p 2 e 2 . . . p k e k {\displaystyle p_{1}^{e_{1}}p_{2}^{e_{2}}...
Click to read more »of bits/digits past the floating point. An integer is very unprecise, because between every two integers there's a big range of other numbers. e.g. what...
Click to read more »9223372036854775808 is the integer limit in a lot of things, being 2^63, so if you have 64 bits you get the range -9223372036854775807 to 9223372036854775808...
Click to read more »have appeared in the literature are integer sequences, in my opinion it makes more sense to focus primarily on integer sequences and then mention that a...
Click to read more »an, where a1,a2,..,an are called terms in the series for some positive integer n. The sum of the series is simply the sum the of n terms. For example...
Click to read more »right triangle with two integer sides x, y, and irrational side z can be transformed into a different right triangle with integer sides and hypotenuse z2...
Click to read more »Discuss the significance of this theorem to the modular arithmetic, especially in relation to groups(since this shows not all integer have inverse)...
Click to read more »16 May 2007 (UTC) There is a Ford circle C[n/1] associated with every integer n, with centre at (n, 1/2) and radius 1/2. The diagram in the article is...
Click to read more »Trevor macinnis -- you partially ruined the joke... now 182 is not the first positive integer not to have an entry in the English Wikipedia......
Click to read more »December 2021 (UTC) Yes, any multiple of 2520 will also be divisible by the integers 1 through 10; the number you identify is equal to 60 * 2520. That said...
Click to read more »fundamental mathematical concept to me, these concepts are orthogonal to integers and real numbers. I don't see any ambiguity here. The page for Discreteness...
Click to read more »(UTC) 5 cannot be used, since there is no positive integer where the sum of the divisors of that integer is 5. The sum of the divisors of 6 is 1 + 2 + 3...
Click to read more »(talk) 02:50, 5 January 2008 (UTC) If an (odd) integer n has exactly 2 factors, then factoring that integer is equivalent to compute a discrete logarithm...
Click to read more »1024 bit integer. As it happens that is the maximum most likely because of an underlying IEEE-754 64-bit floating point value, not an integer, and therefore...
Click to read more »subatomic particles have a characteristic spin value, either an integer or a half-integer (1/2, 3/2 and so on). Particles which are entangled with respect...
Click to read more »agree that it should be removed from this list due to its placement in the integers category, and the notability tag changed to a stub, as more information...
Click to read more »that all coordinates must be integers or all must be half-integers, but the formula allows mixed integer and half-integer coordinates. I don't know the...
Click to read more »suggested the high-order bits in the LEB128 representation of a signed integer should be all 0s and then 1 for the last byte) and the example for encoding...
Click to read more »the English text. Also, the Haskell allows you to define all the church integers at one swoop, whereas the scheme example only shows a few examples (because...
Click to read more »divisions are all exact, and that, if the initial entries are integers, all entries remain integers during the execution of the algorithm. If you do not understand...
Click to read more »positive integer n that is a product of two distinct odd primes p and q, a positive integer e such that gcd(e, (p − 1)(q − 1)) = 1, and an integer c, find...
Click to read more »When the phrase "integer lengths" is used, it is not clear if they have to start with one. — Preceding unsigned comment added by 194.112.11.166 (talk)...
Click to read more »extended to the Jacobi symbol ... where a and n are relatively prime odd integers with n > 0: ... For example, multiplication by 2 on Z/21Z has cycle decomposition...
Click to read more »solution, but also it's role in integer programming mdoeling). Another website discussing "Big-M" in the context of integer programming is here. Hi User:Rileyjmurray...
Click to read more »for any integer c=b+1,b+2,... and at the same time that the b-th rightmost digit of Graham's number is not the same of 3^^c for any integer c greater...
Click to read more »the native format in which the integer alu of a 16-bit processor (such as the 8086) calculates when using signed integers. Early computers had no floating...
Click to read more »link to it and make some mention of how it fits historically with other integer factorization algorithms and implementations? Hardmath (talk) 05:04, 6...
Click to read more »...
Click to read more »looks to be the result of using non-integer versus integer (classic) P/O ratios. Using non-classic or non-integer values for P/O ratio then per 2 electrons...
Click to read more »there something missing in the definition? "... the genus ... is the least integer g, so that < Statement not involving g> " ??? Ok. Fixed. --C S (Talk) 17:23...
Click to read more »with integer coefficients and that it is best used to rational test roots. I think the test roots were of the form a0/an where a0 is an integer factor...
Click to read more »Cohn's criterion. The coefficients have to be integers between 0 and 9, inclusive. You are using integer coefficients between -9 and +9 inclusive. The...
Click to read more »a_{1}\,\leq \,a_{2}\,\leq \,a_{3}\,\leq \,\cdots ,} there exists a positive integer n such that a n = a n + 1 = a n + 2 = ⋯ . {\displaystyle a_{n}=a_{n+1}=a_{n+2}=\cdots...
Click to read more »the matrices. It would be nice if the example cube only used positive integers, and had a negative discriminant for easy checking with pari-gp. PineDoors...
Click to read more »odd integer powers holds when a non-integer power is split into a product having an integer exponent and a fractional exponent. Given a non-integer a and...
Click to read more »operations on integers, and their definitions have no special cases for when a real happens to be "an integer" (more precisely, the image of an integer under...
Click to read more »with integer coefficients from the classical modular curve X 0 ( N ) {\displaystyle X_{0}(N)} for some integer N; this is a curve with integer coefficients...
Click to read more »Do I miss some subtilty (between integer points and rational points) if I doubt g>0 and replace it by g>1 ? Anne Bauval (talk) 17:47, 14 April 2011 (UTC)...
Click to read more »accurate would be: "High-performance microprocessors of the 1980s had 32-bit integer units and mostly 64-bit floating point units, usually implemented as separate...
Click to read more »b)/m. However, this is only true if m is a non-negative integer, since gcd is a non-negative integer. Example: -1 x gcd(a,b) =< 0 , but, gcd(-a,-b) >= 0....
Click to read more »paragraph: First paragraph needs rewording: change from “integer binary numbers” to “integers represented as binary numbers”. 2A02:C7E:5A76:8100:F0AC:B684:F79C:4102...
Click to read more »only if x does not belong to x (however, determine whether a positive integer x is a Russell number may be very difficult, the smallest unknown x is...
Click to read more »following reasons: It used N for the positive integers, but we generally use that symbol for the non-negative integers, see natural number. //1 Z+≡N. Non-negative...
Click to read more »"The reciprocals of the non-negative integer powers of 2 sum to 2", write "The reciprocals of the non-negative integer powers of 2 sum to ∑ k ≥ 0 1 2 k =...
Click to read more »algorithms are restricted to polynomials that are square-free and have integer coefficients. Is there a way to remove the restrictions? The simplicity...
Click to read more »quite q while now as well: type TMyClass = class public class var NumOfInstances : Integer; end; --79.212.60.194 (talk) 20:47, 26 October 2018 (UTC)...
Click to read more »Isn't it kind of redundant to say 'the integer part of' in the first line, since the expression has the floor function? Carifio24 02:46, 22 December 2006...
Click to read more »following formula gives the WEEKDAY result. //=floored (rounded to –infinity) integer division %=mod(remainder) operation 1) Write the Date in European Format...
Click to read more »parameter (“number of derivatives”) and $n$ and $\alpha$ are simply the integer and fractional parts of $s$. — Preceding unsigned comment added by 169...
Click to read more »groups by using integers with addition as an example. For me, thinking of a group as "like" integer addition, a ring as "like" integers with addition and...
Click to read more »archival service (link) Cite error: The <ref> tag name cannot be a simple integer (see the help page). Ross, Noam; Delaney, Scott; et al. "Grant Witness"...
Click to read more »the starting elements if one is in an Euclidean Domain? In the case of integers this amounts to saying that there are x,y ∈ Z wiht |x|<max(a,b), |y|<max(a...
Click to read more »every integer is a horrendously poor algorithm for trying to factorize a 10-digit prime using 32-bit integers (or a 19-digit prime using 64-bit integers, etc...
Click to read more »statement mentions "rational integers". Does it refer to integers? Or to general rational numbers that may be non-integers? --Erel Segal (talk) 12:26,...
Click to read more »on real numbers that rounds its argument up to the next integer" "For some sequences of integers, the corresponding limit converges in a fixed number of...
Click to read more »necessarily continous, for example the map defined by the integer part from the reals to the integers is a quasi-isometry. I think more involved examples would...
Click to read more »both FLT, the integers and the new integers. Then the countable counterexamples to FLT are constructed from the integers and new integers. E. E. Escultura...
Click to read more »In the table, why every country have integer number of population except India? It shows 1,444,436.244 people as per 2024, where does this 0.244 comes...
Click to read more »"positive integer" just means "odd positive integer", and there is no context in which "positive integer" just means "even positive integer". Therefore...
Click to read more »registers. Integer registers are not the best substitute for GPR as eg. SP is (usually) a special purpose data integer register (and zero is an integer).. comp...
Click to read more »construct, for any integral domain R that is not a field and any positive integer n ≥ 2, a commutative ring S and a prime ideal P of S such that the quotient...
Click to read more »The description in the overview states that "the number b^p − p is an integer multiple of p" but I think it should read b^p - b. Lliht (talk) 08:30,...
Click to read more »https://web.archive.org/web/20080905194102/http://www.integer-software.co.uk:80/ to http://www.integer-software.co.uk When you have finished reviewing my...
Click to read more »revision 1165507037 by Alexander Davronov talk) there are no "imprecise integer-value" numbers.» @DVdm: This should be understood in terms of precise match...
Click to read more »(UTC) The integer linear programming technique is mentioned, so I don't really see your point. Maybe it would be helpful to mention that integer linear programming...
Click to read more ».. or simply you can use the Grunwald-Letnikov differintegral with n- integer and small step h to calculate the derivatives of arbitrary order using...
Click to read more »The factor 1-2^(1-s) is zero for s=1 AND also for s=1+2*k*Pi*i, k integer. So ... 1) The eta function has zeros on Re(s)=1, which do not show up very...
Click to read more »good...RoseParks What do you call numbers which can be obtained from the integers by a finite series of additions, multiplications, divisions and root extractions...
Click to read more »." This is unclear because the phrase "up to the integer n" does not specify whether the integer n is included or excluded. Anyone contributing to mathematics...
Click to read more »in its correct position. In In mathematics, a prime power is a positive integer power of a single prime number. The subject is "power", but it is not correct...
Click to read more »of a prime when you already have a primitive root for odd p let g be an integer, such that g mod p generates all elements of the field mod p, except zero...
Click to read more »Mar 2004 (UTC) --- "Equivalently, its ring of integers has unique factorization" Should "ring of integers" be "ring of ideals" or something similar? It's...
Click to read more »right hand side is not an integer! This arises because in the expression for the wavenumber of a rotational line m is an integer, but the derivative with...
Click to read more »Needs more work. The number of bits for each format needs to be specified, examples need to be given. Charles Esson 15:15, 4 July 2007 (UTC)...
Click to read more »4, 7, and their multiples and sums." Can someone sourcecheck this because every integer greater than one can be obtained by their multiples and sums....
Click to read more »restricted to finite groups, or be otherwise refined. In the group of all integers (with addition) only powering index 1 and -1 work. In the group that consists...
Click to read more »should write up pseudocode actually describing the algorithm for mapping integers to sentences generated by a BNF grammar. also some diagrams to visualize...
Click to read more »game, where you try to make 24 using some set of operators and 4 random integers found by drawing 4 cards from a deck. anybody want to add something about...
Click to read more »digits to the right of the radix point and interpreting the result as an integer; e.g., you put .A9 == .001 because (9A)bijective decimal = (100)ordinary...
Click to read more »CDXL-Format BYTE 8 Bit unsigned integer WORD 16 Bit unsigned integer, `Motorola`-Byte-Sex LONG 32 Bit unsigned integer, `Motorola`-Byte-Sex CDXL-Format...
Click to read more »references can be added Type generic functions for performing checked integer arithmetic (Integer overflow).[citation needed] https://www.open-std...
Click to read more »fact, base 10 will do just fine, and 10-adic numbers are just ordinary integers, except with possibly infinitely many digits to the left, otherwise, all...
Click to read more »base integer. Faster328 (talk) 07:36, 3 April 2023 (UTC) Mistake: The final result? Number in base divided by base integer x base ^ base integer. Correct...
Click to read more »project, split cuts, intersection cuts, various strengthened cuts, chvatal, integer rounding cuts etc... as well as their convex hulls (the intersection of...
Click to read more »discussing the advatage for integer convolutions, this sentense seems odd: "the NTT has no round-off because it deals purely with integers that can be exactly...
Click to read more ». --JBL (talk) 17:10, 11 January 2026 (UTC) In the lead we have If an integer is randomly selected from the interval [1, n], then the probability that...
Click to read more »the problem input: positive integer n output: YES if n is prime, NO otherwise Clearly a decision problem. But input: integer n output: YES if n is positive...
Click to read more »and be NP-hard itself. It is open, whether factoring is NP-hard. From Integer_factorization: It is suspected to be outside of all three of the complexity...
Click to read more »whole' or 'natural integer'. The term entier relatif ('relative integer') is also used for "integer", for emphasizing that negative integers are included....
Click to read more »only has to be checked for 0^2 to 8^2. Suppose you write an arbitrary integer as (9n+k) where 0≤k<9. (9n+k)^2 = (9n)^2+18nk+k^2. Divided by 9 it must...
Click to read more »a reference to integer programming. Integer programming is a subcase of linear programming, where the solutions are limited to integer values. Mathematically...
Click to read more »Natural integer Natural number (transclusion) Natural Numbers Natural numbers Non-negative integer Nonnegative integer OTTFFSSENT Positive integer Positive...
Click to read more »The smallest positive integer without a wikipedia article. Rich Farmbrough 20:27, 25 August 2005 (UTC) Does not have three properties as required under...
Click to read more »(UTC) The article should very clearly explain that Jacobi's formula counts integer (as opposed to natural) solutions. To the best of my knowledge, there is...
Click to read more »1023 for the exponent, the other understanding the significand as binary integer, 2^52 times larger, and in turn the bias for the exponent 52 larger, 1075...
Click to read more »Is BOCU using integer division? — Preceding unsigned comment added by Gitgit123hub (talk • contribs) 10:59, 18 November 2017 (UTC) Yes. Doug Ewell (talk)...
Click to read more »choose to implement the algorithm with integer arithmetic, rather than floating point arithmetic. Using 64 bit integers would allow a greater range of conversions...
Click to read more »greeninteger.com/green_integer_review/issue_1/Ray_DiPalma.htm to http://www.greeninteger.com/green_integer_review/issue_1/Ray_DiPalma.htm Added...
Click to read more »2024 (UTC) The rounding region of an integer – i.e., a set of complex (non-integer) numbers that share the integer part of their representation in this...
Click to read more »represents an integer. Below in the article, it says that alpha can be any real number. I didn’t know that non-integer values are used. Maybe “integer” should...
Click to read more »two?" Rationale: if n is an integer, two consecutive integers could be expressed as n, n+1. n + n + 1 = 2n+1 = any odd integer. But I didn't want to jump...
Click to read more »example: a = array[1..10] of integer; b = record c: 1..10; d: integer end; b actually contains the types 1..10 and integer but a just uses them. S-expressions...
Click to read more »monic) with integer coefficients, then every rational root of f(x) is of the form p/q, where p is an integer divisor of a0 and q is an integer divisor of...
Click to read more »02:35, 10 May 2020 (UTC) This section refers to a conjecture that each integer ≠ ±4 (mod 9) can be represented in infinitely many ways as the sum of three...
Click to read more »optional, but if present, it must start with a two-byte big-endian unsigned integer reason code, The "reason code" later is referred to as Status codes. It's...
Click to read more »spin of 1/2. However, I was under the impression that fermions have half-integer spin (not necessarily 1/2).--GregRM 02:51, 16 March 2006 (UTC) You are...
Click to read more »were genuinely working out the average age, but all you've given is three integer values which really don't allow people to differentiate between teams in...
Click to read more »some random unsigned integer b < 2^(32-10), or in other words, b < 2^(22), and rehash -- right? Each time I add the 22-bit integer b to that intermediate...
Click to read more »Suppose 3n-1 = 27653.2^9167433+1, where n is some positive integer. Then, solving for n gives some rational or irrational number. A contradiction. Therefore...
Click to read more »definition, given a Liouville number x, there exists an infinite sequence of integer pairs {(pi, qi)} which satisfy |x - pi/qi| < 1/(qi)i. Then for all m >...
Click to read more »integer programming or all integer programming? Now the chapter about integer problems is ambiguous.--Thv 07:30, 2005 May 6 (UTC) Unbounded integer programming...
Click to read more »shall be expressed as a positive integer, with any fractional result causing it to be rounded to the next highest integer. Note Editing main page to include...
Click to read more »it only has integer lines; it seems much less likely that anyone would read the grid as only capable of representing points with integer coordinates....
Click to read more »estimates Better ways to calculate A Use of partial fraction decomposition Integer matrices Mention corollary at the end of Lanczos paper Fredrik | tc 10:15...
Click to read more »integers less than 26, twelve are even (and not co-prime because of the shared factor of 2), one (the integer 1) is not prime, and one (the integer 13)...
Click to read more »kilobytes of RAM. Mhodge23 (talk) 15:17, 4 July 2012 (UTC) Change float to integer takes rather 3500us (0.0035 sec) than 3500ms (3.5 sec), but I have not...
Click to read more »values are integers. Netuser500 16:47, 19 January 2007 (UTC) Well, you can certainly code anything that’s a computer datum as an integer, but if we actually...
Click to read more »tuned without thinking about divisions of a comma, instead he used exact integer ratios! So any values based on fractions of a comma are total misrepresentations...
Click to read more »bootstrapproductions.org/beloved-integer to http://www.bootstrapproductions.org/beloved-integer When you have finished reviewing my changes...
Click to read more »fractions, only the elements of the expression are not confined to being integers; indeed even in some of the examples given, for instance for exp(x), x...
Click to read more »stated that s is the integral part of -r. So I suppose that r can be non-integer. Is there an error in the original paper, or is my understanding of r wrong...
Click to read more »(though the underlying type is still integer and ordinal, the enum is not) The wording the article of mapping 1:1 to integer values is a bit confusing, the...
Click to read more »evens than integers. Of course, the same could be done the other way around, mapping each even number E with itself and E-1. Every integer that doesn't...
Click to read more »n is an integer. Seeing w(x) is confusing, as w is defined on the integers. Also people might interpret the limit as taken over the integers n. (Which...
Click to read more »I've been playing around with finding (integer) nth roots for large n. Unfortunately, the following implementation of Newton's method (in Python) is ridiculously...
Click to read more »should link to integer. After all, "whole number" could mean non-negative integer (natural number), positive integer (natural number) or integer. Since the...
Click to read more »challenge in the first step is to choose a suitable integer linear program. (For example, the integer linear program should have a small integrality gap...
Click to read more »The GLPK page states that it handles both linear programming and mixed integer programming. Which is correct? Wogone (talk) 14:01, 20 August 2012 (UTC)...
Click to read more »for example take the operation of the integers coprime to n, modulo n, to be defined as multiplication of integers, and everything currently in Order (group...
Click to read more »given set of integers) is NP-hard. The paper clearly states that it is an open problem whether finding a shortest addition chain for an integer is NP-complete...
Click to read more »pattern as a base phi value, then rounding to the nearest integer, would give the same integer as interpreting the bit pattern as a Fibonacci number / Zeckendorf...
Click to read more »Algebra Tiles, changing the subtracting of integer section and finishing with modifying the multiplication of integers. Additions for Virtual Algebra Tiles...
Click to read more »set. S1√2 = Integer. S1(√2 - 1) = an integer <S1 because (√2 - 1)< 1 so S1(√2 - 1)*√2 = an integer, so S1 cannot be the smallest integer with this property...
Click to read more »restriction this puts on the lozenge is that α must be an integer. But it doesn't need to be an integer to be used in parquetry. This qualifier also has no...
Click to read more »somewhere? 94.21.229.113 (talk) 23:12, 22 June 2024 (UTC) One is about integers and the other is about continuous shapes (or, if you prefer, real numbers)...
Click to read more »obtained by doing invertible integer row operations and is equal to H = U M {\displaystyle H=UM} for some invertible integer matrix U {\displaystyle U}...
Click to read more »"integer", in computing, is a name given to data types whose possible values are subranges of the integers. -128 to 127 is a subrange of the integers,...
Click to read more »timestamps in a format called "IET": "IDPS Epoch Time". It is a signed 64-bit integer giving microseconds since 00:00:00.000000 Jan 1 1958. 2) IET also stands...
Click to read more »\lfloor \lambda \rfloor } is that when λ {\displaystyle \lambda } is an integer, the values ⌈ λ ⌉ − 1 {\displaystyle \lceil \lambda \rceil -1} and ⌊ λ...
Click to read more »see that the article states that the RSA problem is more difficult than integer factorisation. This is not yet proven, and as such is merely speculations...
Click to read more »}n\|\alpha -\beta \|,} where ||x|| is the distance from x to the nearest integer. I don't understand the difference between this and saying for any real...
Click to read more »sense to discuss both the non-negative integers and the positive integers in the same article, when integers gets its own article. The difference may...
Click to read more »required for good articles. Cite error: The <ref> tag name cannot be a simple integer (see the help page). Either parenthetical references or footnotes can be...
Click to read more »what about intelligence? int, like most -all- stats is expressed as an integer, but that's a rather tenuous connection. disambigue? and how long will...
Click to read more »and words to watch out for. In "Definition", what does "initially for integer" mean, and is it even grammatical? "more generalized": how is this different...
Click to read more »the set S − { α } {\displaystyle S-\{\alpha \}} , then there exists an integer-valued function f {\displaystyle f} such that | G α | ≤ f ( d ) {\displaystyle...
Click to read more »solve this was to go to 64 bit address/integers in the processors' cores. Now 64 bits addresses 2^64 integers (or bytes in memory)--18,446,744,073,709...
Click to read more »or even products of primes — just that they are positive integers. 1 is a positive integer. —David Eppstein (talk) 18:56, 26 August 2008 (UTC) Just a...
Click to read more »meant a⁄1, not a⁄a since the latter is only the integer 1, not any other integer. Anyway, an integer can be expressed using decimals; many people do this...
Click to read more »cases: the ordinary discrete exponential function or exponentiation (with integer and fractional exponents) and modular (discrete) exponential based on remainder...
Click to read more »almost always means discrete, for instance finite graphs, finite sets, integers. There is a significant overlap between both fields and sometimes it is...
Click to read more »65536) vs 4 bytes (0..4294967296) variable vs "byte" variable (0..255) vs "integer" (-32768..32767) with a little bugfix can be done so easily it can be done...
Click to read more »and integer k ≥ 1 , 0 otherwise. {\displaystyle \Lambda (n)={\begin{cases}\log p&{\text{if }}n=p^{k}{\text{ for some prime }}p{\text{ and integer }}k\geq...
Click to read more »percentage by 100, to give, instead of a fraction between 0 and 1, an integer between 0 and 100. Pretty much every RS I've seen, including the ABLS textbook...
Click to read more »contribs) 15:24, 7 May 2009 (UTC) L(P,t) is a priori only defined for positive integers t. Ehrhart proved that L(P,t) is a quasipolynomial (if P is a rational...
Click to read more »glance, this seems like it corresponds to replacing your T with T+4k for integers k (since for α=π/2, an FT, the 4k term vanishes). — Steven G. Johnson (talk)...
Click to read more »implies a different variant of the Erdős–Pósa theorem: For every positive integer k, every graph either contains at least k vertex-disjoint cycles of length...
Click to read more »An integer is stated to be equal to the sum of two real numbers. This is impossible. An integer can only equal the sum or difference of integers in such...
Click to read more »real zero and integer zero. A certain subset of the set of reals is identified with the set of integers, such that the set of integers is considered a...
Click to read more »sorting an integer is O(n). If I understand it, NTP uses fixed precision number for time, hence the offset can be sorted as if it is integer. — Preceding...
Click to read more »ring of the integers of this field...). So, they are powers of the fundamental unit of the field. Instead of choosing a square free integer D and searching...
Click to read more »the smallest element, an "integer median" of computer integers, is a computer integer. (e.g. in a byte context, the integer median will never be outside...
Click to read more »column defined as an integer. SQLite will attempt to convert data between formats where appropriate, the string "123" into an integer in this case, but does...
Click to read more »return an integer may in fact not return. In order to theoretically account for this possibility, the bottom type is considered a subtype of integer (and,...
Click to read more »notable shows, which are listed on the disambiguation page titled 90210. The integer itself does not seem to have enough interesting mathematical properties...
Click to read more »solution then α k {\displaystyle \alpha ^{k}} is very close to an even integer 2a (In fact it is very very close to 2a+1/2a or 2a-1/2a) and the kth solution...
Click to read more »stated: Given positive integers a1, a2, ..., an, find the largest integer that can not be expressed as a non-negative integer linear combination of these...
Click to read more »defined perfect triangle as triangles with sides of integer length and having numerically equal integer area and perimeter. An equlatrial triangle would...
Click to read more »configuration returns in time t = t1 * t2 * t3 ... It can be proven that the integer cat map returns in at most 3N discrete timesteps. JocK 12:46, 30 June 2006...
Click to read more »2012 (UTC) I've removed the example of integer factorization as a "known hard problem". It isn't proven that integer factorization is NP-complete and is...
Click to read more »greeninteger.com/green_integer_review/issue_2/Paul-Eluard.htm to http://www.greeninteger.com/green_integer_review/issue_2/Paul-Eluard.htm When...
Click to read more »In the example given in the article, a read_integer command reads input from a file, and a last_integer query returns the value. This is not referentially...
Click to read more »1{\pmod {n}}} for every integer a that is coprime to n and a m ≡ 1 ( mod n ) {\displaystyle a^{m}\equiv 1{\pmod {n}}} for every integer a that is both coprime...
Click to read more »an article on the partition of India should be? --AW There's also the other mathematical usage, referring to "partitions of an integer". -- Mike Hardy...
Click to read more »What is going on with the non-integer vote totals for several parties in the election? Did the Icelandic electoral system at the time count some votes...
Click to read more »List of prime numbers#Gaussian primes is a list of the smallest positive integer Gaussian primes, and so doesn't include many of the smallest Gaussian primes...
Click to read more »error message is: Cite error: Invalid <ref> tag; name cannot be a simple integer, use a descriptive title. The cause does not appear to be vandalism. How...
Click to read more »discarded. Therefore, the section that says De Moivre's formula fails for non-integer power has used the wrong form of De Moivre's formula and has drawn an incorrect...
Click to read more »Considering trimorphic numbers, there are also trivial cases in every positive integer (B) base system: 0 (03 = 0), 1 (13 = 1) and B-1 ((B-1)3 = B3 - 3B2 + 3B...
Click to read more »more advanced than integer exponents and these §s stops the uninitiated reader from continuing reading. The logical sequence is: integer exponents, powers...
Click to read more »Sierpinski: For every integer n > 1, let the n2 integers 1,2, ... ,n2 be written in an array with n rows, each with n integers, like an n x n matrix,...
Click to read more »that the sum of reciprocals of consecutive natural numbers is never an integer. " I'm sorry but isn't that a complete triviality? If the sum goes up to...
Click to read more »(UTC) "These extensions suffice to define the Kronecker symbol for all integer values n." Not true; there was no definition for given n = 0. —Preceding...
Click to read more »books. In particular, Dimensional analysis and empirical laws suggest non-integer exponents. length = volume ^(1/3) and so on. Lf69100 (talk) 08:12, 27 June...
Click to read more »Lycabas and Athis; the latter is sixteen years old (bis adhuc octonis integer annis) and egregius forma (he is also oriental, haling from the Ganges)...
Click to read more »Mandai (stir-fry pictured) is made by fermenting the pith of Artocarpus integer fruit? Source: [1] ALT1: ... that Mandai (stir-fry pictured), a local specialty...
Click to read more »called a strange attractor." "An attractor is called strange if it has non-integer dimension." This last seems incorrect. Consider an initial variable point...
Click to read more »number fields are finite extensions (i.e. sufficiently large powers of integers are linear combinations of smaller powers). The beginning stuff about computer...
Click to read more »"positive integers" as proven in the paper of Bohman, Holzman, Kleitman. I cannot see the argument why it is possible to restrict to positive (integer) speeds...
Click to read more »entirely correct. The number 1. 9 ¯ {\displaystyle {\overline {9}}} has integer part 2 and fractional part 0, while the radix point separates two parts...
Click to read more »impossible if x, y and z are integers. Zymogen (talk) 15:33, 28 March 2008 (UTC) Maybe I am over-simplifying this, but isn't 1 an integer? 1n+1n=1n I can't see...
Click to read more »partial results on the Goldbach conjecture that every sufficiently large integer can be written as a sum of at most 7 primes. (I think we can take 7 but...
Click to read more »non-archimedean places be equal to the characteristic function of the integers? The integers (Z) are not compact in any non-trivial non-archimedian valuation...
Click to read more »IBM-compatible PCs, "word" has become largely synonymous with "16-bit integer" due to the prevalence of early 16-bit x86 processors." — Matt 20:26, 16...
Click to read more »Most of the chord articles have a description of the chord in integer notation. This one doesn't. I think it should. -anon 129.127.13.227 (talk) 07:30...
Click to read more »= 8? = 9? = 10? = Dou you see a pattern for the values of n? for the integers?? (Look! We now have a mathematical meaning for just about every symbol...
Click to read more »The LIST [INTEGER] and LIST [WORD] are "generic derivations" of this class. Permitted combinations(with n: INTEGER, w: WORD, il: LIST [INTEGER], wl: LIST...
Click to read more »diophantine equations (basically because it is proved by saying there is no integer n with 0 < n < 1). Thue first sharpened the exponent, winning a factor...
Click to read more »on real numbers that rounds its argument up to the next integer" "For some sequences of integers, the corresponding limit converges in a fixed number of...
Click to read more »{\mathrm {arctanh} (y)-\mathrm {arccoth} (y)=(2n+1)i{\frac {\pi }{2}}}} (for integer n {\displaystyle \scriptstyle {n}} ). So changing between arctanh() and...
Click to read more »flops and back? --Ejkohojkjkohokjh (talk) 16:42, 10 October 2025 (UTC) Integer operations are run by the ALU, floating point by the FPU (if present) or...
Click to read more »find 123 interesting. It's a concatenation of the first three positive integers, sometimes called a Smarandche consecutive number. Sometimes it's used...
Click to read more »Given that "consecutive" is not explained in the article Integer, I think that a link to a nonexistent article Consecutive_number, which may inspire somebody...
Click to read more »type. --lE☺N2323 18:22, 6 January 2007 (UTC) In the section "Division of Integers", Patrick recently replaced Give the quotient as the answer, so 26 10 =...
Click to read more »would appear that it is calculated by treating each member's age as the integer value in years of their age. By this calculation, the average age increases...
Click to read more »dialed." However a telephone number is not an integer, and in particular, not a 32-bit or 64-bit integer, just a sequence of digits, which can be seen...
Click to read more »(leaving the reader to guess as to what it actually is - an arbitrary integer? it is not clear). Could someone please clean this up? 108.2.128.112 (talk)...
Click to read more »slogan: Architecture For The 80's), which defines an octaword as a 128-bit integer type, and there are even a couple of instructions which act on such quantities...
Click to read more »smallest counterexample is 906150257. From The On-Line Encyclopedia of Integer Sequences, sequence id: A002819, in the comment: "... In 1962, R. S. Lehman...
Click to read more »because one of every four consecutive integers is divisible by 4..." to "...because one of every four consecutive integers (except the numbers ranging from...
Click to read more »two squares, by the Brahmagupta-Fibonacci identity. As a consequence the integers that can be written as a sum of two squares are exactly those with the...
Click to read more »which positive integers n have the stated group-theoretic property. He did, however, prove some years later that *every* positive integer n has this property:...
Click to read more »(edited) The article states that "It is known that L ≤ 2 for almost all integers d.[14]" but I looked over the reference [14] and couldn't find this statement...
Click to read more »awards and medals!". EGU News. www.egu.eu. Retrieved 22 December 2023. Cite error: The <ref> tag name cannot be a simple integer (see the help page)....
Click to read more »example (Z, min, max, +, -, 0), which has neither a greatest nor least integer, yet is a residuated lattice with monoid (Z, +, 0) and common left and...
Click to read more »Example: 4 bytes 1780 0FB0 would encode "6016x4016 pixels" as two 16 bit integer numbers. OTOH, to encode image dimensions as text metadata, you'd need...
Click to read more »random integers are coprime. What distribution should these integers be drawn from? There is no such thing as a uniform distribution on all the integers. topynate...
Click to read more »the natural number following 137 and preceding 139. 138 is the smallest integer not having it's own article in the English Wikipedia. ...Oups... Within...
Click to read more »interleave two copies of the structure, filling one-fourth of the points of the integer lattice, while preserving the fact that the adjacent vertices are exactly...
Click to read more »constructing a larger graph from a graph and an integer: We construct graph H from graph G and integer N, by replacing each vertex of G by N copies of...
Click to read more »with 5 replaced with each prime factor of b, where the terms are integer-divided by the multiplicity of the prime. Or something like that. Perhaps...
Click to read more »To say that the total number of parts is an integer is inconsistent with the denominator being an integer. Michael Hardy (talk) 03:41, 15 September 2009...
Click to read more »type `Err Integer | Ok Integer` that holds either a `Err` value with some associated integer value, or a `Ok` value with some associated integer value. This...
Click to read more »a^{4}+b^{4}+c^{4}=(a+b+c)^{4}} . This is obviously not true for positive integers, because the right-hand side of the equation would be too large. Possibly...
Click to read more »in which a certain number of synodic months closely equals an integer or half-integer number of draconic months: one such period after an eclipse, a...
Click to read more »two-byte integer by having the machine-routine call (JSR) an Applesoft ROM routine; for example, JSR E752 converts it into a two-byte integer stored in...
Click to read more »instructions set only C (carry) and F (overflow); they do not set Z. Compares (integer, floating-point, or string) set Z, N and L. ABS, CHECK, string operations...
Click to read more »current Overview section of the article) implies that 'integer' is a data type, but 'array of integer' is not a data type. And that would be wrong. — Preceding...
Click to read more »"positive integer" and "non-negative integer" redirect here but don't appear in the article. Also checking ngrams it looks like "positive integers" and "whole...
Click to read more ») − 2 {\displaystyle (-2)^{-2}} , which would be -4 as reals, but 4 as integers. Perhaps we should just ignore the question of whether xx is defined for...
Click to read more »bound (Skewes' number) was given by an integer exactly. For, while the prime counting function takes on only integer values in its range, the logarithmic...
Click to read more »format: m is the number of bits set aside to designate the two's complement integer portion of the number, exclusive of the sign bit (therefore if m is not...
Click to read more »for Long Integers in the first line of code. This enables integers in the range of -2,147,483,648 to 2,147,483,647[2] to be processed. Integer division...
Click to read more »nonconstructive [where by "ACn" I mean that Artin's conjecture holds for the integer n]? Or are we merely noting that the passage from this statement to for...
Click to read more »unisolvent point set for the polynomials of degree less than some fixed integer with minimal growth of their Lebesgue constant"? For example, the Chebyshev...
Click to read more »(UTC) The article says the approximate DF estimates needs to be rounded to integers in order to apply a statistical test. Is this a canonical part of Welch's...
Click to read more »type to be "integer"? And what does 'integer' mean? It means something different based on language and environment. So, decimal is 'integer'. That seems...
Click to read more »positive integers at the beginning and then add others as a sort of afterthought, since all the ideas are there when one deals only with positive integers. Michael...
Click to read more »4 June 2009 (UTC) The gamma function does not equal the factorial for integer arguments, they are offset by 1. Prof. Globi (talk) 01:27, 4 November 2016...
Click to read more »talking about Consecutive numbers, which has an article (well, redirects to Integer sequence which has an article). Also, you should sign your messages in...
Click to read more »contains exactly one square-free positive integer. So the search is really limited to square-free positive integers. I'm not sure what the precise definition...
Click to read more »data to integer and then back again. Their dynamic ranges are fundamentally different: if you simply round the floating point values to integer/fixed-point...
Click to read more »The difference between the fractional and the integer quantum Hall-effect is the difference between integer and fractional numbers. The fractional Hall-effect...
Click to read more »error message is: Cite error: Invalid <ref> tag; name cannot be a simple integer, use a descriptive title. I don't really have the time to "be bold" about...
Click to read more »everyone non-familiar with their subject. I made some small additions at "Integer and modular addition" and "Modular multiplication" to help explain the...
Click to read more »1 September 2025 (UTC) I would say combinatorics, because it's about integer grids; discrete geometry usually involves real coordinates. But these disciplinary...
Click to read more »As the first integer without a wikipedia page is this number notable enough to deserve a page? There is an argument hare about how not having a wiki page...
Click to read more »"The subspace topology on the integers as a subspace of the real line is the discrete topology." and "Every discrete metric space is bounded." wat — Preceding...
Click to read more »{\displaystyle (2^{e+1}-1)\sigma (l^{2})=2^{e+1}l^{2}+\,\!1} Since σ(l^2) is an integer, we can write: 2 e + 1 l 2 + 1 ≡ 0 ( mod 2 e + 1 − 1 ) {\displaystyle...
Click to read more »have some weird alternative formulas for C(n,r) with n a non-negative integer, but I'd have to set up the pictures on a stable server or something.—The...
Click to read more »the integer constraints. They call "solution" or "loading" those solutions that satisfy only the subset of constraints not dealing with the integer restrictions...
Click to read more »distribution, in contrast to the normal (and many other) distributions, is for integers only. Thus the notion of units is not applicable; "someone typically gets...
Click to read more »U*(Z/nZ) then what does it mean to divide an element of U*(Z/nZ) by the integer p? Fermat's little theorem does say that for all a! a^(p-1) = 1 mod (p)...
Click to read more »creating a new Integer equivalent to the sum of two other Integers. Integer i = 5, j = 10; Integer k = i + j; /* Equivalent to... * * Integer k = operator+(i...
Click to read more »(Z17, *) is the multiplicative group of integer modulo 17. The cyclic subgroup generated by 10 is also Z17: {1, 10, 15, 14, 4, 6, 9, 5, 16, 7, 2, 3, 13...
Click to read more »Last time that I checked, a dword is a 32-bit Unsigned Integer which can also contain non-Null Terminated Strings. This is true right? No, that's definately...
Click to read more »Perhaps also wikilink to group of units, algebraic integer, and/or quadratic integer. The case of integers and units for Q ( d ) {\displaystyle \mathbb...
Click to read more »nth roots of the integers connected by straight lines between the integers values. Two problems: Why is it restricting itself to integer values? What is...
Click to read more »no reliable source maintains any longer that α is the reciprocal of an integer, nor does anyone take seriously a mathematical relationship between α and...
Click to read more »divisions, so is necessarily an integer also. Gordon Findlay (talk) 02:00, 17 June 2024 (UTC) Note that it says that the integer ( k + 2 ) {\displaystyle (k+2)}...
Click to read more »only if n is an integer. If n is a general complex value, then the sum runs to infinity. There's no difference ... when n is an integer, all of the higher...
Click to read more »cyclotomic integer (Scholar Google provides more than 400 hits for "cyclotomic integer", and two articles that have "real cyclotomic integer" in their...
Click to read more »definition of the factorial operator for the simplest case of positive integers and zero before getting into the more advanced part of the article would...
Click to read more »is "Every even integer greater than 2 can be expressed as the sum of two primes." but Landau's first problem is "Can every even integer greater than 2...
Click to read more »obviously true that any random positive integer has a 50% chance of being even, but is "88% of all positive integers have a factor under 100" meaningful?...
Click to read more »(abbreviation ECF). Why? I found a couple of tables in The On-Line Encyclopedia of Integer Sequences™ (OEIS™) by typing "exact continued fraction" (including the...
Click to read more »// wu's line algorithm can draw lines with non integer start and end. so we need to //have an integer to start with. int xend = round(x1); //some good...
Click to read more »Maybe somebody could add material on integer programming, associated with the work of Jack Edmonds or Egon Balas or Manfred Padberg or George Nemhauser...
Click to read more »worked well -or at least reasonably well- with pure integer math -even 3D games focused on integer performance until the late 1990s) Quake was one of the...
Click to read more »orientable surface is a positive integer representing..." ? Origamidesigner (talk) 19:08, 26 November 2014 (UTC) non-negative integer at best, since genus 0 is...
Click to read more »memory is faulty. There is still the outstanding issue regarding "Plutonian Integers". There is no such coherent theory, since AP changes his mind every post...
Click to read more »Example: The natural sequence of positive integers (1, 2, ..., n, ...) is clearly a nonstandard integer, and all integers are either odd or even but not both...
Click to read more »purely from their finite precision implementation. Furthermore, you do have integer wavelet transforms that are prefectly lossless. --Brokentooth 23:06, 20...
Click to read more »there is a pattern where the number goes as (B is the base) (B is an integer greater than 6) (B-4)21(b-7 zeros)1000. if B=12, then the number would be...
Click to read more »and there is no way of doing this without radicals (assuming a and b are integers) like the editor asks for. Furthermore, it is stated as if the editor wanted...
Click to read more »unambiguous terms positive integer nonnegative integer (why do we hyphenate, anyway??) negative integer nonpositive integer integer instead of "natural number"...
Click to read more »an integer numerator and a positive integer denominator; the integers modulo n can be taken to be equivalence classes of natural numbers (or integers) where...
Click to read more »concoct an example: Definition: An integer k is odd if it can be written k = 2n for some integer n. Theorem: For integers n and k such that k = n×2, k is...
Click to read more »Gregorian calendar before 1582). The year variable being tested is the integer representing the number of the year in the Gregorian calendar, and the...
Click to read more »epsilon = 0.000000000001 integer_value=0 while X < 1: integer_value = integer_value - 1 X = X * 10 while X >= 10: integer_value = integer_value + 1 X = X / 10...
Click to read more »sequence. Then we give a theorem to the effect that given a sequence, every integer is either in the sequence or in its complement. It's not exactly a deep...
Click to read more »arguments need to be changed to / operator. - Embedded is no longer allowed. - Integer parsing classes were renamed and made singletons. - This expressions could...
Click to read more »stands Ψ ( n ) {\displaystyle \Psi (n)} (Series repr., If s is a positive integer) for? --217.80.120.235 (talk) 11:57, 30 May 2009 (UTC) s=1 is a singular/undefined...
Click to read more »gaps that repeats. — MFH:Talk 13:09, 26 October 2018 (UTC) If n, k are integers and n ≥ 2, k ≥ 1, then ther exists a prime k-tuple between n and (k+1)n...
Click to read more »always "step to the next thing". If the operand is an integer, then ++ steps to the next integer value, which is the same as adding 1, but this is only...
Click to read more »quotient so 10 ÷ 3 would equal 31/3 or 3.33 ..., but in the context of integer division, where numbers have no fractional part, the remainder is discarded...
Click to read more »original article made the false claim that b^(q^p) != b^(qp) for *all* q, p integers in a section entitled "Identities and Properties". I simply corrected this...
Click to read more »fix this. --God made the integers (talk) 20:29, 13 January 2017 (UTC) It makes no sense. The second Y is not even an integer -- probably the 2^n needs...
Click to read more »G_{2}} , correspoing to different conventions (leading coefficient one, integer coefficients, norm 1 etc...) Why is the elliptic modular function attributed...
Click to read more »