Skip to main content

Preview: Vedic Mathematics

In this blog , the words Sutra, aphorism, formula is used synonymously. So are also the words Upa-sutra, Sub-sutra, Sub-formula, corollary used.

The Sutras apply to and cover almost every branch of Mathematics. They apply even to complex problems involving a large number of mathematical operations. Application of the Sutras saves a lot of time and effort in solving the problems, compared to the formal methods presently in vogue. Though the solutions appear like magic, the application of the Sutras is perfectly logical and rational. The computation made on the computers follows, in a way, the principles underlying the Sutras. The Sutras provide not only methods of calculation, but also ways of thinking for their application.

This course on Vedic Mathematics seeks to present an integrated approach to learning Mathematics with keenness of observation and inquisitiveness, avoiding the monotony of accepting theories and working from them mechanically. The explanations offered make the processes clear to the learners. The logical proof of the Sutras is detailed, which eliminates the misconception that the Sutras are a jugglery.

Application of the Sutras improves the computational skills of the learners in a wide area of problems, ensuring both speed and accuracy, strictly based on rational and logical reasoning. The knowledge of such methods enables the teachers to be more resourceful to mould the students and improve their talent and creativity. Application of the Sutras to specific problems involves rational thinking, which, in the process, helps improve intuition that is the bottom - line of the mastery of the mathematical geniuses of the past and the present such as Aryabhatta, Bhaskaracharya, Srinivasa Ramanujan, etc.

Following posts makes use of the Sutras and Sub-Sutras stated above for presentation of their application for learning Mathematics at the secondary school level in a way different from what is taught at present, but strictly embodying the principles of algebra for empirical accuracy. The innovation in the presentation is the algebraic proof for every elucidation of the Sutra or the Sub-Sutra concerned.

Terms and Operations

  • Ekadhika means ‘one more’. So Ekadhika of 0 is one. Like this, Ekadhika of 99 is 100.
  • Ekanyuna means ‘one less’. So Ekanyuna of 1 is zero. Like this Ekanyuna of 3 is 2.
  • Purak means ‘complement’(in exact words 10's complement). So Paurank of 9 is (10-9)=1, Paurank of 7 is (10-7)=3 and 5 is 5.
  • Rekhank means ‘a digit with a bar on its top’. In other words it is a negative number.
e.g: A bar on 7 is written as 7. It is called Rekhank 7 or bar 7. We treat Purak as a Rekhank.
    e.g: 7 is 3 and 3 is 7
      At some instances we write negative numbers also with a bar on the top of the numbers as
        –4 can be shown as 4 .
          –21 can be shown as 21.

          • Beejank: The Sum of the digits of a number is called Beejank. If the addition is a two digit number, then these two digits are also to be added up to get a single digit.
          e.g: Beejank of 27 is 2 + 7 = 9.
          Beejank of 348 is 3 + 4 + 8 = 15, further 1 + 5 = 6. i.e. 6 is Beejank.

            Easy way of finding Beejank:

            Beejank is unaffected if 9 is added to or subtracted from the number. This nature of 9 helps in finding Beejank very quickly, by cancelling 9 or the digits adding to 9 from the number.
            e.g. 1: Find the Beejank of 632174.
            As above we have to follow:
            632174 → 6 + 3 + 2 + 1 + 7 + 4 → 23 → 2 + 3 → 5
            But a quick look gives 6 & 3 ; 2 & 7 are to be ignored because 6 + 3 = 9, 2 + 7 = 9. Hence remaining 1 + 4 → 5 is the beejank of 632174.

            Comments

            Popular posts from this blog

            8051 Simple Programs

            Sum of 8-bit Numbers Stored in Memory Here  we will discuss about 8051 programs but we can't discuss about all of the 8051 instructions. For programming 8051 we should know about assembler directives as well as instruction set. Click  here to download Atmel c51 user guide that will discuss about 8051(c51 family microcontroller) instruction set, assembler directives, c51 cross assembler from Atmel.  Program ORG 00H MOV R0,#50H   ; get memory location in memory pointer R0 MOV R1,#51H   ; get memory location on memory pointer register R1 MOV A,@R0       ; get content of memory location 50H to accumulator ADD A,@R1        ; add content of A with content of memory location 51H and store result in A MOV R0,#52H    ; get 52H to memory pointer R0 MOV@R0,A         ; copy content of A to memory location 52H END Add 16-bit Numbers ...

            Introduction to 8051 embedded C

            For 8051 we need to include the file reg51.h. This file contains the all the definitions of 8051 registers. With this information C compiler produces hex file that can be downloaded into the ROM of the microcontroller. It is important to note that the size of the hex file produced by the assembly language is much larger than the hex file produced by C compiler. Apart from this fact, there is many reasons for writing programs in C instead of assembly: ●It is much easier and less time consuming to write programs in C assembly. ●C is more flexible; it is easier to modify and update. ●Programming in C allows to use code available in function libraries. ●Program written inC for one microcontroller is portable to other microcontrollers with little or no modifications. Data Types in 8051 Embedded C The table shown below lists the data types that are available in typical C51 compiler. The gives information about the size of the data variable and it's value range. Data type ...

            Frequency of Oscillation of RC Phase Shift Oscillator

            Derivation of Frequency of Oscillation We have to find out the transfer function of RC feedback network. Feedback Circuit of RC Phase Shift Oscillator Applying KVL to various loops on the figure, we get, $$I_1 \left(R+\frac{1}{j \omega C }\right) -I_2R=V_i \text{ ....(1)}$$ $$-I_1R+I_2\left (2R+\frac {1}{j\omega C}\right)-I_3R=0\text{ ... (2)}$$ $$0-I_2R+I_3\left(2R+ \frac{1}{j\omega C}\right)=0\text{ ...(3)}$$ Replacing \(j\omega\) with \(s\) and writing equations in the matrix form, $$\begin{bmatrix}R+\frac{1}{sC} & -R & 0 \\-R & 2R+\frac{1}{sC} & -R \\0 & -R & 2R+\frac{1}{2sC} \end{bmatrix}\begin{bmatrix}I_1\\I_2\\I_3\end{bmatrix}=\begin{bmatrix}V_i\\0\\0\end{bmatrix}$$ Using Cramer's rule to find out \(I_3\), $$\text{Let, }D=\begin{bmatrix}R+\frac{1}{sC} & -R & 0 \\-R & 2R+\frac{1}{sC} & -R \\0 & -R & 2R+\frac{1}{2sC} \end{bmatrix}$$ \(|D|=\begin{vmatrix}R+\frac{1}{sC} & -R & 0 \\-R & 2R+\frac{1}{...