Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

What position does each man fill? Submit a listing and a run of your program. (Note: For your reference, see the Bank Employee example in

image text in transcribed

image text in transcribed

What position does each man fill? Submit a listing and a run of your program. (Note: For your reference, see the Bank Employee example in Lecture 11 and the code lecture10andil.py) 3. (16pts) Variation on Ch4-4.4 #16 Prove that for all integers a, b,c,d and a= 0, b = 0, d = 0, if ab, djc, b|d, then a? |(11c2d-2ab + b3 ). Prove statements 15 and 16 directly from the definition of divisibility 15. For all integers a, b, and c. if a band ale then al(b+c). Answer + Proof: Suppose a, b, and care any integers such that a band al. [We must show that a|(+c). By definition of divides, b = ar and eas for some integers r and s. Then b+c= ar + as = als) by algebra. Let t=r+s. Thent is an integer (being a sum of integers), and thus b + c = at where t is an integer. By definition of divides, then, a|(b + c) (as was to be shown]. 16. For all integers a, b, and c. if a b and a c then a|(b c). Answer + Hint: The conclusion to be shown is that a certain quantity is divisible by a. To show this, you need to show that the quantity equals a times some integer. 17. For all integers a, b, c, and d, if alcand bld then abled. 18. Consider the following statement: The negative of any multiple of 3 is a multiple of 3. a. Write the statement formally using a quantifier and a variable. Answer integers n if n is a multiple on then -n is a multiple of 3. b. Determine whether the statement is true or false and justify your answer. Answer + The statement is true. Proof: Suppose n is any integer that is a multiple of 3. [We must show that -n is a multiple of 3.] By definition of multiple, n = 3k for some integer k. Then -n - (3) by substitution =3(-5) by algebra. Now -k is an integer because k is. Hence, by definition of multiple, -n is a multiple of 3 (as was to be shown] What position does each man fill? Submit a listing and a run of your program. (Note: For your reference, see the Bank Employee example in Lecture 11 and the code lecture10andil.py) 3. (16pts) Variation on Ch4-4.4 #16 Prove that for all integers a, b,c,d and a= 0, b = 0, d = 0, if ab, djc, b|d, then a? |(11c2d-2ab + b3 ). Prove statements 15 and 16 directly from the definition of divisibility 15. For all integers a, b, and c. if a band ale then al(b+c). Answer + Proof: Suppose a, b, and care any integers such that a band al. [We must show that a|(+c). By definition of divides, b = ar and eas for some integers r and s. Then b+c= ar + as = als) by algebra. Let t=r+s. Thent is an integer (being a sum of integers), and thus b + c = at where t is an integer. By definition of divides, then, a|(b + c) (as was to be shown]. 16. For all integers a, b, and c. if a b and a c then a|(b c). Answer + Hint: The conclusion to be shown is that a certain quantity is divisible by a. To show this, you need to show that the quantity equals a times some integer. 17. For all integers a, b, c, and d, if alcand bld then abled. 18. Consider the following statement: The negative of any multiple of 3 is a multiple of 3. a. Write the statement formally using a quantifier and a variable. Answer integers n if n is a multiple on then -n is a multiple of 3. b. Determine whether the statement is true or false and justify your answer. Answer + The statement is true. Proof: Suppose n is any integer that is a multiple of 3. [We must show that -n is a multiple of 3.] By definition of multiple, n = 3k for some integer k. Then -n - (3) by substitution =3(-5) by algebra. Now -k is an integer because k is. Hence, by definition of multiple, -n is a multiple of 3 (as was to be shown]

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Informix Database Administrators Survival Guide

Authors: Joe Lumbley

1st Edition

0131243144, 978-0131243149

More Books

Students also viewed these Databases questions

Question

=+How might you explain this phenomenon?

Answered: 1 week ago