The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
+1 vote

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$.
in Set Theory & Algebra by Boss (41.7k points) | 24 views

1 Answer

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}$.

by Active (2.2k points)

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,376 questions
55,839 answers
91,392 users