Boolean algebra

Question

A function must satisfy the condition f(a,b,c)=f(c,a,b) . How many such functions are possible?

Comments

what is the answer?

is it 32?

Answer 1

state 1=2=4

state 3=5=6

0 & 7

2^4=16

Comments

didn't get your answer, can you elaborate more?

---

According to (a,b,c) =(c,a,b)

000 =000

111=111

001=100=010

011=101=110

8 rows will be reduced in 4 rows

Num of function= 2^num of rows =2^4=16

That's how I got this

---

got it, @Devvrat Tyagi

---

why are u comparing state (0,0,0) and (1,1,1) with itself ?

i mean than your solution wont have 10 states than with two states each having (0,0,0) and (1,1,1) state.

---

I just show that 000 and 111 will not match with any other rows...not comparing!

---

ok brother no problem :)

---

how

001=100=010 ; 1=4=2

and what is row here...

plz help