Question

In: Math

If the pth term of an AP is q and the qth term is p, prove that its nth term is (p + q - n).

Expert Solution

• pth term = q

• q th term = p

a +(p – 1) d = q______(1)

a +(q – 1) d = p______(2)

Subtracting equation (2) – (1), we get

a +(q – 1) d – [a +(p – 1) d] = p – q

a + dq – d – a – pd – + d = p – q

dq – dp = p – q

d(q – p) = -(q – p)

d = -1

Putting d= -1 in equation (1)

a +(p – 1) d = q

a + (p – 1)(-1) = q

a – p + 1 = q

a = p + q – 1

Thus,

nth term = a + (n – 1)d

nth term = (p + q – 1) + (n – 1) × (-1)

nth term = (p + q – n)

Nikhil Thakur answered 2 years ago

If the pth term of an arithmetic progression is 1/q and the qth term is 1/p , prove that the sum of the first pq terms must be 1/2 (pq+1).

If the pth term of an arithmetic progression is \( \frac{1}{q} \) and the qth term is \( \frac{1}{p} \) , prove that the sum of the first pq terms must be \( \frac{1}{2}(pq+1) \).

Prove that n, nth roots of unity form a group under multiplication.

Show that if P;Q are projections such that R(P) = R(Q) and N(P) = N(Q), then...

Show that if P;Q are projections such that R(P) = R(Q) and N(P) = N(Q), then P = Q.

Prove that (((p v ~q) ⊕ p) v ~p) ⊕ (p v ~q) ⊕ (p ⊕...

Prove that (((p v ~q) ⊕ p) v ~p) ⊕ (p v ~q) ⊕ (p ⊕ q) is equivalent to p ^ q. Please show your work and name all the logical equivalence laws for each step. ( v = or, ~ = not, ⊕ = XOR) Thank you

give a constructive proof of fn = Q^n + P^n/ Q - P , where Q...

give a constructive proof of fn = Q^n + P^n/ Q - P , where Q is the positive root and P is negative root of x^2 - x - 1= 0 fn is nth term of fibonacci sequence, f1 = 1 f2, f3 = f2 +f1, ... fn= fn_1 +fn_2 , n>2

Prove p → (q ∨ r), q → s, r → s ⊢ p → s

prove or disprove using logical equivalences (a) p ∧ (q → r) ⇐⇒ (p → q)...

prove or disprove using logical equivalences (a) p ∧ (q → r) ⇐⇒ (p → q) → r (b) x ∧ (¬y ↔ z) ⇐⇒ ((x → y) ∨ ¬z) → (x ∧ ¬(y → z)) (c) (x ∨ y ∨ ¬z) ∧ (¬x ∨ y ∨ z) ⇐⇒ ¬y → (x ↔ z)

Prove that for all integers n ≥ 2, the number p(n) − p(n − 1) is...

Prove that for all integers n ≥ 2, the number p(n) − p(n − 1) is equal to the number of partitions of n in which the two largest parts are equal.

Prove or disprove using a Truth Table( De Morgan's Law) ¬(p∧q) ≡ ¬p∨¬q

Prove or disprove using a Truth Table( De Morgan's Law) ¬(p∧q) ≡ ¬p∨¬q Show the Truth Table for (p∨r) (r→¬q)

what is AP, CAP, CP E MCQ, ME P and Q means on the study of...

what is AP, CAP, CP E MCQ, ME P and Q means on the study of Financial Accounting by Livy, Livy