You are not logged in.
Pages: 1
Please help me...-.-
I'm desperate...
...-.-
Can nobody help me...-.-?
Did someone found out s.th. helpful or anything else at least?
Okay, I understand what you are saying. I think it's helpful, so one only has to prove by using this finding such moves are impossible to get to the set.
Hi.
What you wrote seems to be logic. However, I don't understand what you mean by parity. Could you enlarge on that?
Yeah, you are right.
However, I have tried it quite intensively, I tend to say it is not possible. I am just lacking a proof as I cannot just say I didn't manage to move them...
Hmm, Jane, the method seems to be interesting, however, there are infinite possible final moves...
Moreover, how can I prove a certain move is impossible?
Yes, they are, as long as they don't break the rule: To reposition a point, there must be another point exactly in the middle between the new and the old position. Therefore diaganoal moves are allowed.
Do you understand the task?
I cannot upload any images...
Hi, I really need your help. My Maths teacher wants me to do a presentation on the follwoing problem to improve my Maths mark. I just don't know how to do that task. Please help me.
There are 4 points on a plane coordinate system.
These points have the following coordinates:
1.(0;0)
2.(1;0)
3.(0;1)
4.(1;1)
These 4 points are to be repositioned.
You may only reposition points in the following way:
You may only change the position of a point, if there is another
point exactly in the middle between the original and the new
position of the point.
Now, I have to prove whether or whether not it is possible to
reposition the points, in order to get the following coordinates:
1.(0;0)
2.(1;1)
3.(2;-1)
4.(3;0)
I've tried this little game quite intensively and I'm sure it is impossible but I still can't prove it.
There are 4 points on a plane coordinate system.
These points have the following coordinates:
1.(0;0)
2.(1;0)
3.(0;1)
4.(1;1)
These 4 points are to be repositioned.
You may only reposition points in the following way:
You may only change the position of a point, if there is another
point exactly in the middle between the original and the new
position of the point.
Now, I have to prove whether or whether not it is possible to
reposition the points, in order to get the following coordinates:
1.(0;0)
2.(1;1)
3.(2;-1)
4.(3;0)
Help me...-.-
Uh, please inform me, even if you only find s.th. that might be helpful, I'll appreciate your efforts.
Has anybody found s.th. interesting or helpful yet? (me not -.-')
Hello, that is my problem:
There is a triangle ABC. On the side AC there is a point E and on the side BC there is a point F. Besides you must notice that the line segment AE is as long as the line segment BF. So: AE=BF
Then one examines the circumscribed circles of the two triangles, which are a part of the triangle ABC, AFC and BEC. These circumscribed triangles subtend each other at the point C and at another point D. Finally it is to prove that the line segment with the starting point C and the ending point D is the bisector of the angle gamma (the angle at the point C).Please help me, I am nearly desperate... I just don't know how tpó proof this...
Now the picture matches the exercise, I named s.th. wrong. Now it should be right.
Stanley_Marsh wrote:What? how can the segment CF besect any angle? Name the angle gamma ,I don't really understand ,lol
Segment CF bissects angle gamma.
It's segment CD. Segment CF is a part of the triangle side a. Have a look at the picture.
Did the picture help you to understand my problem?
Here's the solution:
2x+3y=1
5x+3y=16 | 3x=15, x=5
5*5+3y=16
25+3y=16
3y=-9
y=-3
x=5
y=-3
Here's a picture of the problem
Pages: 1