Namma Kalvi 12th Maths Minimum Learning Study Material em 217100

Namma Kalvi
V TOPPERS ACADEMY ,81, MASAKALIPALAYAM , HOPES -9384590475

12 MATHS- MINIMUM MATERIAL CHAPTERS - 1 AND 2
MATRICES AND ITS APPLICATIONS
R.VINAYAGAMOORTHI , M.Sc.,M.Phil.,B.Ed.,P.G.D.C.A
www.nammakalvi.in

www.nammakalvi.in

www.nammakalvi.in

=>
, Implies b=20
Z=20/4 =5
,
,
,
,
,
, ,
,
, ,y=1
,
substituting
, ,
,
, ,
by using gaussian elimination method
www.nammakalvi.in

,
Similarly,
,
Z=20,000,
; ;
,
; ;
, ; ;
;
; ;
;
; ;
;
; ;
;
;
www.nammakalvi.in

; ;
; ;
; ;
; ;
; ;
; ;
;
; ; ;
; ;
www.nammakalvi.in

COMPLEX NUMBERS
COMPLEX NUMBERS
; ;
www.nammakalvi.in

;
; ;
; ; ;
; ;
;
; ;
; ; ;
;
;
;
; ;
; ; ; ; ; ;
; ; ;
;
; ;
; ;
; ; ;
; ;
; ;
; ; ; ; ; ;
; ; ;
; ;
; ;
; ;
;
; ;
;
; ; ;
=1/0;=≫
;
www.nammakalvi.in

’ , ………………………
, , ; .
www.nammakalvi.in

V TOPPERS ACADEMY ,81, MASAKALIPALAYAM ROAD , HOPES – 9384590475
12-MATHS - CHAPTER -5- MINIMUM MATERIAL
; ; ;
; ; ;
; ;
; ; ;
;
;
; ;
; ; ;
;
; ; ; ;
;
www.nammakalvi.in

; ;
; ;
;
; ;
; ;
; ; ;
; ;
; ;
; ; ;
;
t
; ;
; ;
; ; ; ;
; ; ; ;
;
……………………………………….
; ; ……………………………………………..
; ; ;
; ……………….
; ; ;
; ;
; ; ;
……………………………………..
; ;
; ;
; ;
;
www.nammakalvi.in

;
; ;
;
; ;
; ; ; ;
; ; ;
;
;
;
; ;
; ;
;
;
;
;
;
;
; ; ; .
; ;
www.nammakalvi.in

;
; ;
; ;
; ;
;
; ;
;
; ;
; ;
;
;
; ;
www.nammakalvi.in

Lies on the circle
PARABOLA:
Type Y2=4ax Y2=-4ax X2=4ay X2=-4ay
vertex (0,0) (0,0) (0,0) (0,0)

focus (a,0) (0,-a) (0,a) (0,-a)
Eq.Direc X=-a X=a Y=- a Y= a
Eq.latus X=a X=-a Y= a Y= -a
rectum
L.L.R 4a 4a 4a 4a
Ellipse:
FORMULAS FOR CHAPTER -5
TYPE ELLIPSE HYPERPOLA
Centre C(0,0) C(0,0)

Vertices A(a,0) A(0,a)
A’(-a,0) A’(0,-a)
Foci F( ae,0) F( 0,ae)

F’(-ae,0) F’(0,-ae)
Equation X= ± ae y= ± ae
of
directrices
Equation X= ± a/e y= ± a/e
latusrectm
…………………………………… L.L.R 2b2/a 2b2/a
Equ of any Y=mx Y=mx

tangent ±√𝐚𝟐 𝐦𝟐 + 𝐛𝟐 ±√𝐚𝟐 𝐦𝟐 − 𝐛𝟐
Condition
to be C2=a2m2+b2 C2=a2m2-b2
tangent
Point of −𝐚𝟐 𝐦 𝐛𝟐 −𝐚𝟐 𝐦 −𝐛𝟐
( , ) ( , )
contact 𝐜 𝐜 𝐜 𝐜
Length of
majar axis 2a 2a
Length of 2b 2b
minor axis
Eccentricit 𝐛𝟐 𝐛𝟐
y e=√𝟏 − 𝐚𝟐 e=√𝟏 + 𝐚𝟐
Focal F1P+F2P=2a F1P~F2P=2a
property
,
V TOPPERS ACADEMY, 81, MASAKALIPALAYAM, HOPES -9384590475
CHAPTERS - 6, 8, 12 - MINIMUM MATERIAL
CHAPTER –12 ( n − m ) = (5 − 4) =1.

