WMAT1007 - Discrete Mathematics Assignment

Assignment Task

Questions

1. Construct the truth table for the proposition (p ↔ (¬(r ∨ q))) ̸→ (r ← p), include ALL columns in your working. Simplify the proposition below using the laws of logic seen in class. (x → y) → (x ∧ y).

2. Provide a table of the values for f(x) for each x ∈ Z6.

3. What is the condition that a number d must satisfy so that the equation below has integer solutions? 531x + 411y.

4. Completing the table from part 5.(a), use the extended Euclidean algorithm to find an integer solution (x, y) = (x0, y0) for the equation 531x + 411y = g, where g = gcd(531, 411).

5. Use your solution (x0, y0) for part 5.(c) to find a solution t = t0 to the modular equation below. 411t ≡ 9 (mod 531)

6. Use the Euclidean algorithm to find the greatest common divisor of 531 and 411. g = gcd(531, 411).

This WMAT1007 – Maths Assignment Help has been solved by our Maths Experts at My Uni Paper. Our Assignment Writing Experts are efficient to provide a fresh solution to this question. We are serving more than 10000+ Students in Australia, UK & US by helping them to score HD in their academics. Our Experts are well trained to follow all marking rubrics & referencing style.