English-Wörter für 'Alternative form of Pythagorean theorem.'
Oben finden Sie Wörter zu "Alternative form of Pythagorean theorem.". Bewegen Sie den Fokus oder Mauszeiger auf ein Wort, um die Definition anzuzeigen.
Suchergebnisse
adj
noun
verb
noun
- (logic) A syntactically correct expression that is deducible from the given axioms of a deductive system.
- (mathematics) A mathematical statement of some importance that has been proven to be true. Minor theorems are often called propositions. Theorems which are not very interesting in themselves but are an essential part of a bigger theorem's proof are called lemmas.
- (mathematics, colloquial, nonstandard) A mathematical statement that is expected to be true.
- a proposition deducible from basic postulates
- an idea accepted as a demonstrable truth
noun
- (mathematics) A method of proof which, in terms of a predicate P, could be stated as: if P(0) is true and if for any natural number n>0, P(n) implies P(n+1), then P(n) is true for any natural number n.
- a means of proving a theorem by showing that if it is true of any particular case, it is true of the next case in a series, and then showing that it is indeed true in one particular case.
noun
- (mathematics) A polynomial P(r) corresponding to a homogeneous, linear, ordinary differential equation P(D) y = 0 where D is a differential operator (with respect to a variable t, if y is a function of t).
- (linear algebra) The polynomial produced from a given square matrix by first subtracting the appropriate identity matrix multiplied by an indeterminant and then calculating the determinant.
adj
- (mathematics) of a particular kind of eigenvalue problem involving a nonlinear function on the reals that is continuous, positive, and monotone.
- for scriptstyle λ>0 under the assumption that scriptstyle f: ℝ→ ℝ is continuous, positive, monotone. For this reason such problems were named positone... If the nonlinearity scriptstyle f: ℝ→ ℝ is continuous, monotone and scriptstyle f(0)<0,...then the eigenvalue problem is called semipositone...
adj
- (logic) in intuitionistic logic, a proposition P is decidable in a given theory if it can be proven from the theory that "either P or not P", i.e. in symbols: P∨¬P.
- capable of being decided.
- (computer science) describing a set for which there exists an algorithm that will determine whether any element is or is not within the set in a finite amount of time.
noun
noun
noun
- (mathematics) A method of proof which, in terms of a predicate P, could be stated as: if P(0) is true and if for any natural number n>0, P(n) implies P(n+1), then P(n) is true for any natural number n.
- a means of proving a theorem by showing that if it is true of any particular case, it is true of the next case in a series, and then showing that it is indeed true in one particular case.
noun
- (mathematics) A polynomial P(r) corresponding to a homogeneous, linear, ordinary differential equation P(D) y = 0 where D is a differential operator (with respect to a variable t, if y is a function of t).
- (linear algebra) The polynomial produced from a given square matrix by first subtracting the appropriate identity matrix multiplied by an indeterminant and then calculating the determinant.
noun
verb
noun
- (logic) A syntactically correct expression that is deducible from the given axioms of a deductive system.
- (mathematics) A mathematical statement of some importance that has been proven to be true. Minor theorems are often called propositions. Theorems which are not very interesting in themselves but are an essential part of a bigger theorem's proof are called lemmas.
- (mathematics, colloquial, nonstandard) A mathematical statement that is expected to be true.
- a proposition deducible from basic postulates
- an idea accepted as a demonstrable truth
adj
adj
- (mathematics) of a particular kind of eigenvalue problem involving a nonlinear function on the reals that is continuous, positive, and monotone.
- for scriptstyle λ>0 under the assumption that scriptstyle f: ℝ→ ℝ is continuous, positive, monotone. For this reason such problems were named positone... If the nonlinearity scriptstyle f: ℝ→ ℝ is continuous, monotone and scriptstyle f(0)<0,...then the eigenvalue problem is called semipositone...
adj
- (logic) in intuitionistic logic, a proposition P is decidable in a given theory if it can be proven from the theory that "either P or not P", i.e. in symbols: P∨¬P.
- capable of being decided.
- (computer science) describing a set for which there exists an algorithm that will determine whether any element is or is not within the set in a finite amount of time.