Number System(1)

Number System

Number System

We know that ten digits are used to write a number. There numbers are 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9.
To write a number, we take units like: tens, hundreds, thousand and etc. form right to left respectively.

Example 1: Write the following numbers in words:
  1. 555555
    Five hundred fifty-five thousand five hundred fifty-five.
  2. 978779
    Nine hundred seventy-eight thousand seven hundred seventy-nine.
  3. 9787987
    Nine million seven hundred eighty-seven thousand nine hundred eighty-seven.
Example 2: Write the following numbers in words:
  1. 61487029
  2. 723892514
  3. 5895160723
Solution:
Arab Ten Crores Crores Ten Laks Lakhs Ten Thousands Thousands Hundreds Tens Ones
6 1 4 8 7 0 2 9
7 2 3 8 9 2 5 1 4
5 8 9 4 1 6 0 7 2 3

Hence, the given numbers are:

  • Six crores fourteen lakhs eighty sevan thousand twenty nine.
  • Seventy two crore thirty eight lakh ninety two thousand five hundred and fourteen.
  • Five Arabs eighty nine crore forty one lakh sixty thousand seven hundred twenty three.

Comments

Post a Comment

Popular posts from this blog

Liouville's Theorem in Complex Analysis

Image
Liouville's Theorem Art-15. Liouville's Theorem This theorem is very important, if you read this theorem carefully then some of the theorems coming up are based on this on which you can apply it and there are many questions where you can apply this theorem and you can solve those questions with Liouville's Theorem . Statement: If a function \( f(z) \) is analytic for all finite values of \( z \) and is bounded, then \( f(z) \) is constant. Proof: Let \( z_1, z_2 \) be any two points of the \( z \)-plane. Draw a circle \( C \) with center at the origin and radius \( R \), enclosing the points \( z_1 \) and \( z_2 \) so that: \( |z_1| < R \) and \( |z_2| < R \) Since \( f(z) \) is bounded, there exists \( M > 0 \) such that \( |f(z)| \leq M \) on \( C \). By Cauchy's integral formula, we have \( f(z_1) = \frac{1}{2\pi i} \int_C \frac{f(z)}{z - z_1} \, dz \) and \( f(...
Read more

Intersection of Two Subspaces is a Subspace but no need of Union

Image
Intersection and Union of Subspaces Intersection of Two Subspaces is a Subspace Proof: Let \( S \) and \( T \) be two subspaces of a vector space \( V \) over a field \( F \). We shall prove that \( S \cap T \) is also a subspace of \( V \). Let \( \alpha, \beta \in F \) and \( x, y \in S \cap T \). Then \( x, y \in S \) and \( x, y \in T \). Since \( S \) and \( T \) are subspaces of \( V \), we have: \[ \alpha x + \beta y \in S \] \[ \alpha x + \beta y \in T \] Therefore, \[ \alpha x + \beta y \in S \cap T \] Thus, \( \alpha x + \beta y \in S \cap T \) for all \( \alpha, \beta \in F \) and \( x, y \in S \cap T \). Hence, \( S \cap T \) is a subspace of \( V \). Union of Two Subspaces Need Not Be a Subspace Now, by giving an example we shall prove that the union of two subspaces need not be a subspace. Example: Let \( V = \mathbb{R}^3 = \{(x, y, z) : x, y, z \in \mathbb{R}\} \) be a vector space over the field \( \mathbb{R} \) of all rea...
Read more