A community for students.

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

imqwerty

  • one year ago

yo (⌐■_■)

  • This Question is Closed
  1. ali2x2
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 1

    yo (⌐■_■)

  2. anonymous
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    Herro

  3. imqwerty
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 1

    http://prntscr.com/85qp9w

  4. imqwerty
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 1

    @Empty @dan815

  5. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    |dw:1439845105204:dw|

  6. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    |dw:1439845339882:dw|

  7. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    |dw:1439845520781:dw|

  8. Empty
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    It might help to start at this configuration and then manipulate this to get other forms too:|dw:1439845619600:dw| But yeah idk other than just rearranging within these diagonals we still won't cover all of them, cause like you've shown @dan815 we have some others.

  9. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    the arragenment u have there is also since its increasing wrt to the sum of the indices too

  10. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    how about a coming with bounds like

  11. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    difference of 2 cannot exist for top and bottom

  12. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    |dw:1439845851729:dw|

  13. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    as 2 cannot be placed so we know that one side must always have a +1 to it

  14. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    now its about the separation that is possible we can have 1 side with +1 and the other side can go up to a max of the row length i think

  15. Empty
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    Hmmm one bound I see is that for a 3x3 matrix we have: \(b_1 \ge 1\), \(b_2 \ge 3\), \(b_3 \ge 1\)

  16. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    lets come back to this -.- lets do this http://prntscr.com/85qvgt

  17. Empty
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    Hmmm I think this is related to triangular numbers isn't it?

  18. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    its all related to something alright

  19. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    how about building it up from smaller, like whats the max intersections for 3 lines, are there some number of intersections not possible

  20. Empty
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    3 lines either intersect 0, 1, 2, or 3 times.

  21. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    okay right and for this question 0 is not possible becase of the no 3 concurrent rule

  22. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    how does that scale with more lines

  23. Empty
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    Is that what concurrent means? Parallel?

  24. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    ya i googled it one of the synonyms said parallel so i went with it lol

  25. imqwerty
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 1

    yes concurrent = parallel

  26. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    it was written by some dude that had a notion of a line

  27. Empty
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    Waste of a word imo

  28. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    hehehe

  29. Empty
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    Then 3 lines must intersect: 1 or 3 points only.

  30. Empty
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    |dw:1439847255272:dw|

  31. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    wait 2 is possible since we are allowed 2 concurrent just not 3

  32. Empty
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    Oh ok

  33. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    how about we just try to figure that out for a 100 lines, how many lines can be have with same slopes or not same slopes

  34. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    the least number of slopes present can be 50 the max is 100 then we can consider the different intercepts vs same intercepts

  35. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    now the problem looks more algebraic

  36. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    the case of the 3 line intersections can be broken down into number of different slopes number of different intercepts to determine the number of intersections

  37. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    f(m,b)=intersections(m,b) the number of intersections is some function of the the different number of slopes m and the different number of intercepts b lets try to come up with an equation like this one

  38. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    we can be solving like a general problem then!

  39. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    f(n,m,b)=intersections(n,m,b) let n be the number of lines m be the number of unique slopes b be the number of unique intercepts

  40. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    the last one doesnt make sense, i dunno but something like this

  41. ali2x2
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 1

    lol eggheads

  42. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    how about this different slopes and different intersections points like how 3 slopes must not share the same slope, and no 3 lines can share the same intersection point

  43. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    y-y1 = m1*(x-x1) let there be 100 lines of this form max number of mi =2 and we can see the max number of (xi,yi)s so that 2002 intercsecs exist or if possible

  44. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    base case all same (xi,yi) means everything has different slope and 1 intersetion for 1 same slope, we must have atleast 1 different (xi,yi), other wise a line would coincide and we have infinte intersections

  45. Not the answer you are looking for?
    Search for more explanations.

    • Attachments:

Ask your own question

Sign Up
Find more explanations on OpenStudy
Privacy Policy

Your question is ready. Sign up for free to start getting answers.

spraguer (Moderator)
5 → View Detailed Profile

is replying to Can someone tell me what button the professor is hitting...

23

  • Teamwork 19 Teammate
  • Problem Solving 19 Hero
  • You have blocked this person.
  • ✔ You're a fan Checking fan status...

Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.

This is the testimonial you wrote.
You haven't written a testimonial for Owlfred.