Maths Olympiad Daily Problems

Can someone provide a diagram for this?

Well it’s Kel here VERY NOOB

Try! 😳

Delete this to prevent copyright ©️😘

Allen MWF Lectures Only for Beginners 🤘

🚀 #ProblemMODP 49 Algebra Solve and send ur solution:) Send the solution of RMO Mock

Let there be an n×n grid with only possible entries +1,-1. Find the maximum k such that there exists k rows with positive sum and k columns with negative sums.

Find the minimum value of |SinX + COS X + TAN X+ COSEC X+ SEC X+ COT X|

Credits to @namansethia1

Problem 1. {x} +{x²} +{x³} < 3 € Z (≠0) Find number of solution. 😭 Try , definately you would feel happy after solving this

Solve:

#ProblemMODP 43 There are two boxes. Initially, one box contains m chips and the other contains n chips. Such a position is denoted by (m,n), where m > 0 and n > 0 The two players alternate moving. A move consists of emptying one of the boxes, and dividing the contents of the other between the two boxes with at least one chip in each box. There is a unique terminal position, namely (1,1). Last player to move wins. Find P-positions and N position and how to win game in N position

Guys there is a typo in one question of #ProblemMODP 43 and in RMO Mock There are two boxes. Initially, one box contains m chips and the other contains n chips. Such a position is denoted by (m,n), where m > 0 and n > 0 The two players alternate moving. A move consists of emptying one of the boxes, and dividing the contents of the other between the two boxes with at least one chip in each box. There is a unique terminal position, namely (1,1). Last player to move wins. Find all P-positions.