Search Results for ""

The second blackboard problem in the 1997 film Good Will Hunting asks for all the series-reduced trees (referred to by the alternate term "homeomorphically irreducible trees" ...

Given a function f(x), its inverse f^(-1)(x) is defined by f(f^(-1)(x))=f^(-1)(f(x))=x. (1) Therefore, f(x) and f^(-1)(x) are reflections about the line y=x. In the Wolfram ...

The trace of an n×n square matrix A is defined to be Tr(A)=sum_(i=1)^na_(ii), (1) i.e., the sum of the diagonal elements. The matrix trace is implemented in the Wolfram ...

A New Kind of Science is a seminal work on simple programs by Stephen Wolfram. In 1980, Wolfram's studies found unexpected behavior in a collection of simple computer ...

The pseudosquare L_p modulo the odd prime p is the least nonsquare positive integer that is congruent to 1 (mod 8) and for which the Legendre symbol (L_p/q)=1 for all odd ...

Algebra

The finite difference is the discrete analog of the derivative. The finite forward difference of a function f_p is defined as Deltaf_p=f_(p+1)-f_p, (1) and the finite ...

Machin-like formulas have the form mcot^(-1)u+ncot^(-1)v=1/4kpi, (1) where u, v, and k are positive integers and m and n are nonnegative integers. Some such formulas can be ...

The computation of points or values between ones that are known or tabulated using the surrounding points or values. In particular, given a univariate function f=f(x), ...

There are two problems commonly known as the subset sum problem. The first ("given sum problem") is the problem of finding what subset of a list of integers has a given sum, ...