query: number of regions created by n lines (no 3 are concurrent but parallels are permitted)
positive_passages.docid: 157985
positive_passages.text: Trying to understand formula for counting regions of hyperplane arrangements in $\mathbb{R}^2$
negative_passages.docid: 27651
negative_passages.text: Induced sequence of global sections
negative_passages.docid: 112343
negative_passages.text: vectorized array creation from a list of start/end indices
negative_passages.docid: 91351
negative_passages.text: the number of components working at a particular time
negative_passages.docid: 37754
negative_passages.text: Number of vertices of a complete graph with $n$ edges
negative_passages.docid: 1791
negative_passages.text: A newcommand (for typesetting the symbol for parallel lines) not compiled
negative_passages.docid: 44887
negative_passages.text: The intersection of two parallel lines
negative_passages.docid: 134242
negative_passages.text: Graph partition that span a third of edges
negative_passages.docid: 9411
negative_passages.text: Number of permutations of $n$ elements where no number $i$ is in position $i$
negative_passages.docid: 85104
negative_passages.text: Counting train stops using combinatorics
negative_passages.docid: 11998
negative_passages.text: In how many sequences of length $n$, the difference between every 2 adjacent elements is $1$ or $-1$?
negative_passages.docid: 148635
negative_passages.text: How to indent multiple lines starting from the middle in vi?
negative_passages.docid: 114743
negative_passages.text: Which choice of line-breaking parameters gives the minimum number of lines
negative_passages.docid: 76191
negative_passages.text: \atop vs. \substack for multiple lines under a sum
negative_passages.docid: 80744
negative_passages.text: What is the number of strings at size $n$ that is constructed from ${a,b,c,d}$ and there is an even num of $a$
negative_passages.docid: 24879
negative_passages.text: Overlap join with start and end positions
negative_passages.docid: 17868
negative_passages.text: How to calculate the number of possible connected simple graphs with $n$ labelled vertices