Scribd
Upload
20 views4 pages

Theorem

Uploaded by

Zhi Yuan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
20 views4 pages

Theorem

Uploaded by

Zhi Yuan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

1) Theorem (∃m∈N)(∃n∈N) (3m+5n=12)

The theorem is false


Proof: By listing all possible m and n
m ≥ 4 and n ≥ 3 cannot be possible as it cannot produce
the equation 3m+5n=12. For m ≥ 4, 3m+5n ≥12. For n ≥3,
3m+5n ≥12. So, m only can be 1,2,3 and n only can be 1,2.
So, m=1 and n=1,3(1) + 5 (1) = 8
m=1 and n=2,3(1) + 5 (2) = 13
m=2 and n=1,3(2) + 5 (1) = 11
m=2 and n=2,3(2) + 5 (2) = 16
m=3 and n=1,3(3) + 5 (1) = 14
m=3 and n=2,3(3) + 5 (2) = 19
Thus, there is no possible combination of m and n that can
fulfil the equation.
2) Theorem: The sum of any five consecutive integers is
divisible by 5 (without remainder).
The theorem is true
Proof: Given 5 arbitrary consecutive integers. Let a be
the smallest integer.
By listing the 5 integers would be:
a, a+1, a+2, a+3, a+4
10 a
The sum of the 5 integers would be 10a.Since 5 = 2a.
There is no remainder, hence the theorem is true.
3) Theorem: For any integer n, the number n +n+ 1 is odd
2

The theorem is true


By assuming if n is odd, n would be odd as the product
2

of two odd numbers is always odd. n +n is even as the


2

sum of two odd numbers is always even.


So n +n+ 1 is odd as an even number + 1 gives a odd
2

number
If n is even, n would be even as the product of two even
2

numbers is always even. n +n is even as the sum of two


2

even numbers are always even.


So, n +n+ 1 is odd as an even number + 1 gives an odd
2

number
4) Theorem: Every odd natural number is of one of the
forms 4n+1 or 4n+3 where n is an integer
Proof: By the division theorem, any number can be
expressed in one of the forms.4n, 4n+1, 4n+2, 4n+3.
So, 4n+1 and 4n+3 are the only odd numbers, Hence,
every odd number is of one of the forms 4n+1, 4n+3
5) Theorem: Prove that for any integer n, at least one of
the integers n+2, n+4 is divisible by 3
Proof: By division theorem, a= qb+r. 0≤r¿|b|
For any integer a, b=3, 0≤r<|3|.r is 0 1 2.
a=3q+r.
a=3(n+2)+2
Hence, n+2, n+4 is divisible by 3.
6) Theorem: A classic unsolved problem in number theory
asks if there are infinitely many pairs of "twin primes",
pairs of primes separated by 2, such as 3 and 5, 11 and
13, or 71 and 73. Prove that the only prime triple (i.e.
three primes, each 2 from the next) is 3, 5, 7.
Proof: By definition a prime triplet can be represented in
the p, p+2, p+4.
By contradiction, suppose p, p+2, p+4 are prime and p¿ 3
.But p cannot be a multiple of 3 as p would be a prime
number. If p is one more than a multiple of 3, then p+2
would not be a prime number. If p is two more than a
multiple of 3, then p+4 would not be a prime number.
Thus, by contradiction the only other situation would be
where p=3 so 3 5 7 is the only prime triplet

7) Theorem: Prove that for any natural number n,2 +2 +2 +… 2 3

+2 =2 −2 n n +1

Proof: By induction
When n=1, left side=2 =2, right side 2 -2=2. 1 2

The equation is checked.


Hence assuming the equation hold true for a natural
number, n.
So, for n+1,
2+2
2
+2 +…+2 +2 =2
3 n n +1 n +1
−2+2
n+1

2 +2 -2=2 -2+2 (By subbing the above equation into the


n +1 n +1 n +1 n +1

new equation)
Hence, the equation holds true for n+1 completing my proof.
8) Proof: Take an arbitrary real number, p
As the sequence tends towards limit L, n→ ∞,theres exists p
¿ n 0→|Mam−ML|< p.Hence, proven
1
9) An example of A would be (1, n ) for n=1,2,3….
n

Proof: Taking an arbitrary n


1
A would be (1,1+
n+1 ).
n +1 A ⊂A . n +1 n

Every element of A would be between the interval→ (0


n

1
¿ x < ).
n
Every element of A would be between the
n +1

1
interval→(0<x< n+1 ).
1 1
So, every element of A is a element of A as n+1 < n
n +1 n

.Hence, A ⊂ A .
n +1 n

1 1
When n→∞ (0, n ).it will tend towards zero so (0, n ¿=(0 ,0)
.But (0,0) means it is a empty set, hence A → ∞,it is a null n

set proving the statement.


1
10) An example of A would be (1, n ) for n=1,2,3….
n

Taking the proof from 9), A is a subset of A . And as n→∞


n +1 n

1
(0, n )→(0,0), so zero will be the only element in the set.
Since, zero is a real number, the statement is proven

You might also like