0% found this document useful (0 votes)
128 views4 pages

Ross Program 2022 Application Problems

The document provides instructions for applying to the Ross Mathematics Program. Applicants must submit solutions to 3 open-ended math problems by March 31, 2022. The problems involve exploring patterns in modular arithmetic, comparing properties of number systems, and investigating a robot's movements based on rotation angles. The quality of explanations and mathematical rigor will be considered in admission decisions.

Uploaded by

MANTRA JANI
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
128 views4 pages

Ross Program 2022 Application Problems

The document provides instructions for applying to the Ross Mathematics Program. Applicants must submit solutions to 3 open-ended math problems by March 31, 2022. The problems involve exploring patterns in modular arithmetic, comparing properties of number systems, and investigating a robot's movements based on rotation angles. The quality of explanations and mathematical rigor will be considered in admission decisions.

Uploaded by

MANTRA JANI
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Ross Program 2022 Application Problems

ProfsHoarseWailsRoll
This document is one part of the application to the Ross Mathematics Program, and
will remain posted at [Link] from January
through March.
The deadline for applications is March 31, 2022. The Admissions Committee will
start reading applications in April.

Work independently on the problems below. We are interested in seeing how you
approach and explore unfamiliar open-ended math problems, not whether you can
find answers by searching through web sites or books, or by asking other people.
Submit your own work on these problems.
For each problem, explore the situation (with calculations, tables, pictures, etc.),
observe patterns, make some guesses, test the truth of those guesses, and write logical
proofs when possible. Where were you led by your experimenting?
Include your thoughts (but not your scratch-paper) even if you might not have found
a complete solution. If you’ve seen one of the problems before (e.g. in a class or
online), please include a reference along with your solution.
We are not looking for quick answers written in minimal space. Instead, we hope to
see evidence of your explorations, conjectures, proofs, and generalizations written in
a readable format.

The quality of mathematical exposition, the questions you pose,


as well as the correctness and completeness of your solutions to
those questions, are factors in admission decisions.

PDF format is required.


You may type your solutions using LATEX or with a word processor, and then convert
the output to PDF format.
Alternatively, you may scan your solutions from a handwritten paper copy, and con-
vert that file to PDF. (Use dark pencil or pen and write on only one side of the paper.)
Submitting photos of your work is not recommended since file sizes of photos are
often too large. (The Ross system cannot accept files much larger than 5 megabytes.)
Rather than photographs, you might use a “scan” feature on your camera.

1
Problem 1
Let Z denote the set of integers. If m is a positive integer, we write Zm for the system
of “integers modulo m.” Some authors write Z/mZ for that system.
For completeness, we include some definitions here. The system Zm can be represented as the set
{0, 1, . . . , m − 1} with operations ⊕ (addition) and (multiplication) defined as follows. If a, b are
elements of {0, 1, . . . , m − 1}, define:
a ⊕ b = the element c of {0, 1, . . . , m − 1} such that a + b − c is an integer multiple of m.
a b = the element d of {0, 1, . . . , m − 1} such that ab − d is an integer multiple of m.

For example, 3 ⊕ 4 = 2 in Z5 , and 3 3 = 1 in Z4 .


To simplify notations (at the expense of possible confusion), we abandon that new notation and write
a + b and ab for the operations in Zm , rather than writing a ⊕ b and a b.

The sequence of 2-powers is (2n ) = (21 , 22 , 23 , 24 , . . . ).


Evaluating that sequence in Z10 , Z28 , and Z48 , we find
(2n ) = (2, 4, 8, 6, 2, 4, 8, 6, . . . ) (in Z10 ).
(2n ) = (2, 4, 8, 16, 4, 8, 16, . . . ) (in Z28 ).
n
(2 ) = (2, 4, 8, 16, 32, 16, 32, . . . ) (in Z48 ).
Compute (2 ) in Zm for several other numbers m. What patterns do you observe?
n

Here are some questions to guide your work.

(a) That sequence (2n ) appears to repeat after a few initial terms.
Why must such repetition occur for every m?

(b) Let ρ(m) be length of the “tail” of terms that occur before the repeating part
begins. For instance, ρ(10) = 0, ρ(28) = 1 and ρ(48) = 3.
For which m does ρ(m) = 0? When does ρ(m) = 1? When does ρ(m) = 2?

