Look out for answers to today’s puzzles tomorrow!
Day 1
Here’s a riddle!
A driver speeds down a winding road, The distance known, the time it bestowed. Though speed may vary, a truth I defend, There’s a hidden moment where the slope will transcend.
I judge not the fastest nor the slowest pace, But a point where the change finds its middle space. Though unseen, it exists, a theorem’s decree, This hidden balance, the answer for thee.
What am I?
Solution to Q1
Mean value theorem.
What’s this?

Solution to Q2
Rome wasn’t built in a day.
Marcus’ Pacific Adventure
After SIMC2.0, Marcus decided to go canoeing across the supercalifragilisticexpialidociously wonderful Pacific Ocean, which spans 15,500km (9,600 mi), which Marcus decides to round to 16,000km (10,000mi) as he hates distances that are not very round. However, he has very little energy, so he wants to figure out the least amount of energy he needs to exert to make it across the ocean. Marcus also has his school exams in 20 days, so he wants to make sure that one trip across the ocean is only 10 days.
Marcus enlisted the help of his scientist friend, Anna, to help him calculate the distance he can paddle daily.
He knows that he can paddle an integer k metres in a day (he is not very good at ultra-precise canoeing), and that since he has barely any space to put food on the boat, his metres travelled per day d, also must decrease, according to this:
k/1 + k/2 …… k/9 + k/10
However, Marcus lives in a landlocked country, so Marcus took out a loan and spent a boatload of money on a 1:10000 scale model of the Pacific Ocean. As a result, he can only buy poor quality boats that break after one use. He also wants to minimise the amount of times he falls into his ‘ocean’.
What is:
a) the least amount of boats Marcus needs, and
b) the least amount of metres Marcus needs to paddle on the first day (if he is on the 1:10000 model)?
Solution to Q3
We can use binary searching in order to figure this out.
For example, let’s say that Marcus had a 1:1000000 scale model, and hence the amount of metres is 16m.
It is known that k must be in the range of [0, 16]. Hence, take that:
and the median is (hi+lo)/2 = 8. If k is not enough to pass the distance of 16m after 10 days, lo is then at least +1. (As all lower medians will not pass). Else, if k is more than enough to pass the distance, you can store the answer of k, and check if a lower median is enough to pass as well, by -1 from hi.
In the worst-case scenario, for 16, you must do 4 checks, for example:
0-16 where (16/2) = 8 is too high.
0-7 where (7/2 rounded down) is too low.
4-7 where (11/2 rounded down) is too low.
6-7 where (13/2) is either too low or too high, giving you the answer of either 6 or 7.
From this, use logical reasoning to narrow down the search too.
Hence, least amount of boats he needs is log2(1600) rounded up, which is equal to 11.
If Marcus wants to travel 1600m in 10 days, Marcus must travel at least 548m on his first day.
Now do this crossword!

ACROSS
1 To find your way
4 Sound when you hit, sound with your lips
5 Wash and repeat
7 Sodium hydroxide
DOWN
1 Outlook competitor
2 System for announcements
3 Abbreviation for excuse
6 Abbreviation for the Big Apple
Solution to Q4
1-A: GPS
4-A: SMACK
5-A: RINSE
7-A: LYE
1-D: GMAIL
2-D: PA
3-D: SCUSE
6-D: NY
Dance Monkey Concert
After SIMC2.0, there is a Dance Monkey concert happening in Bananaland! Ingrid wishes to go to see his favourite artist while they are touring in Bananaland.
In Bananaland, their economy is completely bananas! They also do not offer the exchange of currency, hence when Ingrid reaches Bananaland, he is practically penniless. Furthermore, Bananaland even has a 4 banana entrance fee!
At the entrance he picks up the Bananaland Brochure. Help Ingrid get to the theater to see the Dance Monkey concert on time!

