Пример #1
0
function factorial($x)
{
    if (0 == $x) {
        return 1;
    }
    return $x * factorial($x - 1);
}
Пример #2
0
function factorial($i)
{
    if ($i <= 1) {
        return 1;
    }
    return $i * factorial($i - 1);
}
Пример #3
0
function factorial($n)
{
    if ($n < 2) {
        return $n;
    }
    return $n * factorial($n - 1);
}
Пример #4
0
function getAllPermutations($numberOfChosenElements, $setSize)
{
    //r = number of Chosen Elements
    //n = set Size
    //number of Combinations = n!/((n-r)!(r!))
    //returns an array of combinations
    $n = intval($setSize);
    $r = intval($numberOfChosenElements);
    //calculate total combinations (inc. non unique)
    $totalCombinations = factorial($setSize);
    //unique combinations
    $uniqueCombinations = factorial($n) / (factorial($n - $r) * factorial($r));
    //permutations = (number of Chosen Elements)^ set Size
    $permutations = pow($n, $r);
    $array = array();
    //$uniqueList = array();
    //echo  "Total Combinations: " . $totalCombinations . "<br/>";
    echo "Permutations: " . $permutations . "<br/>";
    $i = 0;
    for ($i = 0; $i < $r; $i++) {
        //initialize array to all 0's
        $array[$i] = 0;
    }
    $i = 0;
    //start combo checking!
    Permutation(0, $array, $n);
}
function factorial($x)
{
    if ($x <= 1) {
        return TRUE;
    }
    return $x * factorial($x - 1);
}
Пример #6
0
function factorial($n)
{
    if ($n == 1) {
        return 1;
    }
    return $n * factorial($n - 1);
}
Пример #7
0
/**
 * factorial.
 * 
 * @param  int $n The number to calculate factorial for
 * 
 * @return int    The factorial of $n
 * 
 * @throws InvalidArgumentException  If input is not valid number
 */
function factorial($n)
{
    if (!is_numeric($n)) {
        throw new \InvalidArgumentException(sprintf('%s is not valid number', $n));
    }
    return $n < 2 ? 1 : $n * factorial($n - 1);
}
Пример #8
0
function factorial($number)
{
    if ($number === 1) {
        return $number;
    }
    return factorial($number - 1) * $number;
}
Пример #9
0
function factorial($n)
{
    if ($n == 0) {
        return 1;
    }
    return factorial($n - 1) * $n;
}
Пример #10
0
function createResultArray($ro, $steps)
{
    $resultArray = array();
    for ($k = 0; $k < $steps; $k++) {
        $resultArray[] = pow($ro, $k) * exp(-$ro) / factorial($k);
    }
    return $resultArray;
}
Пример #11
0
function calc($n)
{
    $res = 0;
    for ($i = 0; $i <= $n; $i++) {
        $res += 1 / factorial($i);
    }
    return $res;
}
function factorial($num)
{
    if ($num == 1) {
        return 1;
    }
    echo $num . "<br />";
    return $num * factorial($num - 1);
}
Пример #13
0
function factorial($n)
{
    if ($n <= 1) {
        return 1;
    } else {
        return $n * factorial($n - 1);
    }
}
Пример #14
0
function factorial($x)
{
    if ($x <= 1) {
        return 1;
    } else {
        return $x * factorial($x - 1);
    }
}
Пример #15
0
/**
 * @param int $number
 */
function factorial($number)
{
    if ($number < 2) {
        return 1;
    } else {
        return factorial($number - 1) * $number;
    }
}
Пример #16
0
function factorial($x)
{
    static $cache = [];
    if (isset($cache[$x])) {
        return $cache[$x];
    }
    $cache[$x] = $x == 1 ? 1 : $x * factorial($x - 1);
    return $cache[$x];
}
Пример #17
0
function factorial($x)
{
    assert(gettype($x) == "integer");
    if ($x == 1) {
        return 1;
    } else {
        return $x * factorial($x - 1);
    }
}
Пример #18
0
/**
 * @param $number
 *
 * @return int
 */
