2021-2022 The Eighth SoMaS Team Mathematics Challenge
Welcome to the eighth SoMaS undergraduate mathematics team challenge! The challenge is open to all undergraduates. The challenge is a take home team event that consists of a collection of interesting problems suggested by members of staff. These are challenging problems and you should feel proud if you can work out (part of) the solution to any of these problems. You can browse this year's problems below or view the download/print the PDF copy of problems.Problem 1
You are in a room, blindfolded, and either side of you there are two tables with pound coins laid out flat. You do not know how many coins there are on either table, but you are told that the table on your left shows exactly 25 heads while the table on your right shows exactly 7 heads. Your task is to devise a procedure involving moving coins from one table to the other so that both tables show an identical number of heads.
Start with the integers \(1, 2, \dots , 2021\). Choose two of the integers and replace them with their difference, producing a list of \(2020\) integers. Continue the process of replacing two numbers by their difference. After \(2020\) operations, we will end up with a single integer. Can this final integer be \(0\)?
Write a Python programme which:
- is less than \(256\) characters long;
- would generate the longest string of nines that you can (and then stop).
\(N\) coins are placed on an infinite chessboard so that each square is either empty or contains exactly one coin. Describe a procedure which only involves flipping coins, so that in the final configuration the difference \(|\#\text{Heads}-\#\text{Tails}| \leq 1\) for each row, and for each column. You should prove that your procedure works for all \(N\).
Let \(A_1, A_2,\dots, A_n\) be distinct subsets of \(\{1,2,\dots , 2021\}\) such that any pairwise intersection \(A_i\cap A_j\) (including the case \(i=j\)) contains an even number of elements. How large can \(n\) be?
Recently T20 men's cricket world cup competition started
between \(16\) teams. It requires teams to score runs at a very fast rate as
there are limited number of overs. In addition to a powerful batsman,
a skilful bowler can also help the team by restricting the runs of the
opponents. Some pitches can support fast bowling which can make it
difficult for the opponents to score many runs. Another possibility is
that the bowler is skilful enough to bowl a Yorker (a ball pitching near
the batsman's feet) from time to time. One of the crucial things with
the Yorker is the angle at which the ball is released from the bowler's
hand. In order to get some idea, consider the figure as shown below:
Considering the constant gravity as the only force acting on the ball, derive the following equation
where \(R\) is the distance between the bowler at O and the batsman at \(B\); \(h\) is the height from where the bowl is released by the bowler. This equation can be used to deduce the theoretical optimum angle \(\theta\). For typical bowling speed, \(v = 30ms^{− 1}\) and acceleration due to to gravity, \(g = 9.81ms^{− 2}\) what realistic values of \(\theta\) exist if \(R = 20m\) and \(h = 2m\)? Give comments.
Judges: James Cranch,
Rekha Jain,
Jayanta Manoharmayum,
Cristina Manolache,
Fionntan Roukema, Dimitrios Roxanos,
Evgeny Shinder.
O.B.S. prize: (overall best submission) !!!Fffans of Dimitrios!!! (Ziyi Ou, Jiachen Qian, and Siyun Wang.)
M.V.S. prize: (most valuable solution) Freya the Fraction and Lizzie the Limit for their solution to Problem 6.
Best team name: Calcoholics (Laura Craig, Amelia Isaacs, Ella Szulakowski)
Honourable mentions: 9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999 and so on (Bartosz Naporowski, Jack Rooney), 6Brocco Lee (Bocheng Su, Shenghan miao, Zhe halo, Zihao shaped, Yi you, Firin Chen), Calcoholics (Laura Craig, Amelia Isaacs, Ella Szulakowski), Cole Gosney (Cole Gosney), Hi \(\rho\sigma\) I’m Jack (Nikilesh Ramesh), It's 42 (Tara Hopson and Namitha Mary Philip), Matthew's Mathematical Misfits (Dominic Little), Me myself and root(-1) (Joseph D Haslam), Pi eating Python (Byron Freeman), The last knight (Bocheng Su, Nier An), The Marc Bernard Experience (Heather O' Donnell, Olivia Brown, Owen Jollands, Evan Aitken, Elisabeth Chen, Howard Atkinson, Ash Taylor, Surajit Rajagopal, Marc Bernard), Square root of 1 + sec squared gerine (Dom Cantrill (they/them), Denisse Cristina Pasco Ku (she/her) and Emily Johnston (she/her)), Thomas (Thomas Chadderton),