Verify the (i) closure property, (ii) Hence ( m − n ) ≠ ( n − m ). So the
commutative property, (iii) associative operation − is not commutative on ℤ.
property (iv) existence of identity and (v) (iii) In order to check the associative
existence of inverse for the arithmetic property, let us put m = 4, n = 5 and p = 7
operation + on ℤ Solution: in both ( m − n ) − p and m − ( n − p ) .
(i) Sum of two integer is again an integer , ( m − n )− p = (4 −5)−7=(−1−7)=−8 …(1)

closure property is true m −( n − p )= 4 −(5 −7)=(4+2)=6 . … (2)
Hence + is a binary operation on ℤ . From (1) and (2), it follows that
(ii) Also m + n = n + m ,_ ∀𝑚,𝑛∈ℤ. ( m − n ) − p ≠ m − ( n − p ).
So the commutative property is Hence – is not associative on ℤ .

satisfied (iv) Identity does not exist
(iii)∀a,b,c∈ℤ , a + (b + c) = (a + b) + c (v) So, Inverse does not exist .
Hence the associative property is satisfied
(iv) a + 𝑒 = 𝑒 + a = a⇒ e = 0. Verify the (i) closure property, (ii)
Thus ∃ 0 ∈ ℤ, ⋺ (a + 0) = (0 + a) = a. commutative property, (iii) associative
Hence the existence of identity is property (iv) existence of identity and (v)
assured. existence of inverse for the arithmetic
operation + on ℤ.Z = the set of all even
(v) ∀ a ∈ ℤ, ∃ − a∈ℤ, such that integers. Solution : Consider the set of all
a+ (−a) = (−a) + a = 0. Hence, the existence even integers ℤ= {2 k | k ∈ℤ} =
of inverse property is also assured. {...,−6,−4,−2,0,2,4,6,...}. Let us verify the
Thus we see that the usual addition + on properties satisfied by + on ℤ
ℤ satisfies all the above five properties.
Note that the additive identity is 0 and the (i) The sum of any two even integers is
additive inverse of any integer m is −𝑚. also an even integer. Because 𝑥,
………………………………………………………………… ∈ℤ𝑒⇒𝑥 = 2𝑚 and y = 2 n , 𝑚,𝑛∈ℤ .
……Verify the (i) closure property, (ii) So (𝑥 + 𝑦) = 2𝑚 + 2= 2(𝑚 + 𝑛) ∈ℤ
commutative property, (iii) associative = 2(𝑛 + 𝑚) = 2𝑛 + 2𝑚 = (𝑦 + 𝑥).
property (iv) existence of identity and Hence + is a binary operation on ℤ.
(v)existence of inverse for the arithmetic (ii)∀𝑥, ∈ℤ,
operation − 𝑜𝑛ℤ Solution: (𝑥 + 𝑦) = 2𝑚 + 2𝑛= 2(𝑚 + 𝑛) =2(𝑛 + 𝑚)
(i)Closure property : = 2𝑛 + 2𝑚 = (𝑦 + 𝑥).
Though − is not binary on ℕ; it is binary on So + has commutative property.(iii)
ℤ . To check the validity of any more Similarly it can be seen that ∀𝑥,,𝑧∈ℤ,
properties satisfied by – on ℤ , it is better ( x + y ) + z = x + ( y + z ) . Hence the
to check them for some particular simple associative property is true.
values. (iv) Now take 𝑥 = 2𝑘, then
2𝑘 + 𝑒 = 𝑒 + 2𝑘 = 2𝑘⇒𝑒 = 0 . Thus
(ii) Take m = 4, n = 5 and ∀𝑥∈ℤ , ∃ 0 ℤ , ⋺𝑥 + 0 = 0 + 𝑥 = 𝑥. So,
( m − n ) = (4 − 5) = −1and
0 is the identity element. 𝑚∗ (𝑛∗𝑝) = 𝑚∗ (𝑛 + 𝑝 − 𝑛𝑝) = 𝑚 + (𝑛 + 𝑝

(v) Taking 𝑥 = 2 and 𝑥 ’ as its inverse, − 𝑛𝑝) − 𝑚(𝑛 + 𝑝 − 𝑛𝑝) = 𝑚 + 𝑛 + 𝑝 − 𝑛𝑝 −
we have 2𝑘 + 𝑥 ’ = 0 = 𝑥 ’ + 2𝑘⇒𝑥’ = −2k = 𝑚𝑛 − 𝑚𝑝 + 𝑚𝑛𝑝…(2) From (1) and (2) we
𝑥’= −𝑥Thus ∀𝑥∈ℤ , ∃ − 𝑥∈ℤ, ⋺𝑥 + (−𝑥) = see that, (𝑚∗𝑛) ∗𝑝 = 𝑚∗ (𝑛∗𝑝) identity
element and hence the existence of identity is
(−𝑥) + 𝑥 = 0 Hence –𝑥 is the inverse of
assured.
𝑥∈ℤ
Verify (i) closure property (v) An integer 𝑚’ is to be found that
(ii) commutative property, and 𝑚∗𝑚’ = 𝑚’∗𝑚 = 𝑒, ∀𝑚∈ℤ So, 𝑚∗𝑚’ = 𝑚 +
(iii) associative property of the following 𝑚’− 𝑚𝑚’= 0 𝑚’− 𝑚𝑚’= −𝑚𝑚’(1 − 𝑚)
operation on the given set. = −𝑚𝑚’= − 𝑚 (1−𝑚) is not defined at (1 −
(𝑎∗𝑏) = ;∀𝑎,𝑏∈ ℕ (exponentiation property) 𝑚) = 0, that is at 𝑚 = 1
Solution : (i)closure is true ; Hence inverse does not exist in ℤ.
𝑎∗𝑏 = 𝑎𝑏 ;∀𝑎,𝑏∈ℕ. So, ∗ has associative property .
So ∗ is a binary operation on ℕ . (iv) An integer 𝑒 is to be found that

