Search Results for ""

In the course of searching for continued fraction identities, Raayoni (2021) and Elimelech et al. (2023) noticed that while the numerator and denominator of continued ...

Let S be a nonempty set, then a filter on S is a nonempty collection F of subsets of S having the following properties: 1. emptyset not in F, 2. If A,B in F, then A ...

A folding function is a function that maps the integers Z={...,-3,-2,-1,0,1,2,3,...} onto the nonnegative integers Z^*={0,1,2,3,...}. This type of function arises naturally ...

The Frobenius number is the largest value b for which the Frobenius equation a_1x_1+a_2x_2+...+a_nx_n=b, (1) has no solution, where the a_i are positive integers, b is an ...

The generalized hypergeometric function is given by a hypergeometric series, i.e., a series for which the ratio of successive terms can be written ...

There are two different statements, each separately known as the greatest common divisor theorem. 1. Given positive integers m and n, it is possible to choose integers x and ...

An iterated map is a map that is applied repeatedly to an object. The Wolfram Language function NestList[f, expr, n] gives a list of the results of iterating the function f n ...

The Landau-Mignotte bound, also known as the Mignotte bound, is used in univariate polynomial factorization to determine the number of Hensel lifting steps needed. It gives ...

Levenberg-Marquardt is a popular alternative to the Gauss-Newton method of finding the minimum of a function F(x) that is a sum of squares of nonlinear functions, ...

A linear congruence equation ax=b (mod m) (1) is solvable iff the congruence b=0 (mod d) (2) with d=GCD(a,m) is the greatest common divisor is solvable. Let one solution to ...