Home
Class 11
MATHS
Write the set A = {a(n):n inN,a(n+2)=3a(...

Write the set `A = {a_(n):n inN,a_(n+2)=3a_(n),a_(1)=1}` in tabular form.

Text Solution

Verified by Experts

The correct Answer is:
`A={1,3,9,27,….}`
Promotional Banner

Topper's Solved these Questions

  • SETS

    NAGEEN PRAKASHAN|Exercise Exercise 1B|10 Videos

  • SETS

    NAGEEN PRAKASHAN|Exercise Exercise 1C|16 Videos

  • SETS

    NAGEEN PRAKASHAN|Exercise MISC Exercise|16 Videos

  • SEQUENCE AND SERIES

    NAGEEN PRAKASHAN|Exercise Miscellaneous Exercise|32 Videos

  • STATISTICS

    NAGEEN PRAKASHAN|Exercise MISCELLANEOUS EXERCISE|7 Videos

Similar Questions

Explore conceptually related problems

B={a_(n):n in N,a_(n)+1=2a_(n) and a_(1)=3}

Write the set B={a_(n):n in N,a_(n+2)=a_(n+1)+a_(n)anda_(1)=a_(2)=1} in tabular form.

Write the following sets in roster form: (i)A={a_(n):n varepsilon N,a_(n)+1=3a_(n),a_(1)=2

If one quarter of all three element subsete of the set A={a_(1),a_(2),a_(3),......,a_(n)} contains the element a_(3) , then n=

The number of all the four element subsets of the set {a_(1),a_(2),a_(3),......,a_(n)} aan which contain a_(3) but do not contain a_(n-3),(n>=6) is

Some sequences are defined as follows. Find their first four terms : (i) a_(1)=a_(2)=2, a_(n)=a_(n-1)-1, n gt 2 " " (ii) a_(1)=3, a_(n)=3a_(n-1), n gt 1

Number of increasing permutations of m symbols are there from the n set numbers {a_(1),a_(2),...,a_(n),} where the order among the numbers is given by a_(1)

Let the sequence a_(1),a_(2),a_(3),...,a_(n) from an A.P.Then the value of a_(1)^(2)-a_(2)^(2)+a_(3)^(2)-...+a_(2n-1)^(2)-a_(2n)^(2) is (2n)/(n-1)(a_(2n)^(2)-a_(1)^(2))(b)(n)/(2n-1)(a_(1)^(2)-a_(2n)^(2))(n)/(n+1)(a_(1)^(2)-a_(2n)^(2))(d)(n)/(n-1)(a_(1)^(2)+a_(2n)^(2))

If quad 1,a_(1)=3 and a_(n)^(2)-a_(n-1)*a_(n+1)=(-1)^(n) Find a_(3).