Search results

...y zeros have been found. The "obvious" ones to find are the negative even integers. This follows from Riemann's functional equation. More have been computed a ...

...<math>[2n]</math> consisting of <math>r</math> odd and <math>s</math> even integers, with no two elements of <math>S</math> differing by <math>1</math>. Give a ...

| [[Integers]] | ℤ denotes the set of integers (-3,-2,-1,0,1,2,3...) ...

...on]] of the [[factorial]] function to all complex numbers except negative, integers. The argument of the function is shifted down by one. This means that if n ...is defined for all [[complex numbers]]. But it is not defined for negative integers and zero. For a complex number whose real part is not a negative integer, t ...

You can count the [[integers]] with <math>({0, 1, -1, 2, -2, 3, -3...})\,\!</math> ...

[[Category:Integers]] ...

:Let <math>k,\ell</math> be positive integers. Then there exists an integer <math>R(k,\ell)</math> satisfying: :Let <math>r, k_1,k_2,\ldots,k_r</math> be positive integers. Then there exists an integer <math>R(r;k_1,k_2,\ldots,k_r)</math> satisfyi ...

<li>[<strong>Surjection</strong>] For positive integers <math>m\ge n</math>, prove that the probability of a uniform random functio <li>[<strong>Coprime integers</strong>] Given positive integers <math>n \ge 2</math>, calculate the number of integer pairs <math>(x,y)</ma ...

...nal number]], which means it is impossible to write as a fraction with two integers; but some numbers, like 2.71828182845904523536, come close to the true valu ...

...e use in everyday life are rational. These include fractions and [[integer|integers]]. And also a number that can be written as a fraction while it is in its o ...

...mber system) which uses decimal [[integer]]s, [[negative number|negative]] integers, and [[0 (number)|zero]] ...

...olor="red">''ordered''</font> sum of <font color="red">''positive''</font> integers. A '''<math>k</math>-composition''' of <math>n</math> is a composition of < ...umber of solutions to <math>x_1+x_2+\cdots+x_k=n</math> in ''nonnegative'' integers. We call such a solution a '''weak <math>k</math>-composition''' of <math>n ...

:Let <math>k,\ell</math> be positive integers. Then there exists an integer <math>R(k,\ell)</math> satisfying: :Let <math>r, k_1,k_2,\ldots,k_r</math> be positive integers. Then there exists an integer <math>R(r;k_1,k_2,\ldots,k_r)</math> satisfyi ...

:Let <math>k,\ell</math> be positive integers. Then there exists an integer <math>R(k,\ell)</math> satisfying: :Let <math>r, k_1,k_2,\ldots,k_r</math> be positive integers. Then there exists an integer <math>R(r;k_1,k_2,\ldots,k_r)</math> satisfyi ...

:Let <math>k,\ell</math> be positive integers. Then there exists an integer <math>R(k,\ell)</math> satisfying: :Let <math>r, k_1,k_2,\ldots,k_r</math> be positive integers. Then there exists an integer <math>R(r;k_1,k_2,\ldots,k_r)</math> satisfyi ...

:Let <math>k,\ell</math> be positive integers. Then there exists an integer <math>R(k,\ell)</math> satisfying: :Let <math>r, k_1,k_2,\ldots,k_r</math> be positive integers. Then there exists an integer <math>R(r;k_1,k_2,\ldots,k_r)</math> satisfyi ...

:Let <math>k,\ell</math> be positive integers. Then there exists an integer <math>R(k,\ell)</math> satisfying: :Let <math>r, k_1,k_2,\ldots,k_r</math> be positive integers. Then there exists an integer <math>R(r;k_1,k_2,\ldots,k_r)</math> satisfyi ...