Solution to Q5
The key is to go in big anti-clockwise loops. By doing this on a large enough scale, it is possible to start heading downwards by doing multiplication negatively. This makes it possible that the city can owe Ingrid money.
As this is a large grid, there are many solutions to this problem. The ‘best’ solution we have found after the ticket price is that the city owes Ingrid 86 bananas.
Alas, it is all for naught, as Ingrid will spend all of his remaining bananas on limited-edition Dance Monkey Banana Merch.
Day 2
Another riddle?!
I am like two-face, but my species is featured in a star trek name; a ghost’s favourite word is in my name, and I’m usually a pessimist. What am I?
Solution to Q1
Boolean
Lying on the Road
Samantha and Ingrid just met a girl called Clara while taking a taxi together to the shopping mall.
Samantha and Ingrid are transit fanatics (or possibly stalkers) who want to know what bus number Clara takes to school.
“I take a bus number of 3 digits. All digits are between 1 and 4 in my bus number because I am superstitious. My bus number has a digit sum of 7. The last digit is even.” said Clara.
Clara tells Samantha the first digit of the bus number, and Ingrid the second digit of the bus number.
“I don’t know the bus number,” said Ingrid.
“Oh! Now I know the bus number! Ingrid doesn’t though.â€
“Hey! I do know the bus number!” rebuked Ingrid.
Who is lying?
Solution to Q2
Ingrid.
After all the conditions, the remaining bus numbers must be:
322
412
124
214
232
142
Since Ingrid doesn’t know the bus number, the second digit is non-unique:
322
412
214
142
Samantha now therefore definitely knows the bus number, as all first digits are unique. However, Ingrid does not, as there are two pairs of non-unique digits.
Ingrid is lying.
Riddle again!
What is it called when Trigon tried making a half omelet but failed?
Solution to Q3
Trigonometry
SIMCFWAIEODBT
After SIMC2.0, Clara opened a dragon boating club with Marcus, in his 1:10000 model Pacific Ocean, in the process, they opened signup forms to form the newest SIMC’s Fabulous, Wonderful, Amazing, Insightful, Excellent, Outstanding Dragon Boating Team; or SIMCFWAIEODBT for short.
Their sponsor, the FWAIEODBS (Fabulous, Wonderful, Amazing, Insightful, Excellent, Outstanding Dragon Boating Society) offered to provide them with an unlimited supply of dragon boats, with the caveat that each boat could only hold 4 or 11 people.
Clara and Marcus believe in the power of friendship, and that everyone should be able to participate. Hence, they want to ensure that every person can participate in any competition the FWAIEODBT joins, given that no one gets sick. Also, the dragon boats must be at full capacity, else they will capsize immediately. How many starting members do they need to ensure that even if any number of new members join, every member would be able to participate in the FWAIEODBC (Fabulous, Wonderful, Amazing, Insightful, Excellent, Outstanding Dragon Boating Competition)?
In other words, what is the minimum amount of people such that
i) they can be arranged into groups of 4 or 11, and
ii) no matter how many more people are added, they can still be arranged into these groups?
Solution to Q4
This is adapted from the Chicken McNugget Theorem, which states that for any two relatively prime numbers m, n, any number greater than mn – m – n can be expressed as am+bn.
In this case, let m = 4 and let n = 11.
Then mn – m – n = 29.
As 29 is the highest number that cannot be expressed as 11a + 4b where a and b are integers, the answer is 29 + 1 = 30.
More crosswords!

ACROSS
2 It’s a snake that runs programs
4 Polynomials to a second degree
7 Set of rules in CS
8 _______ for nerds
DOWN
1 Art of breaking codes
3 Greetings from ________
5 Newton and his German counterpart created this
6 1s and 0s
Solution to Q5
1) CRYPTOGRAPHY
2) PYTHON
3) SINGAPORE
4) QUADRATICS
5) CALCULUS
6) BINARY
7) ALGORITHM
8) STATISTICS
‘Collaborative’ Effort
Samantha is building an art piece for her art gallery, conveniently situated on an island in the middle of Marcus’ Pacific Ocean. Being the eccentric he is, Marcus stipulates that Samantha change her art piece to fit the ‘vibe’ he has going on.
At first, Samantha paints the number 2024……
“No. I want a square number inside it.†Marcus stipulated, his dissatisfaction shining clearly.
Samantha painted over a digit to change it up.
“Mm, not big enough. I want a bigger square number!â€
“I want the 5th power!!!â€
“Eh… I want a digit sum of 13!â€
“You know what would be nice? A perfect cube!!!â€
“Ugh…… it looks wrong. Lower it by one.â€
“……not enough…… change the digit sum to 12.â€
“ooh… what if… the first half and second half of the number were consecutive?â€
“oh! you know what it looks like? the current year! CHANGE IT!â€
“wait…… let’s run it back…â€
What is the sequence of numbers Samantha painted, given she changed the number one digit at a time?
Solution to Q6
2024
2025
3025
3125
3325
3375
3374
3324
2324
2024
Day 3
Can you do this?
Using only addition, use eight 8s to make 1000.
Solution to Q1
888 + 88 + 8 + 8 + 8 = 1000
(Reverse) Equationle
This is a variation of Wordle using the same system of hints. Instead of guessing the word and then getting hints, you get two guesses provided for you. Then, you must use the information to guess the equation.
Hints:
Green – the symbol/digit appears in the answer. It is in the correct position.
Yellow – the symbol/digit appears in the answer, but it is not in the correct position.
Grey – the symbol/digit does not appear in the answer at all.
Disclaimer: While we have spent time testing the problem, it is not a guarantee that the solution is unique. Bonus points if you find a solution that we couldn’t!
Tips:
– The equals sign can be anywhere. Use this to your advantage.
– The minus sign appears twice in the second guess provided. One is labelled green and the other is grey. This means that the minus sign cannot appear twice in the answer, and you know the position it appears.
– No negative numbers appear, but digits that are not used in the clues may still be in the answers. Digits can also appear multiple times, unless the clues show otherwise.