(c) Let o(m) be the period (length of the periodic cycle) of the sequence (2n ) in Zm .
For instance, o(10) = 4 and o(28) = 3 and o(48) = 2.
How is o(m) related to o(2m) ? What about o(m) and o(3m) ?
How is o(35) related to o(5) and o(7)?

(d) Make some conjectures about the patterns mentioned in (b) and (c) above.
Investigate other patterns that such sequences in Zm seem to satisfy, and make
some conjectures.
Can you prove some parts of your conjectures?

2
Problem 2
The number systems Z and Zm (for a positive integer m) were defined in the previous
problem. We also use the notations:
Q is the system of rational numbers.
4Z is the set of multiples of 4 in Z. Similarly for 4Z12 .
Consider the following number systems:

Z, Q, 4Z, Z3 , Z8 , Z9 , 4Z12 , Z13 .

One system may be viewed as similar to another in several different ways.


(a) Let’s measure similarity using algebraic properties. First consider the following
sample properties:

(i) If a2 = 1, then a = ±1.


(ii) If 2x = 0, then x = 0.
(iii) If c2 = 0, then c = 0.

Which of the systems above have properties (i), (ii), and/or (iii)?

(b) Formulate another algebraic property and determine which of those systems have
that property.
Write down some additional algebraic properties and investigate them.

(c) In your opinion, which of the listed systems are “most similar” to each another?

3
Problem 3
Rossie is a simple robot in the plane, with Start position at the origin O and facing
the positive x-axis.
An angle θ is entered into Rossie’s memory. Rossie can take only two actions:
S: Rossie steps one meter in the direction Rossie is facing.
R: Rossie stays in place and rotates counterclockwise through angle θ.
Notation: A string of symbols S and R (read from left to right) represents a sequence
of Rossie’s moves. For instance, SRRSS indicates that Rossie steps one meter along
the x-axis, rotates through angle 2θ, and then steps two meters in that new direction.
In the questions below, consider only those sequences that begin with an S.

(a) When θ = 2π/3 = 120◦ , the actions SRSRSR cause Rossie to trace an equilateral
triangle and return to Start.
What path does Rossie trace when θ = 4π/5 = 144◦ ?
Question: For which θ can some sequence of S and R actions
return Rossie to Start?
(Then by repeating that sequence of actions, Rossie will retrace the same path.)

(b) Suppose θ is the angle pictured below, with cos(θ) = −1/3. Note that θ is
approximately 109.47◦ .
y

With this angle θ, explain why the


actions
SSSRSSRSSS
cause Rossie to return to O. θ

Note: Rossie returns to O but is not facing the positive x-axis.


That is: Rossie ends up at O but has not returned to Start.
Question: With that θ, is there some sequence of the actions S and R that
returns Rossie to Start? Justify your answer.

(c) Provide more examples of θ that allow Rossie to return to O but not to Start.
Is there some way to describe all such angles θ ?

(d) Are there some angles θ for which Rossie can never return to O?
Explain your reasoning.

Common questions

Powered by AI

The sequence of powers of 2, evaluated in different modulo systems, reveals repeating patterns. For instance, in Z10, the sequence (2, 4, 8, 6) is periodic with a period of 4 after no initial tail phase, denoted by ρ(10) = 0 and o(10) = 4. In Z28, the sequence initially develops a tail then cycles with ρ(28) = 1 and o(28) = 3. Such patterns occur because finite sets in modular arithmetic must repeat due to the pigeonhole principle. The repetition starts after a certain number of calculations determined by the modulus. Understanding the relationships, like between o(m) and o(2m), or o(m) and o(3m), requires analyzing these repetitions in terms of divisor interactions, often resulting in a deeper grasp of number theoretical properties .

Using a modular system such as Zm for various modulus values impacts arithmetic operations by creating unique properties for addition and multiplication. In these systems, numbers wrap around after reaching the modulus, forming cyclic groups. For instance, addition and multiplication operations result in numbers that are essentially remainders upon division by m. This modular arithmetic leads to patterns like those seen in the repetitiveness of sequence lengths and periods in different Zm systems. Properties of invertibility, closure, and identity elements also depend on m. When systems like Z4 or Z10 are used, distinct periodicity and behaviors become prominent, influencing broader mathematical understanding and computational applications .

