WTW 124: Bonus question 3

Instructions

1. Submit via google form.

2. Deadline 30 August 2020.

3. The winner for this five bonus points is for the best written up solution.

4. If you get 10 for Assignment 3, then it is only for bragging rights.

5. There will only be one winner each week.

Problem statement
Cody the coder enjoys solving problems with Excel or Python. So can you. He has two problems
for you to tackle:

(a) Cody calls a point in x̄ = hx, y, zi ∈ R3 NICE if x, y √

and z are positive integers. For example
h12, 23, 34i is a NICE point, but h−3, 5, 7i and h13, 17, 2i isn’t NICE points. Cody wants to
determine how many NICE points are on the plane x + 2y + 3z = 2020.

(b) Cody has set S = {hx, y, zi : 0 ≤ x ≤ 3, 0 ≤ y ≤ 4, 0 ≤ z ≤ 5, x ∈ Z, y ∈ Z, z ∈ Z}. He wants

to know how many DISTINCT planes passes through 3 NON-COLLINEAR points in S.

For example points h3, 0, 1i, h1, 2, 1i and h0, 1, 2i are in S and all passes through the plane with
equation x + y + 2z = 5. However the triplet h0, 3, 1i, h2, 1, 1i and h0, 1, 2i in S also passes through
the plane with equation x + y + 2z = 5. So make sure you count the plane x + y + 2z = 5 only
ONCE. Take note the plane with CARTESIAN equation x + y + 2z = 5 or 3x + 3y + 6z = 15 is
the same plane.

Submit details
Submit one report, documenting how you solved it with your answers for a and b in it. Also submit
your source code separately. Make sure your name, surname and student number appears in these
documents.

Quote
“The only way to learn mathematics is to do mathematics.” - Paul Halmos