Wednesday, May 6, 2009

Disadvantageswater Cooled Engines



Usually when we want to prove something in the field of mathematics, we have different methods that allow us to do: direct demonstration, by contradiction, by induction, by counterexample ... etc.
The preference of one method over the other depends on the nature of the problem under study, but in principle they are all perfectly valid if we use logical arguments in them are correct.
In relation to the above article I present a method of infinite descent demonstration. It is believed that the first use of this technique was Fermat and applied it to prove the special case where n = 4 of the theorem that bears his name.
is generally used to prove statements such not P (n) for each n in the set of numbers natural or in a subset of this and it uses the principle of good management of natural numbers, which states that any subset of natural numbers has a least element, ergo, the method of infinite descent is stating:

If there is a subset of N such that P (n) is true, then there should be a minimal element x in N such that P (x ) is true. Then the method is to demonstrate that the fact of trying to find this minimum value x necessarily leads to another value and responding to the same logic, which will in a condition of infinite descent to minimum element sought.
As the principle of good order is a necessary condition in all of the alleged n that make P (n) true and infinite descent as proof that the principle of good order fails, we conclude that there is no satisfying the proposition P.

Let's look better with an example:

show that if v, w are coprime and vw is a square, then v and w are square. We will do this by showing that it is impossible that there are positive integers v and w such that: 1 .-

and w are coprime.
2 .- vw is a square.
3 .- v and w are not both square.

Demo:

qv assume is not a square (In the case of w is the same.) In particular v is different from 1. Thus v is divisible by at least one prime number.
That is: v = Pk
Then vw = Pkw (also said that VW is square: vw = u ²)
thus: u ² = pkm

and the properties of prime numbers: u = Pm

Then vw = u ² equality can be rewritten as follows:
Pkw = (Pm) ² = P ² m² implies that kw = Pm ²
Since P divides the right side of the divide also equal to the left. By the property of prime numbers used above must be divided akoa P w. But P can not divide w because v and w are relatively prime and P divides v. Therefore P divides k, say k = Pv '. Then

kw = Pm ² leads to Pv'w = Pm ², which involves v'w = m²

As v = Pk = P ² v ', a divisor of v' is also a divisor of v, and therefore v 'w no may have common divisors greater than 1 (remember that v and w are coprime). Also, if v 'be a square then v = P ² v' would be a square, but it is not (that's our initial assumption). Thus v 'is not a square.
So the numbers v 'and w satisfy the properties 1 .-, 2 .- and 3 .-
The same argument leads to another positive integer v such that v'''' w also satisfy these three properties. Repeating this process indefinitely we would then have a sequence of positive integers v> v '> v''> ... which decreases indefinitely. Since this is impossible (the positive integers can not decrease indefinitely) we have that is impossible for two positive integers v and w are the three properties above, and therefore this method proves the statement.

Other results can be demonstrated with this method (and it seems that Fermat himself proved to him) are: 1 .- No

triangle may have as a square area.
2 .- Every prime number of form 4n + 1 can be set as the sum of two squares in one and only one way.
3 .- The case n = 4 of Fermat's last theorem.

Greetings.

0 comments:

Post a Comment