程序代写代做代考 C MATH1061/7861, Mon 24 Aug 2020 Question 1. Prove, disprove, or salvage if possible:

MATH1061/7861, Mon 24 Aug 2020 Question 1. Prove, disprove, or salvage if possible:
For any integers a and b, if a | b then a ∤(b+1).
iii Statement fdj
1
it statement fake
Counterexample
albel since 112 New theorem salvaged
V qb.tk
Dooly
if alb and at
by Contradiction
at II
Their beak for some Kea
a
a
Obed bet Klotz
3 3713
1 1lb
l
alb since ill
la ka il la
a
I laka
then
let alb and LHS the
albtl Mls false
If b’t
albel
btl
if
μ
a Ceh
3 Contradict
But i
Ifa II ayfats
II at btl
Marmmm
and
al for some lez
i I bti b al ah all k i all But only divisors of 1 are Il
and bet
I all
12
z

Mod:
0In 010
i
a
no
Il
Ok for some
CONTRADICT ON key t
a
n
n10
a ≡ b (mod d) means a and b leave the same remainder, or equivalently, d | (a−b)
Tau
but
0th for any
a mod d = r means this remainder is exactly r, and in particular, 0 ≤ r < d mod 5 i 6 H6avesamere 6 Ig 14E9E 4EIE611162126E Carol5 tbhHHHHH w Hr OE answer L 5 61 O rF o divides 0 yes fi Does EEEatame May such as because 20 answer L aeries negate w needaO0sc 20 4 5 Question 2. 475J 9 ◦ What are the floor and ceiling of −42/5? 8.4 L ◦ What are the quotient and remainder when dividing n = −42 by d = 5? r 3 ◦Whatis−42mod5? 3 4357 8 g 9 since Is 42 a 42 ◦Is−42≡42(mod5)? NON diff 42 C42 84fM.o5 ◦ Is −42 ≡ 42 (mod 4)? ◦ Determine all the integers between 10 and 20 that are congruent to −42 modulo 5. r7 8.4 is Tim 40 1f 9.5 rod L d a q 42 I p 45 45 42 5 40 ppg because because 142 MO4 iN 40 42 44 g equivalent according to some 142 r t 42 E 42 mod mod 4 Zay 42 2 mod 4 2 42 mod 4 4,444g yo q.TT YEI YEI b 42 C42 84 i a 5 f 45 on E'Tasted plats IR Th 3 3.1 3.14 3.141 2 3 Et M 0.999999 of Question 3. Let n be any odd integer. ◦ Prove that n2 mod 4 = 1. ◦ Write a formula for⎣n2/4⎦without using the floor or ceiling symbols. 9 1.00000 a i n 264 I l 41a n is odd D2 2kt htt 462 46 yay n 4k i remainderi4 If or n is odd but 9 4k 12 E I ar 3 mod 4 of e 1.1 NZ mod i Operations access I Eitloway nfl e 2 n 3 m 26kt seven M SETS n nz Por 32 i n EIar 9 E l mod 4 mod justwork mod mod 4 4 modd i 4 Question 4. Suppose that a mod 6 = 4 and b mod 6 = 3. ◦ Determine (a + b) mod 6. ◦ Determine ab mod 6. 2 ◦ Determine (5a2 + 2b) mod 6. atb ab I 4 13 7 I 4.3 mod 6 Conod 6 mock c 592 mm 2b Cf E 8Ezmad6 Question 5. Let n be any positive integer. ◦ Prove that 3 | n if and only if the sum of the digits of n is divisible by 3. ◦ Prove that 9 | n if and only if the sum of the digits of n is divisible by 9. ◦ Prove that 11 | n if and only if the alternating sum of the digits of n is divisible by 11. The alternating sum of a sequence a, b, c, d, e, ... is the sum (a − b + c − d + e − ...). Theorem. There are infinitely many primes. Challenge (Last week). Prove the following statement: For all m ∈ N, if m, m + 2 and m + 4 are all prime, then m = 3. DIVISION mod Canal T 6 6 2 E T 8 CANNOT Divisibility alb Fleetest bi ka 8 daision ans 1.0 V i00 D FEE odd mod i 0 should NOT WELL a number NIM d Cmod be DEFINED d