An n-digit number is a positive number with exactly n digits. At least nine hundred distinct n-digit numbers are to be formed using only the three digits 2, 5, and 7. The smallest value of n for which this is possible is: 6 7 8 9

Let $S$ be a set of positive integers such that every element $n$ of $S$ satisfies the conditions:

• $1000 \leq n \leq 1200$

• Every digit in $n$ is odd

Then, how many elements of $S$ are divisible by 3?

A. 9

B. 10

C. 11

D. 12

Write a program to find the sum of digits of an Notes integer number, input by the user.

Atomic number of element having symbol Unt is - A 101 B 102 C 103 D $104$

Show that any number of the form $4^{n}$, where $n \in \mathbb{N}$, can never end with the digit 0.

Study the following information carefully and answer the given questions:

A word and number arrangement machine when given an input line of words and numbers rearranges them following a particular rule in each step. The following is an illustration of input and rearrangement. (All the numbers are two digit numbers).

Input: tent 13 wheat 21 ask 63 steal 49 hand 54 vast 85 Step I: 85 wheat tent 13 21 ask 63 steal 49 hand 54 vast Step II: 63 vast 85 wheat tent 13 21 ask steal 49 hand 54 Step III: 54 tent 63 vast 85 wheat 13 21 ask steal 49 hand Step IV: 49 steal 54 tent 63 vast 85 wheat 13 21 ask hand Step V: 21 hand 49 steal 54 tent 63 vast 85 wheat 13 ask Step VI: 13 ask 21 hand 49 steal 54 tent 63 vast 85 wheat

And step VI is the last step of the above input, as the desired arrangement is obtained.

As per the rules followed in the above steps, find out in each of the following questions the appropriate step for the given input.

Input: store 95 clean 56 tape 15 break 28 feet 35 wait 69 ice 71

How many elements (words/numbers) are there between ‘feet’ and ‘I5’ as they appear in the second last step of the output?

Option 1: Six

Option 2: Seven

Option 3: Five

Option 4: Eight