Announcement

Collapse

Forum Rules (Everyone Must Read!!!)

1] What you CAN NOT post.

You agree, through your use of this service, that you will not use this forum to post any material which is:
- abusive
- vulgar
- hateful
- harassing
- personal attacks
- obscene

You also may not:
- post images that are too large (max is 500*500px)
- post any copyrighted material unless the copyright is owned by you or cited properly.
- post in UPPER CASE, which is considered yelling
- post messages which insult the Armenians, Armenian culture, traditions, etc
- post racist or other intentionally insensitive material that insults or attacks another culture (including Turks)

The Ankap thread is excluded from the strict rules because that place is more relaxed and you can vent and engage in light insults and humor. Notice it's not a blank ticket, but just a place to vent. If you go into the Ankap thread, you enter at your own risk of being clowned on.
What you PROBABLY SHOULD NOT post...
Do not post information that you will regret putting out in public. This site comes up on Google, is cached, and all of that, so be aware of that as you post. Do not ask the staff to go through and delete things that you regret making available on the web for all to see because we will not do it. Think before you post!


2] Use descriptive subject lines & research your post. This means use the SEARCH.

This reduces the chances of double-posting and it also makes it easier for people to see what they do/don't want to read. Using the search function will identify existing threads on the topic so we do not have multiple threads on the same topic.

3] Keep the focus.

Each forum has a focus on a certain topic. Questions outside the scope of a certain forum will either be moved to the appropriate forum, closed, or simply be deleted. Please post your topic in the most appropriate forum. Users that keep doing this will be warned, then banned.

4] Behave as you would in a public location.

This forum is no different than a public place. Behave yourself and act like a decent human being (i.e. be respectful). If you're unable to do so, you're not welcome here and will be made to leave.

5] Respect the authority of moderators/admins.

Public discussions of moderator/admin actions are not allowed on the forum. It is also prohibited to protest moderator actions in titles, avatars, and signatures. If you don't like something that a moderator did, PM or email the moderator and try your best to resolve the problem or difference in private.

6] Promotion of sites or products is not permitted.

Advertisements are not allowed in this venue. No blatant advertising or solicitations of or for business is prohibited.
This includes, but not limited to, personal resumes and links to products or
services with which the poster is affiliated, whether or not a fee is charged
for the product or service. Spamming, in which a user posts the same message repeatedly, is also prohibited.

7] We retain the right to remove any posts and/or Members for any reason, without prior notice.


- PLEASE READ -

Members are welcome to read posts and though we encourage your active participation in the forum, it is not required. If you do participate by posting, however, we expect that on the whole you contribute something to the forum. This means that the bulk of your posts should not be in "fun" threads (e.g. Ankap, Keep & Kill, This or That, etc.). Further, while occasionally it is appropriate to simply voice your agreement or approval, not all of your posts should be of this variety: "LOL Member213!" "I agree."
If it is evident that a member is simply posting for the sake of posting, they will be removed.


8] These Rules & Guidelines may be amended at any time. (last update September 17, 2009)

If you believe an individual is repeatedly breaking the rules, please report to admin/moderator.
See more
See less

Brain Teasers

Collapse
This topic is closed.
X
X
 
  • Filter
  • Time
  • Show
