Search Results for ""

Newton's method, also called the Newton-Raphson method, is a root-finding algorithm that uses the first few terms of the Taylor series of a function f(x) in the vicinity of a ...

Define the harmonic mean of the divisors of n H(n)=(sigma_0(n))/(sum_(d|n)1/d), where sigma_0(n) is the divisor function (the number of divisors of n). For n=1, 2, ..., the ...

The Parry point is one of the two intersections of the Parry circle and the circumcircle of a triangle (the other is the focus of the Kiepert parabola, which is Kimberling ...

Let L, M, and N be lines through A, B, C, respectively, parallel to the Euler line. Let L^' be the reflection of L in sideline BC, let M^' be the reflection of M in sideline ...

Given a set of ordered quantities, a list of the fractions of values at or below each quantity is know as a plotting position. A quantile-quantile plot compares observed ...

The maximum distance between n points in three dimensions can occur no more than 2n-2 times. Also, there exists a fixed number c such that no distance determined by a set of ...

A Pólya plot is a plot of the vector field of (R[f(z)],-I[f(z)]) of a complex function f(z). Several examples are shown above. Pólya plots can be created in the Wolfram ...

Consider a bivariate normal distribution in variables x and y with covariance rho=rho_(11)=<xy>-<x><y> (1) and an arbitrary function g(x,y). Then the expected value of the ...

In its simplest form, the principle of permanence states that, given any analytic function f(z) defined on an open (and connected) set U of the complex numbers C, and a ...

Let sigma(m) be the divisor function of m. Then two numbers m and n are a quasiamicable pair if sigma(m)=sigma(n)=m+n+1. The first few are (48, 75), (140, 195), (1050, 1925), ...