Dual Function

PYLE PRO PDWM94 DUAL FUNCTION WIRELESS MICROPHONE SYSTEM
PYLE PRO PDWM94 DUAL FUNCTION WIRELESS MICROPHONE SYSTEM
Paypal   US $29.99
PYLE DUAL FUNCTION WIRELESS WIRED MICROPHONE SYSTEM
PYLE DUAL FUNCTION WIRELESS WIRED MICROPHONE SYSTEM
Paypal   US $24.99
Pyle PDWM94 Dual Function Wireless Or Wired Microphone System
Pyle PDWM94 Dual Function Wireless Or Wired Microphone System
Paypal   US $32.99
PYLE Dual Function Wireless Wired Mic System PDWM100
PYLE Dual Function Wireless Wired Mic System PDWM100
Paypal   US $36.00
New Pyle PDWM100 Dual Function Wireless Wired Microphone System
New Pyle PDWM100 Dual Function Wireless Wired Microphone System
Paypal   US $31.49
Pyle PDWM100 Dual Function Wireless Wired Microphone System
Pyle PDWM100 Dual Function Wireless Wired Microphone System
Paypal   US $28.49
Pyle PDWM94 Dual Function Wireless or Wired Microphone System
Pyle PDWM94 Dual Function Wireless or Wired Microphone System
Paypal   US $26.49
Plye Pro Dual Function Wireless Wired Microphone System PDWM94
Plye Pro Dual Function Wireless Wired Microphone System PDWM94
Paypal   US $10.00
Dual Function Wireless Wired Microphone System w Cable
Dual Function Wireless Wired Microphone System w Cable
Paypal   US $24.86
Pyle PDWM94 Dual Function Wireless Or Wired Microphone System
Pyle PDWM94 Dual Function Wireless Or Wired Microphone System
Paypal   US $32.99

Gerber DMF - Dual Multi Function

A switching function of n variables assigns to each n-digit binary sequence a value of 0 or 1...?

A switching function of n variables assigns to each n-digit binary sequence a value of 0 or 1. A switching function is called self-dual if the assigned value of a sequence S is unchanged when the 0 digits of S are changed to 1 and vice versa. How many self-dual switching functions of n variables are there?

I'm afraid we'll have to assume "assigned value" means "total sum of the digits" or something.

Otherwise your explanation is too vague to figure out.

If v(S) = v(S' ), where S' denotes the dual of S, then you have:

v(S) = sum(S) = # of 1s in S

v(S' ) = sum(S' ) = # of 1s in S' = # of 0s in S

Thus S is self-dual if it has the same number of 0s as 1s.

For n odd, this is impossible. For n = 2k, the answer is (2k choose k). Refer to the other question of yours that I answered for why/how "choose" is defined and relevant to this question.