Proof that n^3 - n is divisible by 6 using INDUCTION
Learn Flock
Proof that n^3 - n is divisible by 6 using INDUCTION
10:34
Proof that 2^(n+2) + 3^(2n+1) is divisible by 7 using INDUCTION
Learn Flock
Proof that 2^(n+2) + 3^(2n+1) is divisible by 7 using INDUCTION
5:58
T(n) = (n-1) + T(n-1) | SUBSTITUTION METHOD
Learn Flock
T(n) = (n-1) + T(n-1) | SUBSTITUTION METHOD
6:58
T(n) = n + T(n-1) + T(n-5) + T(n-3) | SUBSTITUTION METHOD
Learn Flock
T(n) = n + T(n-1) + T(n-5) + T(n-3) | SUBSTITUTION METHOD
6:39
LeetCode 222. Count Complete Tree Nodes - in Python
Learn Flock
LeetCode 222. Count Complete Tree Nodes - in Python
6:16
LeetCode 49. Group Anagrams - in Python
Learn Flock
LeetCode 49. Group Anagrams - in Python
4:11
LeetCode 242. Valid Anagram - in Python
Learn Flock
LeetCode 242. Valid Anagram - in Python
4:18
LeetCode 209. Minimum Size Subarray Sum - in Python
Learn Flock
LeetCode 209. Minimum Size Subarray Sum - in Python
5:22
LeetCode 53. Maximum Subarray - in Python
Learn Flock
LeetCode 53. Maximum Subarray - in Python
3:17
T(n) = n^2 + T(n/3) | SUBSTITUTION METHOD
Learn Flock
T(n) = n^2 + T(n/3) | SUBSTITUTION METHOD
7:01
T(n) = log(n) + T(n-2) | SUBSTITUTION METHOD
Learn Flock
T(n) = log(n) + T(n-2) | SUBSTITUTION METHOD
8:09
LeetCode 169. Majority Element - in Java
Learn Flock
LeetCode 169. Majority Element - in Java
7:02
LeetCode 27. Remove Element - in Java
Learn Flock
LeetCode 27. Remove Element - in Java
6:34
Proof that for any positive integers k and n, k divides (k + 1)^n - 1 by INDUCTION
Learn Flock
Proof that for any positive integers k and n, k divides (k + 1)^n - 1 by INDUCTION
7:44
Proof that any positive integer n greater than 1 is divisible by some prime number p
Learn Flock
Proof that any positive integer n greater than 1 is divisible by some prime number p
7:54
Proof that 1^2 + 2^2 + . . . + n^2 = n(n+1)(2n+1)/6 by INDUCTION
Learn Flock
Proof that 1^2 + 2^2 + . . . + n^2 = n(n+1)(2n+1)/6 by INDUCTION
7:12
Proof that 1 + 2 + . . . + n = n(n+1)/2 by INDUCTION
Learn Flock
Proof that 1 + 2 + . . . + n = n(n+1)/2 by INDUCTION
4:51
LeetCode 26. Remove Duplicates from Sorted Array - in Java
Learn Flock
LeetCode 26. Remove Duplicates from Sorted Array - in Java
5:19
Proof that a1 + b1 ≡ a2 + b2 mod m
Learn Flock
Proof that a1 + b1 ≡ a2 + b2 mod m
3:36
LeetCode 138. Copy List with Random Pointer - in C
Learn Flock
LeetCode 138. Copy List with Random Pointer - in C
10:52
Proof by induction that for any natural number n, n^2 + 5n + 8 is even
Learn Flock
Proof by induction that for any natural number n, n^2 + 5n + 8 is even
7:12
Proof that if a | b and b | c, then a | c
Learn Flock
Proof that if a | b and b | c, then a | c
1:46
Proof that there do not exist integers a and b such that 6a + 8b = 1
Learn Flock
Proof that there do not exist integers a and b such that 6a + 8b = 1
3:09
Proof that if g ৹ f is invective, then f is injective
Learn Flock
Proof that if g ৹ f is invective, then f is injective
2:51
Proof of A \ (A \ B) = A ∩ B
Learn Flock
Proof of A \ (A \ B) = A ∩ B
5:03
Converting from Decimal to IEEE-754 Single Precision Format
Learn Flock
Converting from Decimal to IEEE-754 Single Precision Format
11:31
Prove Square Root of 2 is Irrational
Learn Flock
Prove Square Root of 2 is Irrational
5:09
Converting from IEEE-754 Single Precision Format to Decimal
Learn Flock
Converting from IEEE-754 Single Precision Format to Decimal
6:22