666 reputation
417
bio website
location Tehran
age
visits member for 2 years, 6 months
seen Feb 11 at 6:23

Iran Mathematical Olympiad Silver Medalist 2010

Iran Mathematical Olympiad Gold Medalist 2011

International Mathematical Olympiad Bronze Medalist 2012

Studing Mechanical Engineering at Sharif University of Technology


Feb
28
awarded  Critic
Feb
27
comment A question of Logic in Olympiad
Let me explain what was the problem: I translated this question from persian language into English, and, actually both words ''wrong'' and ''false'' go to the same word in persian, namely ''غلط''. when I was translating them, I translated all of the words ''غلط'' to ''false'', except that one, which I translated it to ''wrong''. now when I was reading the problem, I decided to change that one to ''false'' too.
Feb
27
comment A question of Logic in Olympiad
I'v edited my post. thanks.
Feb
27
comment A question of Logic in Olympiad
@magma: I doubt if there will be any official solution, since it appeared in a multiple choice exam, but if there was one, I'll inform you.
Feb
27
revised A question of Logic in Olympiad
a mistake....
Feb
27
comment minimum number of vertices for a specific graph
thanks a lot. really really beautiful!!!!
Feb
27
accepted minimum number of vertices for a specific graph
Feb
27
comment minimum number of vertices for a specific graph
thats really a great example!!! but how to prove there isn't such a graph having smaller number of vertices?
Feb
27
asked A question of Logic in Olympiad
Feb
26
comment minimum number of vertices for a specific graph
what's the advantage of doing that?
Feb
26
asked minimum number of vertices for a specific graph
Feb
25
comment coloring a $4\times 4$ square with $4$ colors
really nice! thanks a lot. the intresting point is, this question was posed for a mathematical olympiad!!!
Feb
23
asked coloring a $4\times 4$ square with $4$ colors
Feb
21
comment two shapes in a $2n\times 2n$ grid sheet, can we pick third one?
@GerryMyerson: I'm really sorry about that, I forgot to write something there. for each $n\in \mathbb N$, the $L$ shape figure containing $2n-1$ squares works in the sense that if we cut three of them out of the sheet, there is no space for another one to be cut. I forgot the word three. sorry again.
Feb
20
comment two shapes in a $2n\times 2n$ grid sheet, can we pick third one?
Beautiful and elegant solution for this case. can we generalize it to all large $n$? and another question, with the same conditions as above, suppose we have cut one copy of $L$ out of the sheet, can we always cut a second one?
Feb
20
accepted two shapes in a $2n\times 2n$ grid sheet, can we pick third one?
Feb
20
comment two shapes in a $2n\times 2n$ grid sheet, can we pick third one?
yes, they are counted as copies.
Feb
19
asked two shapes in a $2n\times 2n$ grid sheet, can we pick third one?
Feb
17
comment A subspace is the direct sum of two others
I wrote exactly the question's statement. I don't know what condition was in mind of our teacher.
Feb
17
asked A subspace is the direct sum of two others