   Chapter 9.3, Problem 15ES ### Discrete Mathematics With Applicat...

5th Edition
EPP + 1 other
ISBN: 9781337694193

#### Solutions

Chapter
Section ### Discrete Mathematics With Applicat...

5th Edition
EPP + 1 other
ISBN: 9781337694193
Textbook Problem
1 views

# Identifiers in a certain database language must begin with a letter, and then [he letter may be followed by other characters, which can be letters, digits, or underscores (_). However, 82 keywords lull consisting of 15 or fewer characters) are reserved and con not be used as identifiers. How many identifiers with 30 or fewer characters are possible? (Write the answer using summation notation and evaluate it using a formula from Section 3.2.)

To determine

The number of identifiers with 30 or fewer characters andwrite the answer using summation notation and evaluate it using the formula.

Explanation

Given information:

In a certain database first character must be alphabet then followed by other characters which can be digits, letters or underscores (_). There are total 30 characters and 82 keywords are reserved.

Calculation:

The following will be the summation notation for the above statement-

The summation from k=m to n of ak will be the sum of all terms am,am+1,am+2......,an, so the compact as well as the summation form can be written as follows-

k=mnak=am+a m+1+a m+2+.......+an{where k=index of the summation,m=lower limit and n=upper limit,m<n}

Now let us try to form the summation formula of the problem

### Still sussing out bartleby?

Check out a sample textbook solution.

See a sample solution

#### The Solution to Your Study Problems

Bartleby provides explanations to thousands of textbook problems written by our experts, many with advanced degrees!

Get Started 