Smit's blog

Gordian Knot- Mathematical Contest
By Smit, 10 years ago, In English

Felicity Threads, the tenth annual edition of computing festival of IIIT Hyderabad is back.

Presenting the first event of Threads, Gordian Knot, with intriguing problems in mathematics and computing, inspired by Project Euler.

All problems will require some mathematical ingenuity and programming experience. So be prepared to untangle some tough mathematical knots.

Total Prizes worth Rs. 20000.

Please visit http://felicity.iiit.ac.in/~gordian_beta/test/ for more information.

And register now at : http://felicity.iiit.ac.in/threads/register

Event starts on 4th Jan '14 at 1600 hours (IST). Event ends on 5th jan '14 at 1900 hours (IST). check in your time zone : http://www.timeanddate.com/worldclock/fixedtime.html?msg=Gordian+Knot&iso=20140104T16&p1=771

  • Vote: I like it
  • +30
  • Vote: I do not like it

»
10 years ago, # |
← Rev. 2   Vote: I like it +8 Vote: I do not like it

What's with the thread? Site feels OK, but when I go to the contest page I get error 403.
BTW, idea of gordian knot seems great!

→ Reply
»
10 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Can you upload the questions somewhere for upsolving?

→ Reply
»
10 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Will the solutions be uploaded somewhere? I am particularly interested in 3.2, in which a sphere was given and the volume of tetrahedron was to be found out. Can anyone provide a solution?

→ Reply
  • »
    »
    10 years ago, # ^ |
      Vote: I like it +4 Vote: I do not like it

    Volume is 0. It seems that all 4 points belong to the same plane.

    But this solution passed only after 10th sumbit — I don't know why.

    → Reply
    • »
      »
      »
      10 years ago, # ^ |
      ← Rev. 3   Vote: I like it +8 Vote: I do not like it

      Yes, I tried submitting answer with volume as 0. Too bad since I solved 33 and they are giving away prizes for people with 34 solutions. :(

      Edit: Proof for the problem in this link.

      → Reply
      • »
        »
        »
        »
        10 years ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        There was a question on level 0 in which we had to find the number of 15 digit nos. made of 5 and 7 that are divisible by 35. How did find all possible permutations?

        → Reply
        • »
          »
          »
          »
          »
          10 years ago, # ^ |
            Vote: I like it 0 Vote: I do not like it

          You can write a recursive program generating all numbers containing only 5 and 7 (only 2^15 candidates). And count those which are divisible by 5 and 7. As numbers are only 15 digits 64-bit integers should be enough.

          → Reply