(ii) associative property: 𝑚∗𝑒 = 𝑒∗𝑚 = 𝑚, ∀𝑚∈ℤ
𝑎∗𝑏 = 𝑎𝑏and 𝑏∗𝑎 = 𝑏𝑎.
So, 𝑚∗𝑒 = 𝑚 + 𝑒 − 𝑚𝑒 = 𝑚
Put, 𝑎 = 2 and 𝑏 = 3.Then 𝑎∗𝑏 = 23 = 8 but
𝑒 − 𝑚𝑒 = 𝑚 − 𝑚 (1 − 𝑚) = 0 Gives, 𝑒 = 0
𝑏∗𝑎 = 32 = 9
𝑎𝑛𝑑 (1 − 𝑚) = 0
So a ∗b need not be equal to b ∗ a.
Hence ∗ does not have commutative property. But m is an arbitrary integer and hence need
not be equal to 1. So the only possibility is
𝑐
(iii)𝑎∗ (𝑏∗𝑐) = 𝑎∗ (𝑏𝑐) = (𝑏 ).;
𝑒 = 0. Also 𝑚∗ 0 = 0 ∗𝑚 = 𝑚. Hence 0 is the
𝑐
But (𝑎∗𝑏) ∗𝑐 =(𝑎𝑏) ∗𝑐 = (𝑎𝑏) = 𝑎𝑏𝑐
identity element and hence the existence of
identity is assured
𝑎∗ (𝑏∗𝑐)≠ (𝑎∗𝑏) ∗ c ,
Associative property is not true . (v) An integer m’ is to be found that
Verify (i) closure property, (ii) commutative 𝑚∗ m’ = m’∗𝑚 = 𝑒, ∀𝑚∈ℤ So,

property, (iii) associative property, (iv) 𝑚∗m’ = 𝑚 + m’ − m m’ = 0
existence of identity, and (v) existence of
inverse for following operation on the given m’ − 𝑚 m’ = −𝑚m’ (1 − 𝑚) = −𝑚m’ = − 𝑚/
set. 𝑚∗𝑛 = 𝑚 + 𝑛 −𝑚𝑛 ;𝑚,𝑛∈ℤ (1−𝑚) is not
defined at (1 − 𝑚) = 0, that is at 𝑚 = 1
Solution:
Hence inverse does not exist in ℤ.
(i) 𝑚 + 𝑛 − 𝑚𝑛 is clearly an integer and hence
∗ is a binary operation on ℤ. Example 12.9
(ii) 𝑚∗𝑛 = 𝑚 + 𝑛 − and Verify (i) closure property,

