Statistics.Distribution.Binomial:$cvariance from math-functions-0.1.5.2

Percentage Accurate: 99.9% → 99.9%

Time: 2.3s

Alternatives: 5

Speedup: 1.0×

• 25.7% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

\[\begin{array}{l} \\ \left(x \cdot y\right) \cdot \left(1 - y\right) \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (* (* x y) (- 1.0 y)))

C

double code(double x, double y) {
	return (x * y) * (1.0 - y);
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = (x * y) * (1.0d0 - y)
end function

Java

public static double code(double x, double y) {
	return (x * y) * (1.0 - y);
}

Python

def code(x, y):
	return (x * y) * (1.0 - y)

Julia

function code(x, y)
	return Float64(Float64(x * y) * Float64(1.0 - y))
end

MATLAB

function tmp = code(x, y)
	tmp = (x * y) * (1.0 - y);
end

Wolfram

code[x_, y_] := N[(N[(x * y), $MachinePrecision] * N[(1.0 - y), $MachinePrecision]), $MachinePrecision]

Initial Program: 99.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(x \cdot y\right) \cdot \left(1 - y\right) \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (* (* x y) (- 1.0 y)))

C

double code(double x, double y) {
	return (x * y) * (1.0 - y);
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = (x * y) * (1.0d0 - y)
end function

Java

public static double code(double x, double y) {
	return (x * y) * (1.0 - y);
}

Python

def code(x, y):
	return (x * y) * (1.0 - y)

Julia

function code(x, y)
	return Float64(Float64(x * y) * Float64(1.0 - y))
end

MATLAB

function tmp = code(x, y)
	tmp = (x * y) * (1.0 - y);
end

Wolfram

code[x_, y_] := N[(N[(x * y), $MachinePrecision] * N[(1.0 - y), $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(1 - y\right) \cdot \left(x \cdot y\right) \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (* (- 1.0 y) (* x y)))

C

double code(double x, double y) {
	return (1.0 - y) * (x * y);
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = (1.0d0 - y) * (x * y)
end function

Java

public static double code(double x, double y) {
	return (1.0 - y) * (x * y);
}

Python

def code(x, y):
	return (1.0 - y) * (x * y)

Julia

function code(x, y)
	return Float64(Float64(1.0 - y) * Float64(x * y))
end

MATLAB

function tmp = code(x, y)
	tmp = (1.0 - y) * (x * y);
end

Wolfram

code[x_, y_] := N[(N[(1.0 - y), $MachinePrecision] * N[(x * y), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.9%

   \[\left(x \cdot y\right) \cdot \left(1 - y\right) \]

2. Final simplification 99.9%

   \[\leadsto \left(1 - y\right) \cdot \left(x \cdot y\right) \]

Alternative 2: 92.2% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1 \lor \neg \left(y \leq 1\right):\\ \;\;\;\;x \cdot \left(y \cdot \left(-y\right)\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -1.0) (not (<= y 1.0))) (* x (* y (- y))) (* x y)))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -1.0) || !(y <= 1.0)) {
		tmp = x * (y * -y);
	} else {
		tmp = x * y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((y <= (-1.0d0)) .or. (.not. (y <= 1.0d0))) then
        tmp = x * (y * -y)
    else
        tmp = x * y
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((y <= -1.0) || !(y <= 1.0)) {
		tmp = x * (y * -y);
	} else {
		tmp = x * y;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -1.0) or not (y <= 1.0):
		tmp = x * (y * -y)
	else:
		tmp = x * y
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -1.0) || !(y <= 1.0))
		tmp = Float64(x * Float64(y * Float64(-y)));
	else
		tmp = Float64(x * y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y <= -1.0) || ~((y <= 1.0)))
		tmp = x * (y * -y);
	else
		tmp = x * y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -1.0], N[Not[LessEqual[y, 1.0]], $MachinePrecision]], N[(x * N[(y * (-y)), $MachinePrecision]), $MachinePrecision], N[(x * y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -1 or 1 < y

   1. Initial program 99.9%

      \[\left(x \cdot y\right) \cdot \left(1 - y\right) \]
   2. Step-by-step derivation

      1. associate-*l* 90.1%

         \[\leadsto \color{blue}{x \cdot \left(y \cdot \left(1 - y\right)\right)} \]

   3. Simplified 90.1%

      \[\leadsto \color{blue}{x \cdot \left(y \cdot \left(1 - y\right)\right)} \]

   4. Taylor expanded in y around inf 89.0%

      \[\leadsto \color{blue}{-1 \cdot \left({y}^{2} \cdot x\right)} \]
   5. Step-by-step derivation

      1. unpow2 89.0%

         \[\leadsto -1 \cdot \left(\color{blue}{\left(y \cdot y\right)} \cdot x\right) \]

      2. associate-*r* 89.0%

         \[\leadsto \color{blue}{\left(-1 \cdot \left(y \cdot y\right)\right) \cdot x} \]

      3. *-commutative 89.0%

         \[\leadsto \color{blue}{x \cdot \left(-1 \cdot \left(y \cdot y\right)\right)} \]

      4. neg-mul-1 89.0%

         \[\leadsto x \cdot \color{blue}{\left(-y \cdot y\right)} \]

      5. distribute-rgt-neg-in 89.0%

         \[\leadsto x \cdot \color{blue}{\left(y \cdot \left(-y\right)\right)} \]

   6. Simplified 89.0%

      \[\leadsto \color{blue}{x \cdot \left(y \cdot \left(-y\right)\right)} \]

   if -1 < y < 1

   1. Initial program 100.0%

      \[\left(x \cdot y\right) \cdot \left(1 - y\right) \]
   2. Step-by-step derivation

      1. associate-*l* 100.0%

         \[\leadsto \color{blue}{x \cdot \left(y \cdot \left(1 - y\right)\right)} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{x \cdot \left(y \cdot \left(1 - y\right)\right)} \]

   4. Taylor expanded in y around 0 98.4%

      \[\leadsto \color{blue}{y \cdot x} \]
3. Recombined 2 regimes into one program.

4. Final simplification 93.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1 \lor \neg \left(y \leq 1\right):\\ \;\;\;\;x \cdot \left(y \cdot \left(-y\right)\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot y\\ \end{array} \]

Alternative 3: 97.8% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1 \lor \neg \left(y \leq 1\right):\\ \;\;\;\;y \cdot \left(x \cdot \left(-y\right)\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -1.0) (not (<= y 1.0))) (* y (* x (- y))) (* x y)))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -1.0) || !(y <= 1.0)) {
		tmp = y * (x * -y);
	} else {
		tmp = x * y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((y <= (-1.0d0)) .or. (.not. (y <= 1.0d0))) then
        tmp = y * (x * -y)
    else
        tmp = x * y
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((y <= -1.0) || !(y <= 1.0)) {
		tmp = y * (x * -y);
	} else {
		tmp = x * y;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -1.0) or not (y <= 1.0):
		tmp = y * (x * -y)
	else:
		tmp = x * y
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -1.0) || !(y <= 1.0))
		tmp = Float64(y * Float64(x * Float64(-y)));
	else
		tmp = Float64(x * y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y <= -1.0) || ~((y <= 1.0)))
		tmp = y * (x * -y);
	else
		tmp = x * y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -1.0], N[Not[LessEqual[y, 1.0]], $MachinePrecision]], N[(y * N[(x * (-y)), $MachinePrecision]), $MachinePrecision], N[(x * y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -1 or 1 < y

   1. Initial program 99.9%

      \[\left(x \cdot y\right) \cdot \left(1 - y\right) \]
   2. Step-by-step derivation

      1. associate-*l* 90.1%

         \[\leadsto \color{blue}{x \cdot \left(y \cdot \left(1 - y\right)\right)} \]

   3. Simplified 90.1%

      \[\leadsto \color{blue}{x \cdot \left(y \cdot \left(1 - y\right)\right)} \]

   4. Taylor expanded in y around inf 89.0%

      \[\leadsto \color{blue}{-1 \cdot \left({y}^{2} \cdot x\right)} \]
   5. Step-by-step derivation

      1. mul-1-neg 89.0%

         \[\leadsto \color{blue}{-{y}^{2} \cdot x} \]

      2. unpow2 89.0%

         \[\leadsto -\color{blue}{\left(y \cdot y\right)} \cdot x \]

      3. associate-*r* 98.8%

         \[\leadsto -\color{blue}{y \cdot \left(y \cdot x\right)} \]

      4. *-commutative 98.8%

         \[\leadsto -y \cdot \color{blue}{\left(x \cdot y\right)} \]

      5. distribute-rgt-neg-in 98.8%

         \[\leadsto \color{blue}{y \cdot \left(-x \cdot y\right)} \]

      6. *-commutative 98.8%

         \[\leadsto y \cdot \left(-\color{blue}{y \cdot x}\right) \]

      7. distribute-rgt-neg-in 98.8%

         \[\leadsto y \cdot \color{blue}{\left(y \cdot \left(-x\right)\right)} \]

   6. Simplified 98.8%

      \[\leadsto \color{blue}{y \cdot \left(y \cdot \left(-x\right)\right)} \]

   if -1 < y < 1

   1. Initial program 100.0%

      \[\left(x \cdot y\right) \cdot \left(1 - y\right) \]
   2. Step-by-step derivation

      1. associate-*l* 100.0%

         \[\leadsto \color{blue}{x \cdot \left(y \cdot \left(1 - y\right)\right)} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{x \cdot \left(y \cdot \left(1 - y\right)\right)} \]

   4. Taylor expanded in y around 0 98.4%

      \[\leadsto \color{blue}{y \cdot x} \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1 \lor \neg \left(y \leq 1\right):\\ \;\;\;\;y \cdot \left(x \cdot \left(-y\right)\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot y\\ \end{array} \]

Alternative 4: 97.0% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 4 \cdot 10^{+84}:\\ \;\;\;\;x \cdot \left(y \cdot \left(1 - y\right)\right)\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(x \cdot \left(-y\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y 4e+84) (* x (* y (- 1.0 y))) (* y (* x (- y)))))

C

double code(double x, double y) {
	double tmp;
	if (y <= 4e+84) {
		tmp = x * (y * (1.0 - y));
	} else {
		tmp = y * (x * -y);
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (y <= 4d+84) then
        tmp = x * (y * (1.0d0 - y))
    else
        tmp = y * (x * -y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= 4e+84) {
		tmp = x * (y * (1.0 - y));
	} else {
		tmp = y * (x * -y);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= 4e+84:
		tmp = x * (y * (1.0 - y))
	else:
		tmp = y * (x * -y)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= 4e+84)
		tmp = Float64(x * Float64(y * Float64(1.0 - y)));
	else
		tmp = Float64(y * Float64(x * Float64(-y)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= 4e+84)
		tmp = x * (y * (1.0 - y));
	else
		tmp = y * (x * -y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, 4e+84], N[(x * N[(y * N[(1.0 - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(y * N[(x * (-y)), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 4.00000000000000023e84

   1. Initial program 99.9%

      \[\left(x \cdot y\right) \cdot \left(1 - y\right) \]
   2. Step-by-step derivation

      1. associate-*l* 98.6%

         \[\leadsto \color{blue}{x \cdot \left(y \cdot \left(1 - y\right)\right)} \]

   3. Simplified 98.6%

      \[\leadsto \color{blue}{x \cdot \left(y \cdot \left(1 - y\right)\right)} \]

   if 4.00000000000000023e84 < y

   1. Initial program 100.0%

      \[\left(x \cdot y\right) \cdot \left(1 - y\right) \]
   2. Step-by-step derivation

      1. associate-*l* 80.5%

         \[\leadsto \color{blue}{x \cdot \left(y \cdot \left(1 - y\right)\right)} \]

   3. Simplified 80.5%

      \[\leadsto \color{blue}{x \cdot \left(y \cdot \left(1 - y\right)\right)} \]

   4. Taylor expanded in y around inf 80.5%

      \[\leadsto \color{blue}{-1 \cdot \left({y}^{2} \cdot x\right)} \]
   5. Step-by-step derivation

      1. mul-1-neg 80.5%

         \[\leadsto \color{blue}{-{y}^{2} \cdot x} \]

      2. unpow2 80.5%

         \[\leadsto -\color{blue}{\left(y \cdot y\right)} \cdot x \]

      3. associate-*r* 100.0%

         \[\leadsto -\color{blue}{y \cdot \left(y \cdot x\right)} \]

      4. *-commutative 100.0%

         \[\leadsto -y \cdot \color{blue}{\left(x \cdot y\right)} \]

      5. distribute-rgt-neg-in 100.0%

         \[\leadsto \color{blue}{y \cdot \left(-x \cdot y\right)} \]

      6. *-commutative 100.0%

         \[\leadsto y \cdot \left(-\color{blue}{y \cdot x}\right) \]

      7. distribute-rgt-neg-in 100.0%

         \[\leadsto y \cdot \color{blue}{\left(y \cdot \left(-x\right)\right)} \]

   6. Simplified 100.0%

      \[\leadsto \color{blue}{y \cdot \left(y \cdot \left(-x\right)\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 4 \cdot 10^{+84}:\\ \;\;\;\;x \cdot \left(y \cdot \left(1 - y\right)\right)\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(x \cdot \left(-y\right)\right)\\ \end{array} \]

Alternative 5: 55.8% accurate, 2.3× speedup

Math

\[\begin{array}{l} \\ x \cdot y \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (* x y))

C

double code(double x, double y) {
	return x * y;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = x * y
end function

Java

public static double code(double x, double y) {
	return x * y;
}

Python

def code(x, y):
	return x * y

Julia

function code(x, y)
	return Float64(x * y)
end

MATLAB

function tmp = code(x, y)
	tmp = x * y;
end

Wolfram

code[x_, y_] := N[(x * y), $MachinePrecision]

Derivation

1. Initial program 99.9%

   \[\left(x \cdot y\right) \cdot \left(1 - y\right) \]
2. Step-by-step derivation

   1. associate-*l* 94.9%

      \[\leadsto \color{blue}{x \cdot \left(y \cdot \left(1 - y\right)\right)} \]

3. Simplified 94.9%

   \[\leadsto \color{blue}{x \cdot \left(y \cdot \left(1 - y\right)\right)} \]

4. Taylor expanded in y around 0 56.7%

   \[\leadsto \color{blue}{y \cdot x} \]

5. Final simplification 56.7%

   \[\leadsto x \cdot y \]

Reproduce

herbie shell --seed 2023181 
(FPCore (x y)
  :name "Statistics.Distribution.Binomial:$cvariance from math-functions-0.1.5.2"
  :precision binary64
  (* (* x y) (- 1.0 y)))