### 10th maths solutions

Welcome to our website....Click here to solution of Exercise 1.4

Click here to solution of Exercise 1.5

Click here to solution of Exercise 1.5

Maths Tips, Notes, Hints and Solutions for CSIR-NET Maths, TRB Maths, TNPSC Maths, UG and PG Maths, Polytechnic Maths, Mathematical and Numerical aptitude, TN State Board Maths for 12th to 8th standard, Maths fun, Learn Maths Easily..

- Get link
- Other Apps

Click here to solution of Exercise 1.5

- Get link
- Other Apps

Group (Defn) A non-empty set G with binary
operation • or ∗
is said to be group if G satisfies groups
laws,〈group
denoted by (G,∗)〉**Groups laws **1.Closure
lawa,b ϵ G ⇨ a ∗ b ϵ G2.Associative lawa,b,c ϵ G ⇨(a∗b)∗c =a∗(b∗c)3.The existence of Identitythe exists e ϵ G such that
a ∗ e = e ∗a = a, ⩝ a ϵ G4.The existence of Inversethere exists aʹϵ G such that aʹ∗a
= a∗aʹ, ⩝ a ϵ G.**Commutative Group or Abelian Group**Let G be a group with binary operation ∗ 〈i.e
(G,∗)
be a group〉then for every a,b ϵ G such that a∗b =b∗a**Quasi Group**Let G be a non
empty set then G satisfies closure law onlya,b ϵ G ⇨ a ∗ b ϵ G**Semi-Group**Let
G be a non empty set then G satisfies closure law and associative
law only closure: a,b ϵ G ⇨ a ∗ b ϵ G associative:
a,b,c ϵ
G ⇨(a∗b)∗c =a∗(b∗c)**Monoid**Let
G be a non empty set then G satisfies closure law , associative law and identity existence
onlyclosure: a,