(a) The negation of p v (-iq) Is (p v q) /\ (-ip)
This statement is false. To find the negation of
a logic,a l statement, we apply De Morgan's
laws. De Morgan's laws state that:
• -, (p V q) = (, p) A ( , q)
• , (p /\ q) = (, p) V (, q)
Applying De Morgan's law to the given
statement:
Therefore, the negation of p V ( , q) is ( , p) /\ q,
not (p V q) /\ (, p).
Final Answer: The statement is false.
(b) The equation 2x3 - 8x - 3 = 0 has no
real root between -2 and -1.
Let's analyze the function/ (x) = 2x 3 - Bx - 3.
We can check the values of the function at
x = - 2 and x = - 1:
f (- 2) = 2(- 2):i - 8( - 2) - 3 = - 16 + 16 - 3 =
f( - 1) = 2(- 1):i - 8( - 1) - 3 = - 2 + 8 - 3 = 3
Since / (-2) < 0 and f (-1 ) > 0, a.nd the
function is continuous, by the Intermediate
09 :29 ":,11t<sis i'.fe
•
•
Answer
(d) The series is 1 -
1
2 + 1
4 -
1
8 + . . .. Th.1s ·1s a
geometric series with the first term a = I and
the common ratio r = - ~. Since Ir I = ~ < 1,
the series converges. The sum of an infinite
geometric series is given by 1 ~r, so the sum is
1 2 hf h ..
1- (- ½) = 1 = 3. T ere ore, t e series 1s
i
convergent, not divergent. The statement is
false.
(e) An integrable function can have a finite
number of points of discontinuity. This is a
property of Riemann integrable functions. For
example, a step function with a finite number
of steps is integrable. The statement is true.
n u 0 us, by th,e l ntermediat:e
function1is conti1 1 1
Value Th e orem, there must be at least 0 ne real!
1 1 1
root b etwee n - ,2 and -l
1
1
F'ln,al Ans,we r: The statement is false. 1
(c)i The lun ct:lon .f deflned b'Y 1 1 1
f(x) == - lxl + 71, Vx ER., ha:s a lacal
maxlm1a .
The fun ction /(a!) - - Ix~+ 71 is an e·v en
1
functio,·n with a maximum ·value at. x ==- O. r ·h,e,
a,b-,s olute v alu1e 'f unctionr lz·I is, a11w·a ys1non-
1
neg1 a tive,. so1 is 1
a lway·s n10 n-1 - lzli
p a,s,itive. 1
Therefor,e,. the maximum1v,a1llu1e of /(x) occurs
ait x· = 1 /(0) 1+ '71 = 71.
10~
1
0, W'h ere =::: - Th is. is
1
, and since· c gl.01b al
a g,l10 ball m aximu1m1 1
,m aximum is als,o a loc,al m axi1
m um, the 1
stat eme nt is t ru1e.
1
1
1
Flnal Answ,er: Th,e statement is tr ue.. 1
Question 2(a):
Using the principle of induction, prove that
n3 -f- 2n is divisible by 3, for all n E N .
Solution: We wi ll use t he principle of
mat hemat ical ind uction.
Step 1 (Base Case): For n = 1.
n 3 + 2n = 13 + 2( 1) = 1 + 2 = 3
which is divisi ble by 3. Hence, th e base case is
true.
Step 2 {Inductive Hypothesis): Assume t hat
n 3 + 2n is divis ible by 3 for some n = k . That
k 3 + 2k = 3m for som e in teger m.
Step 3 (Inductive Step): We need to prove t hat
(k + 1) 3 + 2{k + 1) is divisible by 3.
(k + 1)3 4- 2(k + 1) = 3 2
k -f- 3k + 3k + 1 + 2k
-1,
From the inductive hypot1 u,~s is, k
3
+ 2k is
th,e ratl,o t,est. The gen,era:!: term is ,anxn.
1 . Co,mp,ut,e the ratio:
(' (:n+ l')''.' )?- - n -4-1
n - 1' x:n.
-n--1- . ' +1 (2(n+ 1)-¼- 1)! X
· n.1· 2 .1i
(2n + l)! X
Simplify:
a n.+l·xn+
. l ((ri+ 1)1) 2 (2:n , - 1)!:
. - - - - x '.
a,n xn (2n + .3)! (n!)'2 . -.
2. Take the !imrt as n -> ,oo:
an+ l arr1.-1- 1 ,•
· -- l1m
(n + 1 y2
n➔oo a-nxn ·n - +oo (:2n + 3) (2n + 2
3. By the ratilo test, th e series converges
1
w,lhen:
lxI
4 "
< i ilxl < 4.
nvergence is R ==
Th us, the rad rus of co1 4.
9:42 ~ L!;- .4i Iii 67%
ChatGPT v
umethat
n = k. That
tegerm.
o prove that
by 3.
2
+ 3k + 1 + 2k + 2 = (k 3 + 2k} + 3(k2 + k + 1
+ 2k Is
is clearly
2(k + 1) is
2n is
monotone, calculate the difference
(n+l) 2 - l n2 -l
a n+ l = (n + l)' + l ' an = n' + 1 ·
((n + 1) 2 - l)(n2 + 1) - (n 2
an+ l - a,, = ((n + 1)2 + 1)(n2
Simplifying the numerator:
((n + 1) 2 - l)(n2 + 1) - (n 2 - l)((n + 1) 2
Thus,
lln+ I - Un = 4n >O
((n + 1) 2 + l) (n2 + 1)
Hence, (an) is monotonically increasing.
n 2~ 1
2. Boundedness: For an = n + l'
n2 - 1
-1 < ,,~-,- <1 for all n > 1.
n +1
2
Hence, (an) is bounded .
,I,
Thus, ( an) is monotone and bounded .
Question 2(c):
Find the radius of convergence of the power
.
senes
"
~
n h
anx , w ere Un = (n' )'
2n+ 1 ! ·
Solution: To find the radius of convergence, use
the ratio test. The general term is anxn.
1. Compute the ratio:
n +I ((n+ l )!)2 n+ I
a1t+lX (2(n+ l + J ! X
ax"
n
Simplify:
((n + 1)!) 2 . (2n + 1)!
(2n + 3)! (n!) 2 X = (2
2. Take the limit as n ➔ oo:
r (n + 1)' I
= n~~ (2n -,- 3)(2n + 2)
3. By the ratio test, the series converges
when:
lxl
late the difference
)2 - 1 n2 - 1
)' + 1, an = n' + 1 .
(n + 1) 2 - l)(n2 + 1) - {n2 - l)((n + 1) 2 + 1)
((n + 1) 2 + l){n2 + 1)
umerator:
(n' + 1) - (n 2 - l)((n + 1) 2 + 1) = 4n.
4n > 0 for all n > 1.
(n + 1) 2 + l)(n 2 + 1)
onotonlcally Increasing.
n 2- 1
ora.n = n + 1'
ounded.
one and bounded.
.a 10:
-1-1 ((11~+ 1)!) 2 n+l
(2(n+ I)+ 1)! X
""l .1)2
( ',, t1
(2n+ l)1 X
as n--+ co:
.+ 1 . (n + 1)2 lxl
n~oo (2n + 3)(2n + 2) JxJ c-- 4 ·
1
'""'
st, th,e· serl,es conver,ges
•convergence· is: R ~ 4.
:,1ep., \lnoucuve :,tepJ; vve neeu tu pruve Utcll
(k + 1)3 + 2(k + 1) is divisible by 3.
(k + l )3 + 2{k + 1) = k 3 + 3k 2 + 3k + 1 +
From the inductive hypothesis, k3 + 2k is
divisible by 3, and 3(k + k + l ) is clearly
2
3 2
divisible by 3. Hence, (k + 1) + (k + l ) is
divisible by 3.
3
By the principle of induction, n + 2n is
divisible by 3 for all n E N.
Question 2{b):
Show that the sequence ( an.)nEN, where an. =
2
nn -+ 1l ' 1-5 monotone as we 11 as bounded.
Solution;
1. Monotonicity: To check if ( an) is
monotone, calculc>·-.1,, +he difference
a n+l - an:
Q3(b): Show that the series
Solution:
We will analyze the convergence of the
series term by term :
, 'C' oo I
1 . F 1rst term : L..n = I 3 .,:
o This is a geometric series with
common ratio r = ½ < 1.
o The sum of an infinite geometric
"°'oo J
L.... n= I 3" = a.
1- r'
ao 1 !1 ! 1
~n= l 3" = l · -
~
= t
~
= 2•
o Rewri·1 e 2 l using partial
n+
71
fracti ons:
/ ---1 - --
_ 1. , ) .
= 2 (!n - _1 ) .
n+ l
" " ' 1 n n2+l
L...n= -_ 2 ""'
L...n= l (!n __1 1)
n+ ·
1. Combining results:
o The sum of the series is:
'-' "' ( 1
L...n= l 3n + n{n+l
2 ) 1 2
) = 2 + =
5
2·
:"ffl the series converges, and its sum
1s w-
Q3(c): For
f( x) = 4x 3 - 3x 2 + 2x + 1, find
c E (1, 2) such that f '(c) = 20.
1. Computef'(x) :
f '(x) = 12x 2
Q3(a): Show that for every
x E ffi'. +, there exists some n EN
such that n < x + 1 < n + 1.
We are tasked to prove that for every
positive real number x, there exists a
natural number n satisfying
n < x "- l < n + l
Proof:
1· Let x E JR_-I·, and consider x -1~ 1,
which is also positive.
2. By the Archimedean property, there
exists an n E N such that
n < x + 1 < n + 1.
o n is the integer part (o r floor) of
x -c 1, denoted n = lx + 1J.
3. This n satisfies n < x + 1 by the
definition of the floor function and
x+1 <n + 1 because n -1- 1 is the
next integer afte r n.
Thus, the required n. E N exists, proving
the statement.
V
f '(x) = 12x 2 - 6x + 2.
1. Solve f '(c) = 20:
12c' - 6c +2= 20.
12c2 - 6c - 18 = 0.
2c' - C - 3 = 0.
1. Solve the quadratic equation:
- ( - 1)± ( - 1) 2- 4(2)( - 3) J± 1+ 24 1± 5
c= 22 = ~ = -,,
1 5
•c= 4 = ,' = - 1 (not in (1, 2)).
Thus, c = 1.5 satisfies f'(c) = 20 and
c E (l,2).
Q4(a): Prove or disprove: If the
limit of a sequence (a,.),.eN exists,
it is unique.
Proof:
Q4(a): Prove or disprove: If the
limit of a sequence (a,,),.EN exists,
it is unique.
Proof:
1. Assume (an) has two limits Li and
L2,withL 1 / L,.
2. By definition of the limit, for any
c >0, there exist N1, N2 E N such
that:
la,. - L, I < , for all n > N 1 ,
la,, - L, I < , for all n > N 2 .
Thus, the limit is unique.
Let me know if you need detailed steps
for Q4(b) and Q4(r\
