query: prove or disprove this problem
positive_passages.docid: 20630
positive_passages.text: Digital root of twin prime semiprimes
negative_passages.docid: 124936
negative_passages.text: Help with a Probability Proof
negative_passages.docid: 32130
negative_passages.text: How to prove that a limit does not exist?
negative_passages.docid: 45460
negative_passages.text: Proof verification of a number theory problem involving sequences.
negative_passages.docid: 140632
negative_passages.text: A problem on Binomial Theorem
negative_passages.docid: 89354
negative_passages.text: Polynomials, prove exercise question about question
negative_passages.docid: 88188
negative_passages.text: Explain proof by contradiction.
negative_passages.docid: 122581
negative_passages.text: Prove or disprove that $G_1/H_1 \cong G_2/H_2$
negative_passages.docid: 126032
negative_passages.text: Proving a certain inequality
negative_passages.docid: 32441
negative_passages.text: How to prove or disprove statements about sets
negative_passages.docid: 83778
negative_passages.text: An incorrect proof by exhaustion
negative_passages.docid: 106979
negative_passages.text: Prove the inequality and limitation
negative_passages.docid: 76347
negative_passages.text: Shorter proof for some equvalences
negative_passages.docid: 86030
negative_passages.text: Prove or disprove - If a divides b and b divides a does a=b
negative_passages.docid: 9819
negative_passages.text: prove/disprove Big-Oh
negative_passages.docid: 139
negative_passages.text: Prove or disprove: For every integer a, if a is not congruent to 0 (mod 3), the a^2 is congruent to 1 (mod 3)
negative_passages.docid: 77286
negative_passages.text: Proving set theory question