Proofs
Categories:
Code Problem / Data Structures and Algorithms / Recursion (32)
Code Problem / Data Structures and Algorithms / Binary Search (30)
Code Problem / Data Structures and Algorithms / Linked Lists (26)
Code Problem / Data Structures and Algorithms / Backtracking (26)
Code Problem / Data Structures and Algorithms / Stacks and Queues (25)
Code Problem / Data Structures and Algorithms / Hashing (24)
Databases / SQL / Backup and Recovery (19)
Code Problem / Data Structures and Algorithms / Arrays and Strings (19)
Databases / SQL / Database Normalization (18)
Code Problem / Data Structures and Algorithms / Time Complexity (17)
Databases / SQL / Locking (16)
Databases / SQL / Replication (15)
Databases / SQL / SQL Queries (13)
Code Problem / Data Structures and Algorithms / Graphs (13)
Databases / SQL / Database Security (13)
More...
Recent solutions:
Check these solutions from our community:
The given statement is true. If n^2 is even, then n is even.
About this solution: This is a correct solution.
The proof that 0.999... = 1 is elementary, using just the mathematical tools of comparison and addition of (finite) decimal numbers.
About this solution: This solution is correct and demonstrates a level of completeness. The approach is straightforward and uses only the mathematical tools of comparison and addition of decimal numbers.
The Euler's formula states that for any convex polyhedron, the number of vertices and faces together is exactly two more than the number of edges. This can be proven using the Noah's Ark method, which states that if you have a convex polyhedron with V vertices, E edges, and F faces, then V - E + F = 2.
About this solution: The candidate's solution correctly states the Euler's formula and provides a valid proof by the Noah's Ark method. However, the solution could be more complete by providing more explanation and examples. For instance, the candidate could explain how the Noah's Ark method works and provide additional examples to illustrate the proof.
This excerpt proves the Pythagoras' Theorem using Euclid's proof.
About this solution: The candidate's solution is complete and solves the problem. The approach is clear and easy to follow.
The Pythagorean Theorem states that the length of the diagonal of a square is equal to the square root of 2. This proof shows that the square root of 2 is irrational.
About this solution: The candidate's solution is correct and demonstrates a good understanding of the problem. The candidate has taken a clear and logical approach to solving the problem.