Search Results for ""

If at least one solution can be determined for a given problem, a solution to that problem is said to exist. Frequently, mathematicians seek to prove the existence of ...

A method which can be used to solve the initial value problem for certain classes of nonlinear partial differential equations. The method reduces the initial value problem to ...

The so-called reaching algorithm can solve the shortest path problem (i.e., the problem of finding the graph geodesic between two given nodes) on an m-edge graph in O(m) ...

A shortest path between two vertices of a graph is a graph path of shortest possible length between them. Such paths are also known as graph geodesics, and the matrix giving ...

The number two (2) is the second positive integer and the first prime number. It is even, and is the only even prime (the primes other than 2 are called the odd primes). The ...

Let s(n)=sigma(n)-n, where sigma(n) is the divisor function and s(n) is the restricted divisor function. Then the sequence of numbers s^0(n)=n,s^1(n)=s(n),s^2(n)=s(s(n)),... ...

It is thought that the totient valence function N_phi(m)>=2, i.e., if there is an n such that phi(n)=m, then there are at least two solutions n. This assertion is called ...

Let E_1(x) be the En-function with n=1, E_1(x) = int_1^infty(e^(-tx)dt)/t (1) = int_x^infty(e^(-u)du)/u. (2) Then define the exponential integral Ei(x) by E_1(x)=-Ei(-x), (3) ...

Define the abundancy Sigma(n) of a positive integer n as Sigma(n)=(sigma(n))/n, (1) where sigma(n) is the divisor function. Then a pair of distinct numbers (k,m) is a ...

n Sloane's 2^n 3^n 4^n 5^n 6^n 7^n 8^n 9^n 1 A000027 2 3 4 5 6 7 8 9 2 A002993 4 9 1 2 3 4 6 8 3 A002994 8 2 6 1 2 3 5 7 4 A097408 1 8 2 6 1 2 4 6 5 A097409 3 2 1 3 7 1 3 5 6 ...