MAC - 10 2 SHREY AGRAwAL

Assigomert-1 20 1171 17, EC E

1. (a) True
(b) Not a val'd mathematical staternent
(Supposethon is sy a bypothe sis)
(c) Nota valid mathemtcal statement
( Does not hold any tuth vale)
(d) Not a valid mthematical staternent
(Hypothesis )
(e) True
(f) Tue
9)True
(ror vopevation, cny one statement may be tue for the compoud strtement
to be tue)
(h) True (weak form of inplicaton )
(c) True

(k) false

( )True
(n) False
(Here we consider avb itray non-zeYO matx )
(n) False
(for n0,
Ot1
= 0 tS cun
integer)
2. (a) is nei ther eaal to 1, or eual to 1
(Aternatively: * is not equal to Land is nat e4,ual to -L)
(b) Thee is a real number for every iteger n Such that ns
(c) All plarar graphs Can be coloured with atmost four colours
IA) here exist sone integers a and b such tht b agtr for ay
4, ad . integers
 (e) Sone proper sets of all inftiote Sets are infini te.
3. Ca) Converse :
integer, then a ad b are integers.
Conrapositive :
1f a is not an teger, then a is not n integer
integer.
(b) Converse :
If a graph is connected, it must be Eulerian.

Contrapositiv ive :

is not connected, it cannot be Eulerian

(c) Converse :
eal nunbes and
Lf f is not onto, then there exist
and et yt + =0

Contrapositive :
and y, =y or the
Tf f 's onto, the for all eal numbers
condition e t ytyt cty #o holds.

4. (a) 3continuous functio ns which are not diffeetiable.

