query: How to build linear order on $\mathcal P({\bf N})$
positive_passages.docid: 72104
positive_passages.text: Totally ordering the power set of a well ordered set.
negative_passages.docid: 46065
negative_passages.text: How do you find all $n$ such that $\phi(n)|n$
negative_passages.docid: 131163
negative_passages.text: There is a well ordering of the class of all finite sequences of ordinals
negative_passages.docid: 7214
negative_passages.text: Does linear ordering need the Axiom of Choice?
negative_passages.docid: 37061
negative_passages.text: The order of $ab$ when $a,b$ commute
negative_passages.docid: 40937
negative_passages.text: Is the set of partial order relations over $ \mathbb{N}$ countable?
negative_passages.docid: 95081
negative_passages.text: Ordering on complex numbers
negative_passages.docid: 145966
negative_passages.text: Find $P(A\ xor\ B\ |\ A\ \cup\ B)$
negative_passages.docid: 86635
negative_passages.text: Optimizing $(X_{n}+c)^{2}$ to show that $P(\overline{X}_{n}\geq \lambda) \leq E(X_{n}^{2})/(EX_{n}^{2}+ \lambda^{2})$
negative_passages.docid: 123419
negative_passages.text: Abstract algebra: homomorphism and an element of a prime order
negative_passages.docid: 57644
negative_passages.text: Lower bounds for ${{2n} \choose {n}}$
negative_passages.docid: 35022
negative_passages.text: When do we need composite order groups for bilinear maps and when prime order?
negative_passages.docid: 59207
negative_passages.text: How to create the most compact mapping n → isprime(n) up to a limit N?
negative_passages.docid: 8841
negative_passages.text: A $p$-group of order $p^n$ has a normal subgroup of order $p^k$ for each $0\le k \le n$
negative_passages.docid: 104513
negative_passages.text: Order of elements in $Z_n$
negative_passages.docid: 23037
negative_passages.text: Computing the order of $\mathrm{SL}_2(\mathbb F_p)$ as the kernel of $\mathrm{GL}_2(\mathbb F_p)$
negative_passages.docid: 5069
negative_passages.text: $GL_n(\mathbb F_q)$ has an element of order $q^n-1$