= 𝑛 + 𝑚 − 𝑛𝑚= 𝑛∗𝑚𝑚∗𝑛 = 𝑛∗𝑚So, ∗ has (ii) commutative property,
commutative property .
(iii)Associative property(𝑚∗𝑛) ∗𝑝 = (𝑚 + 𝑛 − (iii) associative property,
𝑚𝑛) ∗𝑝 = (𝑚 + 𝑛 − 𝑚𝑛) + 𝑝 − (𝑚 + 𝑛 − 𝑚𝑛)𝑝
= 𝑚 + 𝑛 + 𝑝 − 𝑚𝑛 − 𝑚𝑝 − 𝑛𝑝 + 𝑚𝑛𝑝…(1)
www.nammakalvi.in

(iv) existence of identity, and (v) existence of Inverse of 0 is 0 ; Inverse of 1 is 4
inverse for the operation +5 on ℤ5 using
Inverse of 2 is 3 ; Inverse of 3 is 2
table corresponding to addition modulo 5.
Inverse of 4 is 1
Solution: We know that
………………………………………………………………………
Example 12.10 Verify (i) closure property,

ℤ5 = {[0],[1],[2],[3],[4]}
(ii) commutative property, (iii) associative
+5 0 1 2 3 4 property, (iv) existence of identity, and (v)
existence of inverse for the operation ×11on a
0 0 1 2 3 4
subset A ={1,3,4,5,9} of the set of remainders
1 1 2 3 4 0 {0,1,2,3,4,5,6,7,8,9,10}.
2 2 3 4 0 1 Solution: Given 𝐴 = {[1],[3],[4],[5],[9]}
3 3 4 0 1 2 ×111 3 4 5 9
4 4 0 1 2 3
1 1 3 4 5 9
(i)closure property : Since each box in the
3 3 9 1 4 5
table is filled by exactly one element of +5 ,
4 4 1 5 9 3
the output 𝑎+5𝑏 is unique and hence +5 is a
binary operation. (ii) The entries are 5 5 4 9 3 1
symmetrically placed with respect to the main
9 9 5 3 1 4
diagonal. So +5 has commutative property.
(i) Since each box in the table is filled by
(iii) The table cannot be used directly for the
exactly one element of ×11 , the output 𝑎 ×11
verification of the associative property. So it is
𝑏 is unique and hence ×11 is a binary
to be verified as usual. For instance,
operation.
(2 +5 3) +5 4 = 0 +5 4 = 4 (mod 5) (ii) The entries are symmetrically placed with
respect to the main diagonal. So ×11 has
and 2 +5(3 +5 4) = 2+5 2 = 4 (mod 5) commutative property.
Hence (2 +5 3) +5 4 = 2+5 (3 +5 4). (iii) The table cannot be used directly for the
verification of the associative property. So it
Proceeding like this one can verify this for all
is to be verified as usual. For instance,
possible triples and ultimately it can be shown (3 ×11 4) ×11 5 = 1 ×11 5 = 5 (mod 11) and
3 ×11 (4 ×11 5) = 3 ×11 9 = 5 (mod 11)
that +5 is associative. Hence (3 ×11 4) ×11 5 = 3 ×11 (4 ×11 5).
Proceeding like this one can verify this for all
(iv) The row headed by 0 and the column possible triples and ultimately it can be shown
headed by 0 are identical. Hence the identity that ×11 is associative.
element is 0. (iv) The row headed by 1 and the column

