# Search results for query: *

1. ### Putnam triangle problem

I drew the corssection along the diagonal like you said i should. I may make logical errors, but i would never make such a gross visual misconception. i really do need to work on thigns that require more computations. I become very intimidated by them and always back down. Though i...
2. ### Putnam triangle problem

Yes to the first part. what was the mistake? I actually know nothing about putnam, some of the problems are fun to solve every now and then, but some problems are annoying.
3. ### Putnam triangle problem

I meant side B. no we don't know their exact values the idea is the find which angles(value of the paramtre a) gives the lowest perimeter. The only difference is that ti'll be fully sinosoidal and the root will be eliminmated whihc helps greatly but still. Also how the hell did THIS problem...
4. ### Putnam triangle problem

What other ways are there to compute it(i'm not really interested in this problem but the fact that i don't know the solution is making me upset). i have an other idea as to how but its probably going to turn out ugly anyway.
5. ### Putnam triangle problem

ok this is what i did. First thing I did was , use the sine law to determine side N. I got what you would expect (sin2a/sina)A=B. Now of course B(sina/sin2a) is constant. I will let sin2a/sina equal u i then used the law of cosines to determine the side that is opposite to the obtuse angle. I...
6. ### Putnam triangle problem

how should i go about proving it? Is the solution computation intensive?
7. ### Putnam triangle problem

1. given a triangle with sides A, B and C, where angle a is equal to 2b ,side A is fixed and angle c is obtuse what is the minimum possible perimetre? 2. The cosine law and the sine law are relevant 3.I tried to mkae function of the square of the preimrtre but the computations...
8. ### Discret mathematics problem

Yes its just that and I'd like to know how to prove what combination requires the greatest number of moves.
9. ### Discret mathematics problem

Given n marbles arrayed in a square with n+1 slots(slot n+1 being empty(labelled with numbers from 1 to n+1) you have to bring them all from their orginal positions to a position in whcih bringing them back woudl take the most moves. The rule is to move each marble to the adjacent square...