(b) ny largest real nunber.
(c) pos itive integers C,prime s (prime s'Pi Pa pe) such that
real.
(d) polynomials whose Toots ave not
(Alternatively: polynomials with no Yeal oots. )

5. (A) True
To show: cE IR, dné 2 Such that n< <n+1

Proofi let A= {ne nse}

let that A is enpty
> An¬ R Such that nsc

is the infimun for ,the set of integcrs

As isunbourded set, we have qrived at a contradic tion
n

> Ais non-empty

clearly, A is bounded above.
By Comp leteness axiom, A has a least bound S = supA

Vsia prcperties of supemun,

oe A suchttat s-1 <o s
'nEA,ns
 (3
Now, S-1 <n
’ s <nt 1

supA
’n+ 1 A

ns <nt 1
(8) False
The statement is incorect as a fixed value of n enforces a least
per
bound and a greatest lower bound on the set of veal members which is
cs unbounded set. The following courter er cnple uffices for the proofi
Take 0 > nS o < n t 1 ’ n=0
Take 1 ns 1 < n t 1 ’ n =1
As a i x e d value ofn i s rot obtained, no suchn exists .

6. (a) (et be the Smallest positive eal number

We have < 1

(': o,the re4,ualcty holds)

is a smaller positie eal number ttan
Aa Smallest positive real nunber
(b) <et that N2 be a fational nunber
As this is of the form a, we get

cleary a¬ @, be Q and a°e @

is a irrational nmber.
Let

clearly aé @', be q' cnd ae

irYational nubers a and b such that a is rational.

(c) Let p and y be two rational numbers, such tHot p< wlog
Consider r= P
clear y
Now, -p P-p
pty- P <

Connbini p<r<Y
9.E.D.
 (d) ( )Given that n is odd
n = 2k +i , ke
>n3= (2kt 1) 3
= 8k t 12kr 6kt !
= 2(4 k` +6k' 3k) t 1

= n iS odd
(E) Given that n' i odd
n =2k+ i, kE Z
’ 2k = n 1
= (n-1) (n'+ n 1)
= (n-1) ( n(n+ 1) + 1)
2 n(nt 1) (: Product of consecutive integers iseven)
’ nlo+ 1) + 1 is odd
Also, 2 2k
>n-1 muSt be even
’ n is odd
7. (a) Givern that ot 1 = 2m
As 2 n , n+ 1 must also be even
’n' is o dd
’n? = 2kt 1 , ke 2
’ 2k = ? 1
= (nt 1) (n-1)
1f n is even, both nt 1 and n-1 ae odd, and So is heir
product. But
2k us even,
n is odd.
Ket = 2 t1 , EK

From O,
(22t 1)*+ 1 = 2m
’4+ 4 t 1 t 1 = 2m

’ 2t 2 + 1 = nm

e + (a+ 2c t 1) = m
)

from ,
(n ( )
(4)
9.E.D.
=pt where p cnd n ane both integers (:n is odd)
 (b) Plug n= 4373 in above express (on (5
= 2186
1 = 2 187

956 1565 = 2186t 2187

8. (a)
Countevexample: Teke 0 =
we get 2c"+ 3y = 2(0)+ 3(o)' =
(b) Counterexample: Take o
teR
clearly, LHS # 1 (= RHS)
(c) Counterexample : Take a= 2 = b
Clearly a,be R
ab a.N2 =2 ¬ @
But a ,b
As the ctecedart is true but not the conseuent,
the statement cs false.
Take n41
(d) Counterex ample: 4L (41t 1t 1) = 41x43
f(41) = 1 t 4L + 4 1
As 41t(91) and 43|f(91) , it cannot be prine

9. No, this
does not inpy the given propo sition, Here is a counterexarnple :
196o7843
3333 33 331 = 17x
" 17333333 3 3 1, 333 33 3 33 1 is not prine.
(~p^)alpvr)
0. (a) ( v p y ) ^ pVr)
(~pvn) ^(pvr)
P
F F
F F F F
T F F

F F F F
F T T

T F T
F
F T F
T
F F F

(b)we have,
(et s = (p »( r ) ((PAs)r)
 P Y
4rp’(4)pvp^rr S (G

T F
T

T F F
F
T
F F
F T
T F
F F

11. PT 4:T T:T, s:T

nY:F ns F

P
lp ’ (4anr)] v I l n s v ) ] : T
true.
.The truth value of given statenent is
12. (a) p > r p ) a (4r)
T
T F F
T F F T
F T
F T
F T T T T
F
F T
T
T T
F T
T
where S deotes the gven statement
As the truth value of s is always true, it Tepresert s
(b) T P,4, nd r vepre sest three events, happns
wherever y happen s thes r must
whene ver p happens and tautologg
hoppens Thus the given
impliaton ep
intuitiey happn wheneer
happens. vesents a tautology
1Z. let u [pv (nr $)] l s > (nt vp)) v(v ’r))
Lpv(Y ns)]
lp
y s’ (nt vp)) v(n’r))

If pis tru
-true, is true contains or perntion )
Sinilarlyu would be tue.

s false, we cons truct the tru th table :

If P
 L
L
L

-Rsonof

St d
[(oad) ):.) (be (4ad)

)A vd (4
(4vdn)asn
 (8

17. (a) we use

tthe princple of mathematical induction:
for n 1, 2n 1 2 - 1 =3hicb is divisble by ß.
Let that the Tes ult hods tor n k

»32-1
’2k 3m, -1 = mt N
Now, for n= kt i,
2(kt 1)
2
- 1
2k

= (3m 1) 4 - 1 from o)
= 12 m t 4-L
= 12 m t 3

=3(4mt 1)
=3 e , where

.. 2n -1 is divisible by 3 n l
(b) Agan, testg for n=L , we ha ve,
5tnt 1 5'+ 1tI = 7, whwh is divisible by 7
Let that it holds for n=k
’5* t kt 1 7n, me NI
Now for n kt 1,
5"+ n t 1

: 35m- 4k -3
(Usirg O)

clearly the Tesult would hold for nzkti if 7|4kr3

Example : 1f K= 2, k +3 = Ll , which is not divisible by y
>5^ +nt1 is not divisi ble by 7
e esult is not tue.. for n 2 t 1 = 3
 18, Usng inducthon,
For n=2,

, holds good

ket that it holds for n= k, ie:,

f r n= ktl,
kt 1

2i-*i-) i= 2
(*-i-1)
k

(7CKt1
(fom 0)

19. FOr n=2, the stateent holds as 2 is a prine number.

<et k> 2¬ NI
Ket that me NI such that 2 < msk, m is ehex
prine or it Can be
eypressed as produt of prines
that m,n, ¬ NI with 2
Suppose m, m,< k Such that
mm, kt L
we have the
fact that m, and m, are ether primes r prod uct of primes
’njm, is a prouct f primes
’ kti is product of primes.
Conversely, i Mime NI wcth 2m m k nd , m, =k+1,
then k+1 is prime,
. . k+ 1 CS either prime OY
the prouct of prime numbers
there Cs only 1 line
20. FY n:2
joing,
= 1, the vesult hods.
the two points
2
that k(k-1) Cines
ot that it holos for n=k, implying ave there.
- k+ 1, there s one extra point avaclable to construt lioes.
witt k
" his point would conrect already existig points, kntw lines
formed Yesulting in a total of the following number of lines :
k (k-1)+k = k´-k+ 2k = kt k k(k+ 1) (kt 1)[(k+1) -1)
The reSult holds good foY n= kt. 2

9.ED.