Algebraic similarity among varied number systems is determined by shared properties like closure properties, identity and inverse elements, and operation compatibility. For instance, systems like Z, Zm, Q, and 4Z can be compared by their forms of arithmetic and how they satisfy algebraic conditions, such as distribution or solution resolutions to equations. Mathematically, properties are articulated through structural analysis and algebraic axioms; some systems share exact algebraic versatility (like rings or fields) under operation laws, while others demonstrate divergence due to differing underlying operations or prime moduli. Articulating these similarities involves rigorous component comparison and property examination through direct structural analysis .

Mathematical exploration and proving are central to addressing open-ended math problems as demonstrated by the Ross Program. This approach emphasizes creativity, critical thought, and logical reasoning. Participants are encouraged to explore problems independently, form conjectures, and write logical proofs. By engaging in exploration, patterns are identified and guesses tested, leading to deeper insights into mathematical structures. Writing proofs solidifies understanding and assures rigor in solution processes. This method values the process over the final answer, fostering a deeper appreciation for problem-solving and mathematical reasoning. The Ross Program fosters skills beneficial for real-world applications where complex problem-solving is crucial .

In modular arithmetic systems like Zm, properties such as a² = 1 hold true when a has roots corresponding to elements satisfying the condition under modular constraints, usually ±1 in integer systems. Properties like 2x = 0 manifest in contexts where the modulus share factors with the coefficient, such as m = even, leading to scenarios where multiple solutions exist (as in systems with elements like n/2). Whether these properties hold depends on m’s relation to components of a system; structures of Zm and their arithmetic dictate whether these algebraic identities can manifest, influenced by divisibility and group makeup around specific moduli .

The actions of Rossie showcase geometric properties through sequences of movements and rotations defined by specific angles. For example, when θ = 2π/3 (120°), the sequence SRSRSR allows Rossie to trace an equilateral triangle and return to Start, leveraging rotational symmetry and geometric transformation properties. With θ = 4π/5 (144°), different angular properties and transformations emerge, indicating a 5-fold rotational symmetry typical of a regular pentagon. The nature of angle θ affects whether repetition and symmetry allow Rossie to return to its original position and orientation, as certain angles lead to exactly retracing paths or creating new cycles. These movements offer insights into polygonal symmetry and angular rotations in the plane .

Different number systems exhibit distinct algebraic properties with respect to operations and their structures. For example, in Z, a system of integers, typical properties include closure under addition and multiplication. Similarly, Zm (integers modulo m) supports addition and multiplication defined modulo m, which leads to cyclic structures. For rational numbers represented by Q, operations are based on standard arithmetic but include division by non-zero elements. The system 4Z includes multiples of 4, demonstrating properties like subdivisions within Z. Within Zm, the properties shift based on m's value, impacting characteristics such as invertibility and zero elements. Specific properties are measured through sample properties like (i) involving squaring and its inverse, and (ii) relating multiples and divisors, helping define structural similarities and differences globally .

Yes, there are angles θ for which a robot cannot return to its original starting point or orientation. This outcome is typically governed by the relationship between the chosen angle and its capacity to form a complete cycle or rotation. For example, if the rotational angle is irrational or does not lead to a division of the full 360° cycle in a finite or even divisibility manner, the robot may fail to return to start after completing movements. Conversely, angles that are rational fractions of 2π often allow paths that fully close on themselves, while others lead to spiraling or inconsistent paths that do not achieve the goal of returning precisely to the point and direction of origin .

For a robotic movement sequence to return a robot like Rossie to its starting position while maintaining the original orientation, specific conditions involving angles and movement symmetry need to be met. A sequence must complete a set of movements whose cumulative rotational angle is a multiple of 2π, allowing the robot to realign with its initial orientation. For instance, special cases occur when the rotation angles divide evenly into 2π, such as θ = 2π/3 or certain fractions leading to closed polygonal paths (like triangles or pentagons), ensuring both positional return and correct facing direction. Not all angles allow return to both position and orientation simultaneously, necessitating an understanding of rotational symmetries and divisibility of π by the angle fractions .

The choice of θ critically determines the path traced by a robot as it dictates turning angles and path closure. For instance, specific angles like θ = 120° or θ = 144° result in polygonal paths where the robot returns to its initial position after completing geometric shapes like triangles or pentagons. However, not all angles lead to a return to the start because the accumulation of small angular rotations may not complete a multiple of 360°, crucial for both positional and angular return. Correct selection of θ aligns cumulative rotations to form closed geometric paths like Pythagorean and trigonometric principles highlighting symmetry and periodicity in the plane .

You might also like