function factorial($number)
{
    if ($number < 2) {
        return 1;
    } else {
        echo $number . '*' . $number - 1;
        return $number * factorial($number - 1);
    }
}
Пример #19
0
function factorial($numb)
{
    if ($numb > 1) {
        return $numb * factorial($numb - 1);
    }
    if ($numb < 0) {
        return -1;
    }
    return 1;
}
Пример #20
0
/**
 * <em>Calculating factorial for a given number</em>
 *
 * @param  int $num an integer of a value to be calculated
 * @return int $result  a final factorial result
 */
function factorial($num)
{
    if ($num == 0) {
        return 1;
    } else {
        $result = $num * factorial($num - 1);
        //Using recursive function.
    }
    return $result;
}
Пример #21
0
function factorial($number)
{
    for ($x = 0; $x <= 10; $x++) {
        echo "The number is: {$x} <br>";
    }
    if ($number < 2) {
        return 1;
    } else {
        return $number * factorial($number - 1);
    }
}
Пример #22
0
function factorial($n)
{
    if ($n < 0) {
        return 0;
    }
    if ($n == 0) {
        return 1;
    } else {
        return $n * factorial($n - 1);
    }
}
Пример #23
0
function factorial($i)
{
    if ($i > 1) {
        return $i * factorial($i - 1);
    } else {
        if ($i == 1) {
            return $i;
        } else {
            return 0;
        }
    }
}
Пример #24
0
function factorial($n)
{
    if ($n <= 0) {
        //Дъно на рекурсията, прекъсва функцията
        return 0;
        //Дъно на рекурсията, прекъсва функцията
    }
    if ($n == 1) {
        //Дъно на рекурсията, прекъсва функцията
        return 1;
        //Дъно на рекурсията, прекъсва функцията
    }
    return $n * factorial($n - 1);
}
Пример #25
0
function cosinus($x, $iterNum)
{
    $cos = 0;
    $k = 2;
    //początkowa wartość dla silni i wykladnka potegi
    for ($i = 1; $i <= $iterNum; $i++) {
        $zm = power($x, $k) / factorial($k);
        //wyliczenie potega/silnia
        if ($i % 2 == 1) {
            $zm = $zm * -1;
            //zmiana znaków co drugi raz
        }
        $x += 2;
        $cos = $cos + $zm;
    }
    return $cos + 1;
}
Пример #26
0
function isCurious($num)
{
    global $cache;
    $num = (string) $num;
    $digits = str_split($num);
    rsort($digits);
    $key = implode('', $digits);
    if (isset($cache[$key])) {
        $sum = $cache[$key];
    } else {
        $sum = 0;
        foreach ($digits as $digit) {
            $sum += factorial($digit);
            if ($sum > $num) {
                return false;
            }
        }
    }
    $cache[$key] = $sum;
    if ($sum == $num) {
        return true;
    }
    return false;
}
<?php

function factorial($n)
{
    $fact = $n;
    for ($i = $n - 1; $i > 0; $i--) {
        $fact = $fact * $i;
    }
    echo "{$fact} <br>";
}
factorial(5);
factorial(7);
Пример #28
0
function factorial($int)
{
    return $int > 1 ? $int * factorial($int - 1) : $int;
}
Пример #29
0
<?php

//define('F_NUMBER', 25);
// Output: 15511210043330985984000000
define('F_NUMBER', 42);
// Output: 1405006117752879898543142606244511569936384000000000
function factorial($in)
{
    $out = '1';
    for ($i = 2; $i <= $in; $i++) {
        $out = bcmul($out, (string) $i);
    }
    return $out;
}
echo factorial(F_NUMBER);
Пример #30
0
function perms($arr)
{
    $p = array();
    for ($i = 0; $i < factorial(count($arr)); $i++) {
        $p[] = perm($arr, $i);
    }
    return $p;
}