Mechanical Engineering > Gate 2020 Set-1 > Verbal

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

The sum of the first n terms in the sequence 8, 88, 888, 8888, … is ________.

A

80 / 81

(10ⁿ-1) -

8 / 9

n

B

81 / 80

(10ⁿ-1) -

9 / 8

n

C

81 / 80

(10ⁿ-1) +

9 / 8

n

D

80 / 81

(10ⁿ-1) +

8 / 9

n

Check Answer

Explanation

Correct : a

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?

Question #23 Medium

Which operations on a binary search tree have O(h) complexity?

Question #31 Easy

Compare search complexities of sorted array vs balanced BST.

Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science