headed by 1 are identical. Hence the identity
(v) The existence of inverse is guaranteed element is 1.
(v) The existence of inverse is guaranteed
provided the identity 0 exists in each row and
provided the identity 1 exists in each row and
each column. From the table, each column. From the table,
Inverse of 1 is 1 ; Inverse of 3 is 4 ; (−60−28) /15 = − 88/ 15
Inverse of 4 is 3 ; Inverse of 5 is 9 ; ………………………………………………………………………
Inverse of 9 is 5 4. Let A = {𝑎 + √5𝑏∶𝑎, ∈ℤ } . Check whether
the usual multiplication is a binary operation
………………………………………………………………………
on A .
EXERCISE 12.1 1. Determine whether ∗ is a Solution: Let A = {𝑥, } Such that = 𝑎 + √5𝑏
binary operation on the sets given below and 𝑦 = 𝑐 + √5𝑑and 𝑎,𝑏,𝑐,𝑑∈ℤ Now, 𝑥𝑦 = (𝑎 +
(i) 𝑎∗𝑏 = 𝑎.|𝑏| ℝ √5𝑏 )(𝑐 + √5𝑑) = 𝑎𝑐 + √5𝑎𝑑 + √5𝑏𝑐 + 5𝑏
= (𝑎𝑐 + 5𝑏𝑑) + √5(𝑎𝑑 + 𝑏𝑐) ∈𝐴∴𝑥𝑦∈𝐴. The
(ii) 𝑎∗𝑏 = min(𝑎,𝑏) 𝑜𝑛𝐴= {1,2,3, 4,5} usual multiplication is a binary operation
(iii) (𝑎∗𝑏) = 𝑎 √𝑏 𝑖𝑠 𝑏𝑖𝑛𝑎𝑟𝑦 𝑜𝑛 ℝ . on A .
Solution: (i) Let 𝑎, ∈ℝ ; Then |𝑏| ∈ℝ
Hence, 𝑎.|𝑏| ∈ℝ ,∀𝑎,𝑏∈ℝSo, ∗ is the binary 5.(i)Define an operation∗ on ℚ as follows:
operation on ℝ. 𝑎⋆𝑏 = (𝑎 + 𝑏)/ 2 :𝑎,𝑏∈ℚ .
(ii) 𝑎∗𝑏 = min(𝑎,𝑏) 𝑜𝑛𝐴 = {1, 2, 3, 4, Let Examine the closure, commutative, and
𝑎,𝑏∈𝐴 ; Then min(𝑎,𝑏) ∈𝐴 associative properties satisfied by ∗ on ℚ.
For Example, min(3,4) = 3 ∈𝐴, (ii)Define an operation∗ on as follows:
min(2,5) = 2 ∈𝐴 So, 𝑎∗𝑏 = min(𝑎,𝑏) 𝑎⋆𝑏 = (𝑎 + 𝑏)/ 2 :𝑎,𝑏∈ℚ .
∈𝐴,∀𝑎,𝑏∈𝐴So, ∗ is the binary operation on 𝐴. Examine the existence of identity and
existence of inverse for the operation ∗ on ℚ.
(iii) (𝑎∗𝑏) = 𝑎√𝑏𝑖s bi𝑛𝑎𝑟𝑦 𝑜𝑛 ℝ Let 𝑎,b ∈ℝ
(I) Solution: commutative
If b is positive then √𝑏∈ℝ, but even Given 𝑎, ∈ℚ It gives 𝑎 + 𝑏∈ℚ.
Hence (𝑎+𝑏)/ 2 also ∈ℚ.
though –𝑏∈ℝ , √−𝑏∉ℝ .
So, ∗ is closure on ℚ.
For example 2, −4 ∈ℝ (i) 𝑎∗𝑏 = (𝑎 + 𝑏)/ 2 :𝑎,𝑏∈ℚ
𝑏∗a = (𝑏 + 𝑎)/2
But 2√−4 = 2√2𝑖∉ℝSo, ∗ is not a binary
𝑎∗𝑏=𝑏∗a
operation on ℝ
So, ∗ is commutative on ℚ.
𝑏+𝑐
……………………………………………………………………… 𝑏+𝑐 𝑎+
2
ASSOCIATIVE :∗ (𝑏∗𝑐) = 𝑎∗ 2 ; =
2. On ℤ , define ⊗ by (𝑚⊗𝑛) = 𝑚𝑛 + 𝑛𝑚: 2
∀𝑚,𝑛∈ℤ. Is ⊗ binary on ℤ ? 2𝑎+𝑏+𝑐
2 2𝑎+𝑏+𝑐
Solution: Let m, 𝑛∈ℤ. = --------(i)
2 4
Take 𝑚 = 3, = −2,
𝑎+𝑏
1 +𝑐
then m𝑛 + 𝑛𝑚= 3−2+ (−3)2 = 3−2 + 9 (𝑎∗𝑏) ∗𝑐= 𝑎+𝑏
∗𝑐= 2
2 2
= (1 /9 )+ 9 = 82/ 9 ∉ℤ So, (𝑚⊗𝑛) ≠ ℤ
𝑎+𝑏+2𝑐
Hence, ⊗ is not a binary operation on ℤ . 2 𝑎+𝑏+2𝑐
= = ……….(ii)
……………………………………………………………………… 2 4
3. Let ∗ be defined on ℝ by Hence, 𝑎∗ (𝑏∗𝑐) ≠ (𝑎∗𝑏) ∗𝑐
(𝑎∗𝑏) = 𝑎 + 𝑏 + 𝑎𝑏 − 7 . Is ∗ binary on ℝ ?
If so, find 3 ∗ (− 7 /15 ) . So, ∗ is not associative on ℚ.
Solution: Let 𝑎, ∈ℝ ; (ii) IDENTITY :
Then 𝑎 + 𝑏 + 𝑎𝑏 − 7 ∈ℝ So, ∗ is the binary
Given 𝑎∈ℚ. Let 𝑒 be the identity.
operation on ℝ.
3 ∗ (− 7 /15 ) = 3 + (− 7/ 15 ) + 3(− 7 /15 ) − 7 Then 𝑎∗𝑒 = 𝑒∗𝑎 = 𝑎
= 3 − (7 /15)–(21/ 15)− 7 = −4 –(28 /15) =
𝑎+𝑒
= ; 𝑎 + 𝑒 = 2𝑎 ;𝑒 = 2𝑎 − 𝑎
2
𝑒 = 𝑎, is the identity element.

For every element 𝑎 belongs to ℚ, we get
𝑎 is the identity. Since identity element is
unique, ∗ has no identity.
INVERSE : Since there is no identity,
inverse of 𝑎 that is 𝑎−1 cannot be defined.
That is,∗𝑎−1 = 𝑎−1∗𝑎 = 𝑒, cannot be
defined. Hence ∗ has no inverse. ...........
..........................
.....................................
www.nammakalvi.in

www.nammakalvi.in

Solution:
(i) It contains 3 variables 𝑝, 𝑎𝑛𝑑𝑠 So,

number of rows needed = 23 = 8
(ii) It contains 6 variables 𝑝,,,𝑣 So, number

of rows needed = 26 = 64
………………………………………………………………………
Example 12.15
Write down the (i) conditional statement
(ii) converse statement (iii) inverse

statement, and(iv) contra positive statement
for the two statements p and q given below.
p : The number of primes is infinite.
q : Ooty is in Kerala.
Solution:
Then the four types of conditional statements
corresponding to p and q are respectively
listed below.
(i) p→q : (conditional statement)
“If the number of primes is infinite then

Ooty is in Kerala”.
(ii) q→ p : (converse statement)
“If Ooty is in Kerala then the number of
primes is infinite”
(iii) ¬p→¬q (inverse statement)
“If the number of primes is not infinite

then Ooty is not in Kerala”.
(iv) ¬q→¬p (contra positive statement)
“If Ooty is not in Kerala then the number

of primes is not infinite
Example 12.13
How many rows are needed for following
statement formulae? (i) 𝑝∨¬ t ∧ (𝑝∨¬ s)
(ii) ((𝑝∧𝑞) ∨ (¬ r ∨¬ s)) ∧ (¬ t ∧ v)
www.nammakalvi.in

www.nammakalvi.in

.....................
..........
.....................
www.nammakalvi.in

.................................................
www.nammakalvi.in

........................................
............................
www.nammakalvi.in

www.nammakalvi.in

www.nammakalvi.in

www.nammakalvi.in

CHAPTER 8
; ;
; ,
; ;
+
; ;
; +
www.nammakalvi.in

; ;
; ;
; ;
; , ;
; ;
; ;
; ; ;
; ; ;
www.nammakalvi.in

www.nammakalvi.in

www.nammakalvi.in

Namma Kalvi 12th Maths Minimum Learning Study Material em 217100

Uploaded by

Copyright:

Available Formats

You might also like

Namma Kalvi 12th Maths Minimum Learning Study Material em 217100

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Namma Kalvi 12th Maths Minimum Learning Study Material em 217100

Uploaded by

Copyright:

Available Formats

Namma Kalvi

V TOPPERS ACADEMY ,81, MASAKALIPALAYAM , HOPES -9384590475

MATRICES AND ITS APPLICATIONS

V TOPPERS ACADEMY ,81, MASAKALIPALAYAM , HOPES -9384590475

V TOPPERS ACADEMY ,81, MASAKALIPALAYAM , HOPES -9384590475

V TOPPERS ACADEMY ,81, MASAKALIPALAYAM , HOPES -9384590475

by using gaussian elimination method

V TOPPERS ACADEMY ,81, MASAKALIPALAYAM , HOPES -9384590475

V TOPPERS ACADEMY ,81, MASAKALIPALAYAM , HOPES -9384590475

V TOPPERS ACADEMY ,81, MASAKALIPALAYAM , HOPES -9384590475

V TOPPERS ACADEMY ,81, MASAKALIPALAYAM , HOPES -9384590475

V TOPPERS ACADEMY ,81, MASAKALIPALAYAM , HOPES -9384590475

V TOPPERS ACADEMY ,81, MASAKALIPALAYAM , HOPES -9384590475

V TOPPERS ACADEMY ,81, MASAKALIPALAYAM ROAD , HOPES – 9384590475

V TOPPERS ACADEMY ,81, MASAKALIPALAYAM ROAD , HOPES – 9384590475

V TOPPERS ACADEMY ,81, MASAKALIPALAYAM ROAD , HOPES – 9384590475

V TOPPERS ACADEMY ,81, MASAKALIPALAYAM ROAD , HOPES – 9384590475

Lies on the circle

Type Y2=4ax Y2=-4ax X2=4ay X2=-4ay

vertex (0,0) (0,0) (0,0) (0,0)

Centre C(0,0) C(0,0)

Foci F( ae,0) F( 0,ae)

Equ of any Y=mx Y=mx

CHAPTER –12 ( n − m ) = (5 − 4) =1.

(i) Sum of two integer is again an integer , ( m − n )− p = (4 −5)−7=(−1−7)=−8 …(1)

So the commutative property is Hence – is not associative on ℤ .

0 is the identity element. 𝑚∗ (𝑛∗𝑝) = 𝑚∗ (𝑛 + 𝑝 − 𝑛𝑝) = 𝑚 + (𝑛 + 𝑝

𝑎∗𝑏 = 𝑎𝑏 ;∀𝑎,𝑏∈ℕ. So, ∗ has associative property .

So ∗ is a binary operation on ℕ . (iv) An integer 𝑒 is to be found that

Verify (i) closure property, (ii) commutative 𝑚∗ m’ = m’∗𝑚 = 𝑒, ∀𝑚∈ℤ So,

(ii) 𝑚∗𝑛 = 𝑚 + 𝑛 − and Verify (i) closure property,

V TOPPERS ACADEMY, 81, MASAKALIPALAYAM, HOPES -9384590475

Example 12.10 Verify (i) closure property,

element is 0. (iv) The row headed by 1 and the column

𝑒 = 𝑎, is the identity element.

V TOPPERS ACADEMY, 81, MASAKALIPALAYAM, HOPES -9384590475

V TOPPERS ACADEMY, 81, MASAKALIPALAYAM, HOPES -9384590475

(i) It contains 3 variables 𝑝, 𝑎𝑛𝑑𝑠 So,

(ii) It contains 6 variables 𝑝,,,𝑣 So, number

Write down the (i) conditional statement

(ii) converse statement (iii) inverse

p : The number of primes is infinite.

Then the four types of conditional statements

corresponding to p and q are respectively

(i) p→q : (conditional statement)

“If the number of primes is infinite then

(ii) q→ p : (converse statement)

“If Ooty is in Kerala then the number of

(iii) ¬p→¬q (inverse statement)

“If the number of primes is not infinite

(iv) ¬q→¬p (contra positive statement)

“If Ooty is not in Kerala then the number

How many rows are needed for following

statement formulae? (i) 𝑝∨¬ t ∧ (𝑝∨¬ s)

(ii) ((𝑝∧𝑞) ∨ (¬ r ∨¬ s)) ∧ (¬ t ∧ v)

V TOPPERS ACADEMY, 81, MASAKALIPALAYAM, HOPES -9384590475

V TOPPERS ACADEMY, 81, MASAKALIPALAYAM, HOPES -9384590475