Solution to Q2
10 = 16 – 2 * 3
Samantha’s Cipher
Samantha has had enough with hackers intercepting her data. She decides to send an encrypted message to Marcus. Knowing that Marcus is very smart, she decides to give him as little information as possible for decryption. Can you crack the code?
c: 46928213622443123469097690074328728082806820516032793975562
n: 119337986692598647939659482394797649401939472153374378941789
e: 17
Solution to Q3
Answer: simc_so_cool
The underlying encryption algorithm is RSA. The solution is kinda hacky: you’re supposed to use a factorisation database such as factordb in order to get the associated p and q from c. Afterwards, you find the associated λ and d, and derive the message using it. Algorithm can be found in the following wikipedia article.
Day 4
SIMC2.0
It’s that time of the year again…… SIMC2.0! No, silly, not SIMC2.0 in NUSH! This is the Strawberry Ice-Cream Moving Competition 2.0, held in Marcus’ 1:10000 scale Pacific Ocean!
The goal of SIMC2.0 is to transport Strawberry Ice-Cream crates of varying weights across the Pacific Ocean: of 200kg, 500kg, and a whopping 1000kg. The catch is, the boat can only transport two objects (that includes you!) at most at a time, and you only have one boat. Note that you must be at the finish line as well.
Ingrid takes 10 minutes to paddle across the Ocean to the drop-off point. The time taken for the boat to travel across the ocean is (the heaviest thing on the boat/10).
Luckily, Marcus has chipped in with automatic boats and (un)loading systems, which can load the crates without needing Ingrid. Note that the boat cannot change speed, because Marcus didn’t have enough money to afford that feature. Due to a fault in the boat system, it will not run without *something* on it.
Previously, Samantha and Clara both set a joint first place with a time of 170 minutes. Ingrid wishes to beat, or at least tie them. Help Ingrid win SIMC2.0!
Solution to Q1
Firstly, Ingrid should transport the 200kg crate across the ocean, and drop it off at the other side. This takes 20 minutes.
Next, he should go back to the starting line by himself, taking 10 minutes.
Then, he should load the 500kg crate and 1000kg crate on the boat, and ship it off to the other side, before unloading it there. This takes 100 minutes.
Then, he should instruct the loading system to load the 200kg crate on the boat, and ship it towards the starting line where he is. This takes 20 minutes.
Finally, he should board the boat himself, and ride it over to the finish line. This takes 20 minutes.
All in all, the fastest time Ingrid can achieve is 170 minutes, tying Samantha and Clara’s time.
In the end, Samantha, Ingrid, and Clara, win joint first place.
SIMC 2.0 Connections
Click the link below to play!
https://connections.swellgarfo.com/game/-NyWM2-TtiI3P4nKO_MB
Solution to Q2
Purple: First parts of famous mathematicians’ names
- arch (imedes)
- lag (range)
- fib (onacci)
- newt (on)
Yellow: Units with double meanings
- pound
- second
- mole
- yard
Green: Rules for differentiation
- product
- chain
- constant
- power
Blue: Angles
- interior
- reflex
- right
- opposite
Hiding in plain sight
Our SIMC logo has been manipulated! It seems that there is a short message encoded within the image. It is up to you to retrieve it!
The answer which you seek lies within each Least Significant Bit of every pixel.
Solution to Q3
Encoding:
from PIL import Image
image = Image.open('simc.png')
width, height = image.size
assert(width == 8)
hex_values = []
text = 'steganography'
for y in range(height):
char = ord(text[y]) if y < len(text) else None
if char:
for x in range(width):
bit = (char >> (7-x)) % 2
r,g,b = image.getpixel((x, y))
b &= 0b11111110
b += bit
image.putpixel((x,y), (r, g, b))
image.save('out.png')
Decoding:
from PIL import Image
image = Image.open('out.png')
width, height = image.size
assert(width == 8)
for y in range(height):
ans = 0
for x in range(width):
r,g,b = image.getpixel((x, y))
bit = b % 2
ans += bit
ans = ans << 1
ans = ans >> 1
print(chr(ans))
MorzNotez
Marcus wanted to impress Clara with his musical and cryptographical skills. As such, he decided to send her a song, with a hidden message inside. However, Marcus overestimated Clara, and now Clara wants you to help her find the hidden message. Can you find it?
Solution to Q4
If you take the hi-hat as the morse code (closed hi hat → dot, open hi hat → dash), you’ll find the morse code signal … .. — .–. .-.. -.– / .. -. / — — .-. … . / -.-. — -.. . which translates to “simply in morse code†(omg the initials are SIMC!)
Day 5
SIMC2.0 Connections 2
Another one! Click the link below to play!
https://connections.swellgarfo.com/game/-NycDul-cJ6cs0dfNcTs
Solution to Q1
Purple: Locations SIMC participants went to for cultural learning journey (first 5 letters + e)
- change
- little
- marine
- nushie
Yellow: Terms used in the explore problem
- data
- flat
- noise
- pattern
Green: Words meaning ‘explore’
- investigate
- scout
- study
- survey
Blue: Words meaning ‘endeavour’
- aspire
- seek
- stab
- toil
Going Bananas
After the Dance Monkey Concert, Ingrid has no more money, and no way out of Bananaland. So, he decides to get a job at the Bananabank.
At the Bananabank, he needs to collect Bananatax from all of Bananaland’s residents. Note that the grid of Bananaland is now a 4×4 grid, as after the residents of the outer squares went bananas, and separated from Bananaland.
Ingrid needs to visit each house (square) once, and once only, because the residents begrudgingly pay their taxes, and will go bananas if Ingrid returns to their house. Note that Ingrid cannot move houses diagonally.
Thus, he needs to visit all houses only once, before heading to the tax office to deposit the Bananaresidents’ Tax, else he loses his job.
Help Ingrid not lose his job!
Solution to Q2
This is mostly a trick question, as if you do not return to any squares, there is simply no way to get to the Tax Office without missing at least one house.
The trick is, to return back to the Banana Treasury, after visiting one house, since the Banana Treasury is on your side, and will not go bananas if you return. Once you do this, it is very easy to solve the problem.
Lying on the Road (Again)
Samantha, Ingrid, Marcus, and Clara, are playing a game while taking Clara’s bus service to go to her house. In this game, Clara needs to figure out the identities of Samantha, Ingrid, and Marcus: one will lie, one will tell the truth, one will either lie or tell the truth randomly.
Ingrid returned from Bananaland, and taught Samantha and Marcus the Banana Language, Bananese.
In three questions (the bus is nearly at the final stop), Clara must figure out who is lying, who is telling the truth, and who is randomly talking. Note that each question can be only directed to one person. Samantha, Ingrid, and Marcus, will only reply either Ooh-Ooh, or Aah-Aah. Clara does not know which is Yes and which is No.
Can you help Clara win?
Solution to Q3
Clara need not know the intricacies of Bananese. She merely needs to ask Samantha, Ingrid, and Marcus any question: say, if I ask you whether we are on the bus right now, would you answer Ooh-Ooh?
The way you can figure this out is through a three-step method:
- Figure out which two are not saying random things.
- Find out, out of those two, whether they are lying or telling the truth.
- Then, ask it to identify one of the others.
For example:
Ask Ingrid if Samantha is saying random things, and to say Ooh-Ooh if she is.
If Ingrid says Ooh-Ooh:
There are two possibilities: either Ingrid is saying random things, or Ingrid is lying/truthing.
If Ingrid is saying random things, the answer is meaningless, and you can move on (either Samantha or Marcus is lying/truthing)
Else, Ingrid is either lying or truthing.
Either way, you can figure out that Marcus must not be saying random things.
If Ingrid says Aah-Aah:
Conversely, Samantha cannot be saying random things.
Next, go to the person you know isn’t saying random things, and ask them: “If I asked if you are lying, would you answer Ooh-Ooh?â€
Either way, if the answer is Ooh-Ooh, you know that they are lying, and vice versa.
Finally, ask this same person: â€if Ingrid is saying random things, would you answer Ooh-Ooh?â€
Again, either way, through the process of elimination, you can then figure out who is who.
(Example: Marcus is lying: Answer: Aah-Aah -> Ingrid must be saying random things, Samantha is telling the truth)
Audacity
Marcus couldn’t believe it! How could Clara share his song with someone else? He decided to make a song in revenge, trying to pierce your ears in the process. “The Audacity of these people! I’m going to hide another message to subtly show my annoyance!†Naturally, he named the song Audacity. Can you find the hidden message in Audacity?
Solution to Q4
First, view the song in Audacity. Select the tab for the track, and select spectrogram view.
Answer: spectrogram is mind cracking (omg initials spell out simc again!)
Hope you enjoyed the puzzles!

