Formulas are the most important part of mathematics and as we all know one is the backbone of the latter. Considering there are thousands of mathematical formulas to help people develop analytical approach and solve problems easily — there are some that go beyond. Some formulas aren’t just timesaving but those also do wonders. In this article I have collected some of the finest time-saving formulas in mathematics.

The calendar formula

This formula is extremely helpful in finding weekday for a specific date in history. More about this can be found in the article “Calendar Formula: Finding the Week-days“.

Infinite Summation into Integration

We all know that integration can be interpreted as summation and vice versa. Infinite summations can be easily converted into finite integrals which on solution yields result to the infinite summation. The methods of converting infinite summations is pretty easy and thus the whole process saves a lot of time.

Theory is that if $f$ is a positive increasing function then $f(n) \le \int_n^{n+1} f(x) dx \le f(n+1) $.

Similarly, if $f$ is a positive decreasing function then $f(n) \ge \int_n^{n+1} f(x) dx \ge f(n+1) $.

For increasing $f$, $\sum_{i=0}^{n-1} f(i) \le \int_0^{n} f(x) dx \le \sum_{i=0}^{n-1} f(i+1) $

or, $\sum_{i=0}^{n} f(i)-f(n) \le \int_0^{n} f(x) dx \le \sum_{i=0}^{n} f(i)-f(0) $ or $f(0) \le \sum_{i=0}^{n} f(i)-\int_0^{n} f(x) dx \le f(n) $.

For a decreasing function, the inequalities are reversed.

Khan Academy has a very good video about converting infinite summations into integral problems.

Integral Equation Magical Formula

This helps in converting a multiple integral equation to a simple linear integral equation.

Consider an integral of order n is given by $ \displaystyle{\int_{\Delta}^{\Box}} f(x) dx^n$

We can prove that $ \displaystyle{\int_{a}^{t}} f(x) dx^n = \displaystyle{\int_{a}^{t}} \dfrac{(t-x)^{n-1}}{(n-1)!} f(x) dx$

This formula can help you solve tedious integral problems in a jiffy. Just compare the parameters and you are good to go!

For example, let’s try to solve $ \int_0^1 x^2 dx^2$

Solution:

$$ \int_0^1 x^2 dx^2$$

$$ = \int_0^1 \dfrac{(1-x)^{2-1}}{(2-1)!} x^2 dx$$

(Compare, $t=1$)

$ =\int_0^1 (1-x) x^2 dx$

$ =\int_0^1 (1-x) x^2 dx$

$ =\int_0^1 (x^2-x^3) dx =1/12$

Done!

$\sin^m x \cos^n x$ integration formula

To integrate $\sin^m x \cos^n x$ with respect to $x$, we use simple substitution considering if $n$ is odd or $m$ is odd or both are even.

    1. If n is odd, then ignore what m is and use substitution as $u = \sin x$ or $ du = \cos x \ dx$ and convert the remaining factors of cosine using $\cos^2 x = 1 – \sin^2 x$. This will work even if $m = 0.$

      This can be applied to $\int \sin^5 x \cos^3 x \ dx$ like integrals.

 

    1. If m is odd and n is even — use substitution as $u = \cos x$ or $du = − \sin x \ dx$ and convert the remaining factors of sine using $\sin^2 x = 1 – \cos^2 x$. This will work if $n = 0.$This can be applied to $\int \sin^3 x \cos^8 x \ dx$ like integrals.

 

  1. If both powers are even we reduce the powers using the half angle formulas: $\sin^2 x = \dfrac{1}{2} ( 1 – \cos 2x ) $; and
    $\cos^2 x = \dfrac{1}{2} (1 + \cos 2x) $Alternatively, you can switch to powers of sine and cosine using $\cos^2 x+ \sin^2 x = 1$ and use the reduction formulas. Example: $\int \sin^4 x \cos^2 x \ dx$

L’ Hospital’s Rule

