[go: up one dir, main page]
Scribd
Upload
47 views4 pages

Logic Report (Divisibility)

This document discusses key concepts in mathematical logic including theorems, propositions, corollaries, and lemmas. It then defines and provides examples of divisibility, stating that an integer a divides another integer b if there exists an integer k such that ak = b. Some key properties of divisibility are that the sum of integers divisible by a is also divisible by a, and that an integer divides or does not divide its negative.

Uploaded by

Joebel Regnim Roblo
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
47 views4 pages

Logic Report (Divisibility)

This document discusses key concepts in mathematical logic including theorems, propositions, corollaries, and lemmas. It then defines and provides examples of divisibility, stating that an integer a divides another integer b if there exists an integer k such that ak = b. Some key properties of divisibility are that the sum of integers divisible by a is also divisible by a, and that an integer divides or does not divide its negative.

Uploaded by

Joebel Regnim Roblo
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

NAGA COLLEGE FOUNDATION, INC

City of Naga
Penafrancia Avenue, Naga City
Graduate Studies

Name: Joebel C. Regnim


Course & Major: MAEd Mathematics
Course Code: Math ED 210
Description: Mathematical Logic
Professor: Isaias C. Penacilla

THEOREMS, PROPOSITIONS, COROLLARIES, AND LEMMAS

THEOREMS

 May be given special name, for ease of reference

 Important theorems are named after the mathematician who first proved them

 Some theorems are given names that relate to their content or importance

PROPOSITION

 A minor theorem

 Refer to some result that they do not think is sufficiently important to be called a theorem.

COROLLARY

 A result that can be proved very easily from other result

LEMMA

 A minor result that is being used as a stepping step for proving a more significant result

 Mathematicians will separate a lemma from the main proof of a theorem either because the
proof is long and complicated and needs to be broken down into smaller steps, o because it
is a step that needs to be performed repeatedly
DIVISIBILITY

Definition

Suppose a , b ∈ Z .

We say a is a divisor of b (and write “a │ b” iff there exists k ∈ Z , such that ak ∈ b

Can also be written as b=ka

Notation

a ∤ b is an abbreviation for “a does not divide b”

Remarks 17.3. When a is a divisor of b, we may also say:

1. a divides b

2. b is a multiple of a

3. b is divisible by a

Example:

1. We have 5 │30 , because 5 ∙6=30 , and 6 ∈ Z

2. We have 5 ∤27 , because there is no integer k, such that 5 k =27

Exercise:
Fill each blank with │or ∤, as appropriate.

1. 3____18

2. 4____18

3. 5____18

4. 6____18

5. 18____6

6. -6____6
Definition

An integer n is:

even iff 2 │n ;

odd iff 2 ∤n

We will assume the well-known fact that sum, difference and product of integers are
integers; that is, for all k 1 , k 2 ∈ Z , we know that k 1+ k 2 ∈ Z , k 1−k 2 ∈ Z , and k 1 k 2 ∈ Z .

Also the negative of any integer is an integer; that is, for all k ∈ Z , we have −k ∈ Z .

Proposition

Suppose a , b1 , b2 ∈ Z . If a │ b1 and a │ b2, then a │ ¿ ¿).

PROOF:

By assumption, a is a divisor of both b 1∧b2 , there exist k 1 , k 2 ∈ Z ,

Such that a k 1=b1 and a k 2=b2

Let k =k 1 +k 2. Then k ∈ Z and

ak =a ( k 1+ k 2 )=a k 1 +a k 2 =b1 +b2

So, a is a divisor of b 1+b 2, as desired.

Proposition

Suppose a , b ∈ Z We have a │ b iff a │−b

PROOF:

⇒ By assumption, there is some k ∈ Z , such that ak =b

Then −k ∈ Z , and we have a (−k )=−ak=−b

Therefore, a divides –b

⇐ Assume a │−b

We conclude that a │−(−b )−b , as desired.

Proposition

Suppose a , b1 , b2 ∈ Z . If a │ b1 and a ∤ b2, then a ∤¿ ¿ ).


PROOF:

Assume a │ b1 and a ∤ b2

Suppose a │(b ¿ ¿1+ b2) . ¿ (This will lead to contradiction)

Then a is a divisor of both b 1+b 2 and b 1

It is well known that 1 and -1 are the only integers whose reciprocal is also an
integer. In the language of divisibility, this can be restated as the following useful
fact:

For any integer n, we have n │1 iff n=±1

You might also like