query: Wilson's Theorem Problem
positive_passages.docid: 154933
positive_passages.text: Prove $(p-k)!(k-1)!\equiv (-1)^k \text{ mod p }$
negative_passages.docid: 92595
negative_passages.text: A problem regarding the in-equality of complex numbers .
negative_passages.docid: 2218
negative_passages.text: Prove that $(n-1)! \equiv -1 \pmod{n}$ iff $n$ is prime [Wilson's Theorem]
negative_passages.docid: 56030
negative_passages.text: Could you prove the theorem?
negative_passages.docid: 73253
negative_passages.text: Question About equal signs in Theorems
negative_passages.docid: 131992
negative_passages.text: A problem on continuous functions
negative_passages.docid: 3178
negative_passages.text: How do I make a Theorem n followed by a Theorem n' ?
negative_passages.docid: 140632
negative_passages.text: A problem on Binomial Theorem
negative_passages.docid: 124488
negative_passages.text: Spivak Chapter 2, problems 27 (and 28)
negative_passages.docid: 51278
negative_passages.text: Theorems with an extraordinary exception or a small number of sporadic exceptions
negative_passages.docid: 87766
negative_passages.text: Using Cayley's Theorem to find an isomorphic subgroup.
negative_passages.docid: 61387
negative_passages.text: Incorrect Solution for Problem 7 of Pinter's Book of Abstract Algebra, Chapter 2?
negative_passages.docid: 111122
negative_passages.text: Proof of a theorem in Hilbert's system
negative_passages.docid: 141907
negative_passages.text: Haag's theorem and practical QFT computations
negative_passages.docid: 48476
negative_passages.text: Mean value theorem rolle's theorem
negative_passages.docid: 105444
negative_passages.text: Possible values of prime gaps
negative_passages.docid: 95533
negative_passages.text: I need some help with a GCD and LCM's Problem