lementary Number Theory and Methods of Proof

lementary Number Theory and Methods of Proof

1. disprove: For all real numbers a and b, if a <b then a^2 <b^2

2. prove: the product of any even integer and any integer is even.

3. prove: for all intehers a,b and c, if a|b and a|c then a|(b-c)

4-prove that the square of any integer has the form 3k or 3k+1 for some integer k.

hint: use the quotient-remainder theorem to show that the integer can be written in one of three forms.

5. prove by contradiction: there is no greatest negative real number.

"You need a similar assignment done from scratch? Our qualified writers will help you with a guaranteed AI-free & plagiarism-free A+ quality paper, Confidentiality, Timely delivery & Livechat/phone Support.

Discount Code: CIPD30

Click ORDER NOW..