Search results
Jump to navigation
Jump to search
- :'''Input''': <math>n</math> positive integers <math>p_1,p_2,\ldots,p_n</math> and a positive integer <math>m</math>; :'''Input''': a set of <math>n</math> positive integers <math>S=\{x_1,x_2,\ldots,x_n\}</math>; ...33 KB (5,832 words) - 06:23, 29 September 2016
- :'''Input''': <math>n</math> positive integers <math>p_1,p_2,\ldots,p_n</math> and a positive integer <math>m</math>; :'''Input''': a set of <math>n</math> positive integers <math>S=\{x_1,x_2,\ldots,x_n\}</math>; ...33 KB (5,832 words) - 03:44, 27 October 2017
- :'''Input''': <math>n</math> positive integers <math>p_1,p_2,\ldots,p_n</math> and a positive integer <math>m</math>; :'''Input''': a set of <math>n</math> positive integers <math>S=\{x_1,x_2,\ldots,x_n\}</math>; ...33 KB (5,832 words) - 05:22, 29 October 2019
- <li>[<strong>Surjection</strong>] For positive integers <math>m\ge n</math>, prove that the probability of a uniform random functio ...13 KB (2,321 words) - 08:45, 19 March 2024
- ...n upper bound for odd perfect numbers]," ''[http://www.integers-ejcnt.org/ Integers]'', vol. 3 (2003), A14, 9 pp. ...12 KB (1,697 words) - 23:40, 1 August 2016
- ...and <math>N</math> be a random variable taking values in the non-negative integers and independent of the <math>X_n</math> for all <math>n \ge 1</math>. Prove ...14 KB (2,465 words) - 19:27, 13 April 2024
- :For any integers <math>r\ge 2</math> and <math>s\ge 1</math>, and any <math>\epsilon>0</math ...18 KB (3,527 words) - 06:10, 22 November 2017
- :For any integers <math>r\ge 2</math> and <math>s\ge 1</math>, and any <math>\epsilon>0</math ...18 KB (3,527 words) - 05:10, 9 November 2016
- :For any integers <math>r\ge 2</math> and <math>s\ge 1</math>, and any <math>\epsilon>0</math ...18 KB (3,527 words) - 08:55, 4 May 2023
- :For any integers <math>r\ge 2</math> and <math>s\ge 1</math>, and any <math>\epsilon>0</math ...18 KB (3,527 words) - 09:38, 14 May 2024
- :For any integers <math>r\ge 2</math> and <math>s\ge 1</math>, and any <math>\epsilon>0</math ...18 KB (3,527 words) - 05:55, 12 November 2019
- :For any integers <math>r\ge 2</math> and <math>s\ge 1</math>, and any <math>\epsilon>0</math ...19 KB (3,541 words) - 07:47, 25 December 2015
- ...gramming problem]], which applies [[linear programming]] techniques to the integers, the [[Knapsack|knapsack problem]], or the [[vertex cover]] problem. ...15 KB (2,427 words) - 22:24, 16 August 2017
- :Given positive integers <math>m</math> and <math>k</math>, there exists a unique representation of ...25 KB (4,480 words) - 08:23, 16 August 2011
- :Given positive integers <math>m</math> and <math>k</math>, there exists a unique representation of ...25 KB (4,480 words) - 04:58, 17 November 2010
- ...e-breaking rule for those cases when ''y'' is exactly half-way between two integers — that is, when the fraction part of ''y'' is exactly 0.5. ...avoid spurious [[arithmetic overflow|overflows]] in languages have 32-bit integers. Some languages, such as [[PHP]], provide functions that round a value to a ...46 KB (7,060 words) - 01:36, 21 August 2017
- :For any integers <math>r\ge 2</math> and <math>s\ge 1</math>, and any <math>\epsilon>0</math ...21 KB (3,921 words) - 08:23, 13 November 2010
- :For any integers <math>r\ge 2</math> and <math>s\ge 1</math>, and any <math>\epsilon>0</math ...21 KB (3,922 words) - 01:04, 3 November 2011
- :For any integers <math>r\ge 2</math> and <math>s\ge 1</math>, and any <math>\epsilon>0</math ...21 KB (3,922 words) - 10:31, 16 April 2014
- :For any integers <math>r\ge 2</math> and <math>s\ge 1</math>, and any <math>\epsilon>0</math ...21 KB (3,922 words) - 08:56, 20 May 2013