Posted by **Gandu man** on Saturday, May 18, 2013 at 10:25am.

Let S be the set of {(1,1),(1,−1),(−1,1)}-lattice path which begin at (1,1), do not use the same vertex twice, and never touch either the x-axis or the y-axis. Determine the largest value of n such that every path in S which ends at (n,n) has length at most 50000.

## Answer this Question

## Related Questions

- math - Let S be the set of {(1,1),(1,−1),(−1,1)}-lattice path which ...
- Math - Let S be the set of {(1,1),(1,−1),(−1,1)}-lattice path which ...
- Geometry - Let S be the set of {(1,1),(1,−1),(−1,1)} -lattice path ...
- sd224 - Let S be the set of {(1,0),(0,1),(1,1),(1,−1),(−1,1)}-...
- help~MATHS - Let S be the set of {(1,0),(0,1),(1,1),(1,−1),(−1,1)}-...
- math - Let S be the set of {(1,1), (1,−1), (−1,1), (1,0), (0,1)}-...
- math - Let S be the set of {(1,1), (1,−1), (−1,1), (1,0), (0,1)}-...
- Math - How many {(1,1),(1,−1),(2,0)}-lattice paths are there from the ...
- Physics - Four particles in the xy plane have the following masses and ...
- Calculus - Let R be the region bounded by y=−3(x−1)(x−3) and ...

More Related Questions