# Proof

1. A Rational Number With a Finite Number of Digits
2. Roth vs Traditional, which one is better?
3. Sample Standard Deviation In Terms of Sum and Square Sum of Samples
4. Proof: Uniqueness of multiplicative inverse
5. Proof: The sum of any three single-digit numbers is at most two digits long
6. Proof: a natural number n is a prime if b^(n−1) = 1 (mod n) for every integer b between 1 and n-1
7. Euler's formula for Planar Graph
8. A number is divisible by 3 iff sum of its digits are divisible by 3
9. 証明:文字列長が素数の文字列集は非正規言語
10. Proof: An Equivalence Relation Defines A Partition
11. Proof: The language consisting of strings whose lengths are prime is not regular
12. Algorithm to Count the Number of On-Bits
13. Given a rational preference show that indifference relation is also transitive
14. Show that P(A) is a subset of P(B) if A is a subset of B
15. Prove that b | a iff every multiple of a is multiple of b
16. Proof: every consistent heuristic is also admissible
17. A totally ordered bijective mapping from string to integer
18. A word cannot be described within the same language
19. A complete bipartite graph is a tree only if the order of one of partite sets is 1
20. Prove or disprove if a+b=2 then b+z=3 for some z
21. The Second Proof of the Catalan Numbers
22. The Number of R-combinations Repetition Allowed

See all tags.