Learn More
Consider an r × (n − r) plane lattice rectangle, and walks that begin at the origin (south-west corner), proceed with unit steps in either of the directions east or north, and terminate at the north-east corner of the rectangle. For each integer k we ask for N k , the number of ordered pairs of these walks that intersect in exactly k points. The number of(More)
Two players compete in a contest where the first player to win a specified number of points wins the game, and the first player to win a specified number of games wins the set. This paper proves two generalized inequalities, each independent of the probability of winning a point, concerning the better player’s chances of winning. Counterexamples are given(More)
  • 1