According to it if we have an indeterminate form for a limit problem, like 0/0 or $\dfrac{\infty}{\infty}$, then all we need to do is differentiate the numerator and differentiate the denominator and then take the limit. Read more about this on Mathworld.

Liouville & Dirichlet’s Theorem

These theorems are used to easily convert surface or volume integrals into $\Gamma$-functions.

    1. $$ \int \int \int_{V} x^{l-1} y^{m-1} z^{n-1} dx dy ,dz = \frac { \Gamma {(l)} \Gamma {(m)} \Gamma {(n)} }{ \Gamma{(l+m+n+1)} } $$where V is the region given by $ x \ge 0 y \ge 0 z \ge 0 x+y+z \le 1 $ .

 

  1. If $ x, y, z$ are all positive such that $ h_1 < (x+y+z) < h_2 $ then $$ \int \int \int_{V} x^{l-1} y^{m-1} z^{n-1} F (x,y,z) dx dy ,dz = \frac { \Gamma {(l)} \Gamma {(m)} \Gamma {(n)} }{ \Gamma{(l+m+n)} } \int_{h_1}^{h_2} F(h) h^{l+m+n-1} dh $$

Detailed information about Liouville & Dirichlet’s Theorem can be found here.

Remainder Theorems

There are several formulas in Number Theory on finding divisibility and remainders. As an example, general remainder theorem is a general approach of Euclidean division of polynomials while on the other hand Euler’s Remainder Theorem works as an excellent utility to find divisibility of large numbers.

More to be added soon!

Total
0
Shares


Feel free to ask questions, send feedback and even point out mistakes. Great conversations start with just a single word. How to write better comments?
1 comment
Leave a Reply

Your email address will not be published. Required fields are marked *

This site uses Akismet to reduce spam. Learn how your comment data is processed.

You May Also Like

Four way valid expression

People really like to twist the numbers and digits bringing fun into life. For example, someone asks, “how much is two and two?” : the answer should be four according to basic (decimal based) arithmetic. But the same  with base three (in ternary number system) equals to 11. Two and Two also equals to Twenty Two. Similarly there are many ways you can…

Fox – Rabbit Chase Problems

Part I: A fox chases a rabbit. Both run at the same speed $ v$ . At all times, the fox runs directly toward the instantaneous position of the rabbit , and the rabbit runs at an angle $ \alpha $ relative to the direction directly away from the fox. The initial separation between the fox and the rabbit is…

Hopalong Orbits Visualizer: Stunning WebGL Experiment

Just discovered Barry Martin’s Hopalong Orbits Visualizer — an excellent abstract visualization, which is rendered in 3D using Hopalong Attractor algorithm, WebGL and Mrdoob’s three.js project. Hop to the source website using your desktop browser (with WebGl and Javascript support) and enjoy the magic. PS: Hopalong Attractor Algorithm Hopalong Attractor predicts the locus of points in 2D using this algorithm…

Claim for a Prime Number Formula

Dr. SMRH Moosavi has claimed that he had derived a general formula for finding the $ n$ -th prime number. More details can be found here at PrimeNumbersFormula.com and a brief discussion here at Math.SE titled  “Formula for the nth prime number: discovered?” SOME MORE EXCERPTS ARE HERE:

Chess Problems

In how many ways can two queens, two rooks, one white bishop, one black bishop, and a knight be placed on a standard $ 8 \times 8$ chessboard so that every position on the board is under attack by at least one piece? Note: The color of a bishop refers to the color of the square on which it sits,…
collatz conjecture
Read More

The Collatz Conjecture : Unsolved but Useless

The Collatz Conjecture is one of the Unsolved problems in mathematics, especially in Number Theory. The Collatz Conjecture is also termed as 3n+1 conjecture, Ulam Conjecture, Kakutani’s Problem, Thwaites Conjecture, Hasse’s Algorithm, Syracuse Problem. Statement: Start with any positive integer. • Halve it, if it is even. Or • triple it and add 1, if it is odd. If you…