When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Floor and ceiling functions - Wikipedia

    en.wikipedia.org/wiki/Floor_and_ceiling_functions

    The floor of x is also called the integral part, integer part, greatest integer, or entier of x, and was historically denoted [x] (among other notations). [2] However, the same term, integer part, is also used for truncation towards zero, which differs from the floor function for negative numbers. For n an integer, ⌊n⌋ = ⌈n⌉ = n.

  3. Integer-valued function - Wikipedia

    en.wikipedia.org/wiki/Integer-valued_function

    In mathematics, an integer-valued function is a function whose values are integers.In other words, it is a function that assigns an integer to each member of its domain.. The floor and ceiling functions are examples of integer-valued functions of a real variable, but on real numbers and, generally, on (non-disconnected) topological spaces integer-valued functions are not especially useful.

  4. Hermite's identity - Wikipedia

    en.wikipedia.org/wiki/Hermite's_identity

    In mathematics, Hermite's identity, named after Charles Hermite, gives the value of a summation involving the floor function. It states that for every real number x and for every positive integer n the following identity holds: [1] [2]

  5. Integer function - Wikipedia

    en.wikipedia.org/wiki/Integer_function

    Integer function may refer to: Integer-valued function, an integer function; Floor function, sometimes referred as the integer function, INT; Arithmetic function, a term for some functions of an integer variable

  6. Non-integer base of numeration - Wikipedia

    en.wikipedia.org/wiki/Non-integer_base_of_numeration

    Denote by ⌊x⌋ the floor function of x (that is, the greatest integer less than or equal to x) and let {x} = x − ⌊x⌋ be the fractional part of x. There exists an integer k such that β k ≤ x < β k +1 .

  7. Integer partition - Wikipedia

    en.wikipedia.org/wiki/Integer_partition

    An alternative visual representation of an integer partition is its Young diagram (often also called a Ferrers diagram). Rather than representing a partition with dots, as in the Ferrers diagram, the Young diagram uses boxes or squares. Thus, the Young diagram for the partition 5 + 4 + 1 is while the Ferrers diagram for the same partition is

  8. Gauss circle problem - Wikipedia

    en.wikipedia.org/wiki/Gauss_circle_problem

    Another generalization is to calculate the number of coprime integer solutions , to the inequality m 2 + n 2 ≤ r 2 . {\displaystyle m^{2}+n^{2}\leq r^{2}.\,} This problem is known as the primitive circle problem , as it involves searching for primitive solutions to the original circle problem. [ 9 ]

  9. Binomial distribution - Wikipedia

    en.wikipedia.org/wiki/Binomial_distribution

    Venn diagram; Tree diagram; Binomial ... Taking the floor function, we obtain M = floor(np). [note 1] ... is the "floor" under k, i.e. the greatest integer less than ...