What's the specific difference between lemma and algorithms?
What's the specific difference between lemma and algorithms?
Lemma and Algorithms
A proven statement used for proving other statements is called a lemma.
A series of well-defined steps used for proving or solving a problem is called an algorithm.
Formally these two have a same set of patterns but exhibit in a different sense.
Let us consider the separation of Euclid's lemma as an example.
In addition to the given positive values 'a' and 'b', there are different numbers '' and '' so that where,
The algorithm is a list of well-defined steps to accomplish a task and a lemma (or theorem) is a proven statement that can be used to solve major problems.
Hence, The algorithm is a list of well-defined steps to accomplish a task and a lemma (or theorem) is a proven statement that can be used to solve major problems.
Lemma and Algorithms
A proven statement used for proving other statements is called a lemma.
A series of well-defined steps used for proving or solving a problem is called an algorithm.
Formally these two have a same set of patterns but exhibit in a different sense.
Let us consider the separation of Euclid's lemma as an example.
In addition to the given positive values 'a' and 'b', there are different numbers '' and '' so that where,
The algorithm is a list of well-defined steps to accomplish a task and a lemma (or theorem) is a proven statement that can be used to solve major problems.
Hence, The algorithm is a list of well-defined steps to accomplish a task and a lemma (or theorem) is a proven statement that can be used to solve major problems.
