480 views
1 votes
1 votes

An $n-$variable Boolean function $f:\{0,1\}^n \rightarrow \{0,1\} $ is called symmetric if its value depends only on the number of $1’s$ in the input. Let $\sigma_n $ denote the number of such functions.

  1. Calculate the value of $\sigma_4$.
  2. Derive an expression for $\sigma_n$ in terms of $n$.

1 Answer

0 votes
0 votes
Since, the value of the function is dependent only on the number of 1's in the n-bit string .
The possible number of ones are : 0,1,2......,n. There are n+1 possibilities.
Now map each of these possibilities of number of ones to 0 or 1.

Therefore no. of such functions = $2^{n+1}$.

$\sigma_4$=$2^{4+1}$=32

Related questions

1 votes
1 votes
3 answers
1
1 votes
1 votes
2 answers
3
akash.dinkar12 asked May 12, 2019
1,276 views
Consider a $5$-stage instruction pipeline. The stages and the corresponding stage delays are given below.$$\begin{array}{|l|l|}\hline \textbf{Instruction}&\textbf{Stage d...