query: mean of two consecutive number helps proving both number equals..
positive_passages.docid: 142401
positive_passages.text: Where's the problem in this equation? Resulting in $4 = 5$
negative_passages.docid: 3979
negative_passages.text: Limit comparison test proof
negative_passages.docid: 151466
negative_passages.text: Series of consecutive numbers (different lengths)
negative_passages.docid: 65168
negative_passages.text: Proof of sequence inequality
negative_passages.docid: 106979
negative_passages.text: Prove the inequality and limitation
negative_passages.docid: 76290
negative_passages.text: arithmetic mean of a sequence converges
negative_passages.docid: 77026
negative_passages.text: Proof with inequalities
negative_passages.docid: 17233
negative_passages.text: are two consecutive numbers relatively prime?
negative_passages.docid: 42285
negative_passages.text: Prove by mathematical induction.
negative_passages.docid: 75852
negative_passages.text: Using Pigeonhole Principle to prove two numbers in a subset of $[2n]$ divide each other
negative_passages.docid: 107234
negative_passages.text: Is the mean of equal length subsets always equal to the mean of the set?
negative_passages.docid: 156669
negative_passages.text: Trying to prove a simple (?) inequality
negative_passages.docid: 106827
negative_passages.text: Proof for two sequences producing the maximum value when sorted
negative_passages.docid: 94923
negative_passages.text: Using the Pigeonhole Principle to show that $2$ of any $n+1$ numbers from $\{1,2,\ldots,2n\}$ sum to $2n+1$
negative_passages.docid: 147005
negative_passages.text: Prove two identities relating to series
negative_passages.docid: 143968
negative_passages.text: Proving this inequality by mathematical induction
negative_passages.docid: 142956
negative_passages.text: Prove that for any positive integer n there is a sequence of n consecutive composite numbers.