Clear All
new posts

  • Real funny anileve.

    Don't take me for an idiot, please.



    R(vi+1) = R(vi) + oei R(di) = R(vi) + jR(vi)ffi|R(di)|k R(di).

    The initial value is R(v1) = R(1, 0) = q and R(vi) is integer valued and bounded by zero. Hence, the algorithm terminates after at most log(q) iterations. We obtain that t <= log(q) and that the number of vertices and direction vectors is polynomially bounded in the encoding length of C. This yields an efficient technique to store and to manage the complete basis of C.

    Theorem: Let C = cone \Gamma (1, 0), (p, q)\Delta be a 2-dimensional cone defined as above. Then the algorithm constructs in polynomial time vectors v1, . . . , vt+1, d1, . . . , dt and step lengths oe1 . . . , oet and the set

    H

    Z2(C) :=

    t[

    i=1 \Phi v

    i + oe di : oe = 0, . . . , oei - 1\Psi [ {(p, q)}

    is the basis of the cone C.

    Overview of the values generated by Algorithm for the cones C1 and C2.

    q p i vi R(vi) "i di R(di) oei = j R(v

    i)|

    R(di)| k

    7 4 1 (1, 0) 7 - (0, 1) -4 1

    2 (1, 1) 3 1 (1, 2) -1 3 3 (4, 7) 0 - - - -

    8 5 1 (1, 0) 8 - (0, 1) -5 1

    2 (1, 1) 3 1 (1, 2) -2 1 3 (2, 3) 1 1 (3, 5) -1 1 4 (5, 8) 0 - - - -


    I want to thank Dynamic progrmaning @ UofNM for development of the program that let me run the algo.

    and give credit to the team that calculated the Johnson Algorithm --a 24 bit encryption algorithm for linking protection.
    also from UofNM.


    and for your info pasamonster does know

    Now i wait for the answer for the problem that you posted.

    sorry it took me so long i had to type the whole thing.

    Comment


    • Here's one from way back...


      John is 5'11" tall. If he stands on a stool thats 1'7" , how tall will he be? If he sits down on the same stool, how tall will he be?

      Comment


      • Originally posted by PASAMONSTER ... and give credit to the team that calculated the Johnson Algorithm --a 24 bit encryption algorithm for linking protection.
        also from UofNM.
        Well, I'll be ...!!! And all this time I thought Johnson's algorithm was for solving the all-pairs-shortest path problem alla Floyd-Warshall and Bellman-Ford. I had no idea that the Dynamic Programming at UofNM used it to do crypto By the way, "Dynamic Programming" refers to a general class of algorithms where the above fall under (including Johnson's) If I remember correctly, Johnson uses a combination of Bellman-Ford and Dijkstra to sove for the shortest paths.

        But eve, by keeping with the spirit of the thread and the section it was in, I was hoping we'd try to solve that math one. Seems doable but not that trivial at the moment.
        Last edited by Sip; 03-03-2004, 11:57 AM.
        this post = teh win.

        Comment


        • heres a simple math one:


          Calculate the Discriminant and the number or roots for f(x)=0.

          If f(x)=x^2+4x-12.

          Comment


          • Originally posted by PASAMONSTER Here's one from way back...


            John is 5'11" tall. If he stands on a stool thats 1'7" , how tall will he be? If he sits down on the same stool, how tall will he be?
            If he stands up on the stool, he'll still be 5,11", if he sits down on the stool, he'll still be 5,11"

            Comment


            • Ayyyyy hayi xelka ehhhhh

              ov uni ehhh ovv uniiiiiiiii!

              Comment


              • Hey Seaphan.

                So thats what the deatails of it are. Hey you a mathematician or a computer programer?

                Comment


                • Originally posted by PASAMONSTER Hey Seaphan.

                  So thats what the deatails of it are. Hey you a mathematician or a computer programer?
                  Nah not a mathematician by any means. I've been known to do a few programs here and there (C/C++ is my language of choice) ... but algorithms and computery stuff and mostly discrete math would be what I consider my favorites.

                  Funny thing about Dijkstra and Johnsons mentioned above is that I was explaining it to my brother 2 nights ago who is getting ready to take the AP Computer Science test this year (highschool).
                  Last edited by Sip; 03-03-2004, 12:25 PM.
                  this post = teh win.

                  Comment


                  • Originally posted by PASAMONSTER Real funny anileve.

                    Don't take me for an idiot, please.
                    Oh Monster, that was not my intention at all. I was simply trying to elevate myself.

                    Originally posted by PASAMONSTER sorry it took me so long i had to type the whole thing.
                    That is ok, it's understandable. When I retype something from a book it also takes some time....

                    Comment


                    • I'm gonna shut the f up and 10..9..8..7..6.5.4.3.21...wuuusssaaaa.

                      Ok I'll still be waiting for your answer LOL muha ha ha h ha.

                      Elevate all you want, but still know your place, woman.

                      I don't wanna be the one to keep reminding and reminding you of it

                      Comment

                      Working...
                      X