I’m working on a Mathematics exercise and need support.
1 attachmentsSlide 1 of 1attachment_1attachment_1
Unformatted Attachment Preview
The following exam is worth 75 points.
While you are completing this exam, you may refer to any of the following:
Materials posted to Ulearn for ILS 4430.
Any textbook, including the ILS 4430 textbooks.
Any website that is purely informational.
You-Tube, Kahn Academy, or similar videos.
You may also discuss problems that are similar to the exam problems with others, including myself.
In reference to completing the specific eight problems on this exam, you may not collaborate with or
obtain help from others in any way. This includes but is not limited to fellow students, friends, family
members, and tutors. Question and answer websites are also prohibited.
If I suspect the work you submit for this exam is not your own, you will need to defend your work in a
Zoom meeting before you receive a grade.
(T12) Problem 1: Classify each pattern as either 0° ,60°, 90°, 120°, or 180°, according to the smallest
angle of rotation in the pattern.
(T13) Problem 2: Classify the following frieze patterns in “Hop-Step-Jump” notation.
(T14) Problem 3: Classify each wallpaper pattern as either p111, p1m1, p1g1, or c1m1.
(T14) Problem 4: Classify each wallpaper pattern as either p211, p2mm, p2mg, p2gg, or c2mm.
(T15) Problem 5: Classify each wallpaper pattern as either p411, p4gm, or p4mm.
(T15) Problem 6: Classify each wallpaper pattern as either p311, p31m, or p3m1.
(T15) Problem 7: Classify each wallpaper pattern as either p611 or p6mm.
(T16) Problem 8: Cross out any vertex configurations that violate the given rule. You may cross out
more than one vertex configuration for each rule.
Rule 1: In a semiregular tiling of the plane, the sum of the vertex angles of the polygons meeting at each
vertex must be exactly 360°.
Rule 3: No semiregular tiling can have four or more different polygons meeting at a vertex. Thus, if a
semiregular tiling has four or more polygons meeting at a vertex, there must be some duplicates.
Rule 4: No semiregular tiling with exactly three polygons meeting at each vertex can have the vertex
configuration k.n.m where k is odd unless n = m.
(T17) Problem 9: Construct the dual tiling of the tiling.
(T17) Problem 10: Circle any of the following tiling modifications that have been used in the Escher-type
tiling. You may circle more than one tiling modification.
(b) glide reflection
(c) midpoint rotation
(d) side rotation
Purchase answer to see full
Classify each pattern
Student has agreed that all tutoring, explanations, and answers provided by the tutor will be used to help in the learning process and in accordance with Studypool’s honor code & terms of service.
Reviews, comments, and love from our customers and community: