Scribd
Upload
22 views1 page

Tutorial 1

The document contains two proofs: 1) A proof that there exists a prime number larger than any given natural number n. It constructs a number m and logically shows m must be prime or have a prime divisor larger than n. 2) A proof that for the largest known prime number k, either there exists a prime pair (p1, p2) where p1 > k, or not. It simply states this must be true or not true with no logical steps. The proofs differ in their approaches, with the first constructing and logically analyzing a number m, while the second provides no logical steps to support its claim. The second proof is missing logical steps to substantiate its claim and conclusion

Uploaded by

AVISHA GUPTA
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
22 views1 page

Tutorial 1

The document contains two proofs: 1) A proof that there exists a prime number larger than any given natural number n. It constructs a number m and logically shows m must be prime or have a prime divisor larger than n. 2) A proof that for the largest known prime number k, either there exists a prime pair (p1, p2) where p1 > k, or not. It simply states this must be true or not true with no logical steps. The proofs differ in their approaches, with the first constructing and logically analyzing a number m, while the second provides no logical steps to support its claim. The second proof is missing logical steps to substantiate its claim and conclusion

Uploaded by

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

Department of Computer Science & Information Systems

1st Sem. 2014-15 CS F214 Logic In Computer Science


Tutorial 1
Topic: Proofs and Reasoning
[Note:
 This is an exercise in learning by thinking.
 Do NOT consult a book or a website or a senior – if you do so, you are not learning :(
 However you are encouraged to consult/discuss/argue with other students in your class.

End of Note.]

Exercise:

Consider the following proofs:

I. Claim: There exists a prime number larger than any given natural number n.
Proof: Consider m = (1*2*...*n)+1. Either m is prime or it is not.
Case m is prime : We are done.
Case m is not prime: m is not divisible by any j, where 1<= j<= n. Therefore m
must have a divisor that is larger than n, and that divisor must be prime.

II. Claim: A prime pair (p1, p2) is defined as a pair of primes p1 and p2 such that p2 = p1 +
2. Consider the largest known prime number, say k. Either there exists a prime pair
(p1,p2) s.t. p1 > k, or not.
Proof: For any statement X, either X is true or not. Therefore the above statement is
true.

and answer the following questions:

(i) What differences do you observe between the two proofs (or between the approaches to
proving the claims)?
(ii) Is there anything missing in either of the proofs? If so, state clearly what is missing and why
that is significant in your view. If not argue that nothing is missing.

Birla Institute of Technology & Science, Pilani Tel: +91 1596 245073
Pilani Campus, Vidya Vihar Fax: +91 1596 244183
Pilani 333031, Rajasthan, India Web: www.pilani.bits-pilani.ac.in

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy