Searching
Catalogue
Tags
Last updates
  • Lagged Fibonacci random generator
    Aug 04, 2023
    A Lagged Fibonacci generator (LFG or sometimes LFib) is an example of a pseudorandom number generator. This class of random number generator is aimed at being an improvement on the 'standard' linear congruential generator. These are based on a generalisation of the Fibonacci sequence.
    math randoms
  • Linear сongruential random generator
    Aug 04, 2023
    A linear congruential generator (LCG) is an algorithm that yields a sequence of pseudo-randomized numbers calculated with a discontinuous piecewise linear equation. The method represents one of the oldest and best-known pseudorandom number generator algorithms. The theory behind them is relatively easy to understand, and they are easily implemented and fast, especially on computer hardware which can provide modulo arithmetic by storage-bit truncation.
    math randoms
  • Number of permutations
    Aug 04, 2023
    Return an integet value, representing the number of ways to choose k items from n items with order and without repetition.
    combinations math
  • Absolute value
    Aug 04, 2023
    The abs function returns the absolute value or modulus of a real number x, denoted as x, is the non-negative value of x without regard to its sign. Namely, x|=x if x is a positive number, and |x = -x is negative (in which case negating x makes -x positive), and 0 = 0. For example, the absolute value of 3 is 3, and the absolute value of −3 is also 3. The absolute value of a number may be thought of as its distance from zero
    arrays math
  • Event value
    Aug 04, 2023
    The even function returns true if given value is event or false otherwise.
    arrays math
  • Factorial
    Aug 04, 2023
    Return n factorial as an integer. For float n make a round first. In mathematics, the factorial of a non-negative integer n, denoted by n!, is the product of all positive integers less than or equal to n.
    math
  • Fibonacci numbers
    Aug 04, 2023
    Return a element of Fibonacci sequence by given index n. In mathematics, the Fibonacci numbers are the numbers in the following integer sequence, called the Fibonacci sequence, and characterized by the fact that every number after the first two is the sum of the two preceding ones: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, … , By definition, the first two numbers in the Fibonacci sequence are either 1 and 1, or 0 and 1, depending on the chosen starting point of the sequence, and each subsequent number is the sum of the previous two.
    math sequences
  • Maximum
    Aug 04, 2023
    The max function returns the item with the largest value, or the item with the largest value in an iterable
    arrays math
  • Minimum
    Aug 04, 2023
    The min function returns the item with the lowest value, or the item with the lowest value in an iterable
    arrays math
  • Odd value
    Aug 04, 2023
    The odd function returns true if given value is odd or false otherwise.
    arrays math
Welcome
The Wikinomy project team you are welcomes! Wikinomy is a free library of algorithms that can use and fill up every one of us.