Assignment 9 for COT3100

Assignment 9 for COT3100

Unit 1: Logic and Sets

  1. (10) Draw a truth table for the compound statement .
  2. (15) Use the laws of logic to show that .
  3. (15) Show by any valid method except Venn diagram that .
  4. (35) Given the sets and :
    • (5) Determine which one is a subset of the other.
    • (20) Prove that subset property by universal generalization.
    • (10) Prove by counter-example that they are not equal sets.
  5. (25) Accepting the premises:

 

 

Conclude .

Unit 2: Numbers

  1. (25) Prove by induction that for positive integers , .
  2. (15) Prove that if 7 divides with remainder 1, 7 divides  with remainder 3.
  3. (20) Taking into account identical letters, how many ways are there to arrange the word PARVAMONSTRA that both begin and end with consonants?
  4. (15) How many unique combinations of monsters can a small monster collector capture, if that collector:
    • Has 22 small monster containment devices
    • Intends to use all of those devices
    • Has access to Earth, Fire, Ice, and Steam type small monsters
    • Intends to capture at least three Ice, at least two Earth and at most two Steam type small monsters

For questions 11 and 12, a small monster collector has captured thirty-one Anachronism-type small monsters.  Each Anachronism-type small monster has a 27% chance of being a Phlogiston-subtype and a 47% chance of being an Aether-subtype; it cannot be both.

  1. (5) What is the probability that exactly seven of the captured small monsters are Phlogiston-subtypes?
  2. (10) What is the probability of all but five of the captured small monsters being either Phlogiston- or Aether-subtypes, with those three being plain Anachronism-type monsters of neither subtype?
  3. (10) What is the probability that all thirty-one captured small monsters are either Phlogiston- or Aether- subtypes, with no plain Anachronism-type monsters captured?

Unit 3: Relations and Functions

  1. (15) Let with .  Characterize R in terms of whether it is reflexive, irreflexive, symmetric, anti-symmetric, transitive, complete, any sort of ing relation, and/or an equivalence relation.  This is not a formal proof, but briefly explain your reasoning.
  2. (15) Let with , that is, x and y round up to the sane number.  Characterize R in terms of whether it is reflexive, irreflexive, symmetric, anti-symmetric, transitive, complete, any sort of ing relation, and/or an equivalence relation.  This is not a formal proof, but briefly explain your reasoning.
  3. (15) Let with ; that is,  returns the square of  rounded up.  Characterize  in terms of whether it is injective, surjective and/or bijective.  This is not a formal proof, but briefly explain your reasoning.
Place your order
(550 words)

Approximate price: $22

Calculate the price of your order

550 words
We'll send you the first draft for approval by September 11, 2018 at 10:52 AM
Total price:
$26
The price is based on these factors:
Academic level
Number of pages
Urgency
Basic features
  • Free title page and bibliography
  • Unlimited revisions
  • Plagiarism-free guarantee
  • Money-back guarantee
  • 24/7 support
On-demand options
  • Writer’s samples
  • Part-by-part delivery
  • Overnight delivery
  • Copies of used sources
  • Expert Proofreading
Paper format
  • 275 words per page
  • 12 pt Arial/Times New Roman
  • Double line spacing
  • Any citation style (APA, MLA, Chicago/Turabian, Harvard)

Our guarantees

Delivering a high-quality product at a reasonable price is not enough anymore.
That’s why we have developed 5 beneficial guarantees that will make your experience with our service enjoyable, easy, and safe.

Money-back guarantee

You have to be 100% sure of the quality of your product to give a money-back guarantee. This describes us perfectly. Make sure that this guarantee is totally transparent.

Read more

Zero-plagiarism guarantee

Each paper is composed from scratch, according to your instructions. It is then checked by our plagiarism-detection software. There is no gap where plagiarism could squeeze in.

Read more

Free-revision policy

Thanks to our free revisions, there is no way for you to be unsatisfied. We will work on your paper until you are completely happy with the result.

Read more

Privacy policy

Your email is safe, as we store it according to international data protection rules. Your bank details are secure, as we use only reliable payment systems.

Read more

Fair-cooperation guarantee

By sending us your money, you buy the service we provide. Check out our terms and conditions if you prefer business talks to be laid out in official language.

Read more

Order your essay today and save 30% with the discount code HAPPY