LATEST POSTS
The introduction to Bernoulli Number
Introduction, derivation and proof of Bernoulli numbers
System Reliability Model
Outlines computer system reliability, including series, parallel components, and N-modular redundancy.
Equivalence of rectangular and trapezoidal approximations
Discusses the equivalence and error estimation in integrating piecewise continuous functions using rectangular and trapezoidal approximations.
Data Table Relation's Normalization
Introduces functional dependencies, and the database paradigms 1NF, 2NF, 3NF, BCNF, and 4NF. and use examples to explain their concepts and connections.
Taylor formula, taylor theorem, taylor series, taylor expansion
This article mainly introduces the content and connection between the four concepts of Taylor's formula, Taylor's theorem, Taylor series and Taylor's expansion.
Proof of faulhaber's formula
Faulhaber's Formula, which provides a method to compute the sum of the p-th powers of the first n positive integers.
The catalan series
The article discusses Catalan numbers, a sequence used in combinatorial problems. It covers their recurrence relation, closed form, and applications in path counting. It provides insights into problem-solving using Catalan numbers.
Some definitions for time complexity.
Give five symbolic and mathematical definitions related to time complexity.
Some classical ciphers and implementations
This article explores classical ciphers historically used. In the past, amid low productivity and primitive computing, these ciphers offered protection.
How to explain The halting problem
How to explains the Halting Problem's unsolvability in computing, referencing Alan Turing's work. Let’s start with a simple Java login function and a example.