Mathematics
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:
Mathematics / Theorems
DifficultyHard
This theorem states that if a and b are positive integers, then their sum a + b is also a positive integer. This is true because both a and b are positive, so their sum must be positive as well.
About this solution: The candidate's solution is correct and demonstrates a level of completeness. The candidate has correctly identified that this is a direct result of the definition of addition for integers. The candidate has also correctly identified that the sum of two integers will always be an integer. Therefore, the candidate's solution solves the problem and is a correct approach.
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.
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.
None
About this solution: The candidate's solution is complete and solves the problem. The candidate's approach is to first find the adjacency matrix A, then the matrix giving the number of 3 step walks, then the generating function for walks from point i → j, and finally the generating function for walks from points 1 → 3.
None
About this solution: The candidate's solution is correct and demonstrates a level of completeness. The approach is straightforward and easy to follow.
None
About this solution: The candidate's solution is correct. They have provided the adjacency matrix and have correctly found the number of 3 step walks and the generating function for walks from points 1-3.