Maths Olympiad Daily Problems

If possible, can you please circulate this petition? The Central Government aims to destroy the Indian Statistical Institute via this new Bill and it is very likely that ISI, one of the last remaining institutions of India where there are *zero* tuition and admission fees for the students will likely see fees introduced and the stipends discontinued. D Ravikumar(MP, Tamil Nadu), Economist Jean Dreze, Ramchandra Guha are a few notable people who have signed. We have almost 1000 signatures so far. More details about the Bill can be found here: https://sites.google.com/view/isibill2025

Recovered post

I deeply regret the oversight and apologize for any inconvenience caused. I had no intention of ignoring you; I simply overlooked your replies. I’m very sorry, sir, and I will make sure it does not happen in future.

i think yeah all my accounts are banend without reason

It’s unfortunate to hear that you are banned from discussion group. May I respectfully request that Kel refrain from issuing bans without clear justification?

ig i have solved this one before 2001 sl c3 or c4

i am banned from group

Yes you are correct mr Shams shawan Hoque, Could you kindly enable message reactions when convenient? I’d like to acknowledge messages with a reaction, but the option doesn’t appear to be available.

isnt this the well ordering principle

Let $n > 1$ be a given integer. An $n \times n \times n$ cube is composed of $n^3$ unit cubes. Each unit cube is painted with one colour. For each $n \times n \times 1$ box consisting of $n^2$ unit cubes (in any of the three possible orientations), we consider the set of colours present in that box (each colour is listed only once). This way, we get $3n$ sets of colours, split into three groups according to the orientation. It happens that for every set in any group, the same set appears in both of the other groups. Determine, in terms of $n$, the maximal possible number of colours that are present.

Try!

Try!

Solve

Try!

Try!

Try! *It is compute not complete

Try!

Try!

Try!

Try!