Write a program that counts the number of lowercase letters, uppercase letters,

Question

Write a program that counts the number of lowercase letters, uppercase letters, num-bers, and other characters (punctuation, symbols, etc.) in a text file obtained by past-ing the story below in a text file. Use a switch, if-else, or combination of control structures (food for thought).


Output will be something like
Number of

lowercase letters is
789
uppercase letters is
49
digits is
28
other characters is
62

Duplicate this format as well.



A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself. A natural num-ber greater than 1 that is not a prime number is called a composite number. For example 5 is prime, as only 1 and 5 divide it, whereas 6 is composite, since it has the divisors 2 and 3 in addition to 1 and 6. The fundamental theorem of arithmetic establishes the central role of primes in number theory: any integer greater than 1 can be expressed as a product of primes that is unique up to ordering. This theorem requires excluding 1 as a prime.
The property of being prime is called primality. A simple but slow method of verifying the primality of a given number n is known as trial division. It consists of testing whether n is a multiple of any integer between 2 and vn. Algorithms that are much more effi-cient than trial division have been devised to test the primality of large numbers. Particularly fast methods are available for primes of special forms, such as Mersenne primes. As of 2011[update], the largest known prime number has nearly 13 million decimal dig-its.
There are infinitely many primes, as demonstrated by Euclid around 300 BC. There is no known useful formula that yields all of the prime numbers and no composites. However, the distribution of primes, that is to say, the statistical behavior of primes in the large, can be modeled. The first result in that direction is the prime number theorem, proven at the end of the 19th century, which says that the probability that a given, randomly chosen number n is prime is inversely proportional to its number of digits, or the logarithm of n.

Explanation / Answer

/* Take input into a string and count the number of capital letters, small letters, digits and special symbols in it. */ #include int main(void) { char str[80]; int x, cap, small, dig, sym; printf(" Enter a string : "); gets(str); x = cap = small = dig = sym = 0; for( ; str[x] != '' ; x++) { if(str[x] >= 'A' && str[x] = 'a' && str[x] = '0' && str[x]

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.