Goodarz Mehr
Reputation
721
Top tag
Next privilege 1,000 Rep.
Create tags
 Apr17 comment $6$ points in plane with specific distances But then we get that $BEDC$ is a cyclic quadrilateral! Apr13 comment $6$ points in plane with specific distances I've written how to construct that example. Apr13 revised $6$ points in plane with specific distances added 276 characters in body Apr13 asked $6$ points in plane with specific distances Mar9 accepted a 2 distance set has an upper bound for number of its elements Feb28 awarded Critic Feb27 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. Feb27 comment A question of Logic in Olympiad I'v edited my post. thanks. Feb27 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. Feb27 revised A question of Logic in Olympiad a mistake.... Feb27 comment minimum number of vertices for a specific graph thanks a lot. really really beautiful!!!! Feb27 accepted minimum number of vertices for a specific graph Feb27 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? Feb27 asked A question of Logic in Olympiad Feb26 comment minimum number of vertices for a specific graph what's the advantage of doing that? Feb26 asked minimum number of vertices for a specific graph Feb25 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!!! Feb23 asked coloring a $4\times 4$ square with $4$ colors Feb21 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. Feb20 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?