Search results

Jump to navigation Jump to search
View ( | ) (20 | 50 | 100 | 250 | 500)
  • ...integer <math>n</math>, let <math>\phi(n)</math> be the number of positive integers from <math>\{1,2,\ldots,n\}</math> that are relative prime to <math>n</math Let <math>U=\{1,2,\ldots,n\}</math> be the universe. The number of positive integers from <math>U</math> which is divisible by some <math>p_{i_1},p_{i_2},\ldots ...
    33 KB (6,227 words) - 06:15, 30 September 2019
  • ...integer <math>n</math>, let <math>\phi(n)</math> be the number of positive integers from <math>\{1,2,\ldots,n\}</math> that are relative prime to <math>n</math Let <math>U=\{1,2,\ldots,n\}</math> be the universe. The number of positive integers from <math>U</math> which is divisible by some <math>p_{i_1},p_{i_2},\ldots ...
    33 KB (6,227 words) - 07:00, 29 September 2016
  • ...integer <math>n</math>, let <math>\phi(n)</math> be the number of positive integers from <math>\{1,2,\ldots,n\}</math> that are relative prime to <math>n</math Let <math>U=\{1,2,\ldots,n\}</math> be the universe. The number of positive integers from <math>U</math> which is divisible by some <math>p_{i_1},p_{i_2},\ldots ...
    33 KB (6,227 words) - 11:45, 15 October 2017
  • ...integer <math>n</math>, let <math>\phi(n)</math> be the number of positive integers from <math>\{1,2,\ldots,n\}</math> that are relative prime to <math>n</math Let <math>U=\{1,2,\ldots,n\}</math> be the universe. The number of positive integers from <math>U</math> which is divisible by some <math>p_{i_1},p_{i_2},\ldots ...
    33 KB (6,227 words) - 12:45, 16 March 2023
  • ...integer <math>n</math>, let <math>\phi(n)</math> be the number of positive integers from <math>\{1,2,\ldots,n\}</math> that are relative prime to <math>n</math Let <math>U=\{1,2,\ldots,n\}</math> be the universe. The number of positive integers from <math>U</math> which is divisible by some <math>p_{i_1},p_{i_2},\ldots ...
    33 KB (6,227 words) - 09:51, 19 March 2024
  • ...roblem <math>f:\{0,1\}^*\to \mathbb{Z}^+</math> whose outputs are positive integers. ...roblem <math>f:\{0,1\}^*\to \mathbb{Z}^+</math> whose outputs are positive integers. ...
    23 KB (4,076 words) - 15:50, 12 May 2014
  • where <math>\mathbb{N}</math> is the set of all nonnegative integers. Compared to the LP for the max-flow problem, we just replace the last line Due to the Flow Integrality Theorem, when capacities are integers, there must be an integral flow whose value is maximum among all flows (int ...
    24 KB (4,341 words) - 13:24, 11 December 2011
  • ...). For example, Briggs' first table contained the common logarithms of all integers in the range 1–1000, with a precision of 8 digits. As the function {{nowrap ...of logarithm tables: given a table listing log<sub>10</sub>(''x'') for all integers ''x'' ranging from 1 to 1000, the logarithm of 3542 is approximated by ...
    13 KB (1,977 words) - 14:34, 21 July 2017
  • where <math>\mathbb{N}</math> is the set of all nonnegative integers. Compared to the LP for the max-flow problem, we just replace the last line Due to the Flow Integrality Theorem, when capacities are integers, there must be an integral flow whose value is maximum among all flows (int ...
    30 KB (5,740 words) - 05:12, 11 June 2014
  • where <math>\mathbb{N}</math> is the set of all nonnegative integers. Compared to the LP for the max-flow problem, we just replace the last line Due to the Flow Integrality Theorem, when capacities are integers, there must be an integral flow whose value is maximum among all flows (int ...
    30 KB (5,740 words) - 14:29, 19 June 2013
  • 5 KB (835 words) - 22:27, 8 March 2013
  • 8 KB (1,358 words) - 13:14, 7 May 2017
  • ...d the smallest natural number. Natural numbers are always whole numbers ([[integers]]) and never less than zero. ...
    7 KB (924 words) - 01:12, 17 January 2017
  • 8 KB (1,232 words) - 17:17, 31 July 2017
  • 9 KB (1,088 words) - 18:04, 22 August 2017
  • ...nstruction, a 2-universal hash function can be uniquely represented by two integers <math>a</math> and <math>b</math>, which can be stored in two entries (or j ...
    10 KB (1,895 words) - 06:20, 21 November 2011
  • :'''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
  • :'''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) - 13:15, 25 October 2020
View ( | ) (20 | 50 | 100 | 250 | 500)