Update annotations

Planeshifter · Planeshifter · commit fbd56cf5ef93 · 2019-01-30T21:23:36.000-05:00
diff --git a/lib/node_modules/@stdlib/math/base/special/binet/docs/types/index.d.ts b/lib/node_modules/@stdlib/math/base/special/binet/docs/types/index.d.ts
@@ -21,14 +21,6 @@
 /**
 * Evaluates Binet's formula extended to real numbers.
 *
-* ## Notes
-*
-* -   [Non integer Fibonacci numbers][1]
-* -   [Interpolated Fibonacci numbers - real or complex][2]
-*
-* [1]: https://math.stackexchange.com/questions/798190/non-integer-fibonacci-numbers
-* [2]: https://math.stackexchange.com/questions/589841/interpolated-fibonacci-numbers-real-or-complex
-*
 * @param x - input value
 * @returns real-valued result
 *
diff --git a/lib/node_modules/@stdlib/math/base/special/binomcoef/docs/types/index.d.ts b/lib/node_modules/@stdlib/math/base/special/binomcoef/docs/types/index.d.ts
@@ -21,13 +21,6 @@
 /**
 * Computes the binomial coefficient of two integers.
 *
-* ## Method
-*
-* -   Instead of evaluating the factorial form, which is inefficient and prone to overflow for large inputs arguments, this module computes the following multiplicative representation of the binomial coefficient for integer arguments:
-*
-*     binomcoef( n, k ) = ∏ᵢ₌₁ᵏ(n+1-i / i)
-*
-*
 * @param n - input value
 * @param k - second input value
 * @returns function value
