Results 1 to 4 of 4

Math Help - Shortest ways from (0.0,0) to (M,N,P)

  1. #1
    Member
    Joined
    Nov 2012
    From
    London
    Posts
    81

    Shortest ways from (0.0,0) to (M,N,P)

    I have a problem for the number of the shortest ways from (0,0,0) to (M,N,P).
    May I ask the shortest way is (M+N+P), and the total number of the shortest ways is (M+N+P)! / M!N!P! or (M+N+P) C (M) * (N+P) C (N) * (P) C (P) ?
    because a journey from (0,0,0) to (M,N,P) consists of lists of segments where each segment is the length of a single block either east or north or up.
    So, (M+N+P) can be arranged in any order. However, each M*easts or N*norths or P*ups can be interchangeable each other.
    Thus, I need to remove the duplication, so I need to divide (M+N+P)! by M!N!P!.

    May I ask if I am correct?
    Happy New Year!

    Best
    Follow Math Help Forum on Facebook and Google+

  2. #2
    MHF Contributor

    Joined
    Apr 2005
    Posts
    15,967
    Thanks
    1635

    Re: Shortest ways from (0.0,0) to (M,N,P)

    PLEASE state the entire problem first! You state "I have a problem for the number of the shortest ways from (0,0,0) to (M,N,P)."

    The answer to that is that there is exactly one shortest way! It is the straight line from (0, 0, 0) to (M, N, P).

    From what you then write, you seem to be considering only lines of integer lengths, parallel to the axes. Is that true?
    Follow Math Help Forum on Facebook and Google+

  3. #3
    MHF Contributor

    Joined
    Aug 2006
    Posts
    18,792
    Thanks
    1687
    Awards
    1

    Re: Shortest ways from (0.0,0) to (M,N,P)

    Quote Originally Posted by HallsofIvy View Post
    PLEASE state the entire problem first! You state "I have a problem for the number of the shortest ways from (0,0,0) to (M,N,P)."

    The answer to that is that there is exactly one shortest way! It is the straight line from (0, 0, 0) to (M, N, P).
    From what you then write, you seem to be considering only lines of integer lengths, parallel to the axes. Is that true?
    While I absolutely agree that we should not be made to guess at what a post really means, I think in this case the intent is clear.

    The question is about a three 3-D lattice. Each of M,~N,~\&~P is a non-negative integer.
    Each path from (0,0,0)\to(M,N,P) consists of M~x's,N~y's,~\&~P~z's all of length one.

    Actually the OP gives the correct answer: \frac{(M+N+P)!}{(M!)(N!)(P!)}
    Follow Math Help Forum on Facebook and Google+

  4. #4
    Member
    Joined
    Nov 2012
    From
    London
    Posts
    81

    Re: Shortest ways from (0.0,0) to (M,N,P)

    I am sorry not to mention the question first.
    Yes, what you said it exactly correct!
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Shortest ways from (0.0,0) to (M,N,P)
    Posted in the Discrete Math Forum
    Replies: 2
    Last Post: January 6th 2014, 11:38 AM
  2. shortest distance
    Posted in the Algebra Forum
    Replies: 3
    Last Post: May 3rd 2009, 04:41 PM
  3. Shortest distance
    Posted in the Calculus Forum
    Replies: 3
    Last Post: April 16th 2009, 04:21 PM
  4. z=xy+1 shortest distance
    Posted in the Calculus Forum
    Replies: 1
    Last Post: April 28th 2007, 07:22 PM
  5. The Shortest Time
    Posted in the Algebra Forum
    Replies: 2
    Last Post: September 8th 2005, 07:03 PM

Search Tags


/mathhelpforum @mathhelpforum