edited by
356 views

1 Answer

Best answer
2 votes
2 votes
The most simple solution that I can think of is as follows:

Total strings possible = 128^5

strings without @ = 127^5

strings with @ character at least one = 128^5 - 127^5 = 1,321,368,961.

this gives the answer
edited by

Related questions

2 votes
2 votes
1 answer
2
anumita asked May 17, 2017
392 views
How many partial functions are there from a set with m elements to a set with n elements, where m and n are positive integers.Answer : (n+1)^mHow . Can anyone please help...
2 votes
2 votes
1 answer
3
anumita asked May 17, 2017
882 views
A palindrome is a string whose reversal is identical to the string. how many bit strings of length n are palindromes ?