How Many Permutations for Pressing 4 Out of 8 Switches?

novolts
Messages
2
Reaction score
0
Good evening to all
I wonder if anyone can help please I have 8 switches b1,b2,b3,b4,b5,b6,b7,b8 I am trying to work out how many permutations I would have if I pressed any 4 of the 8 switches ie if I pressed b1,b3,b,7,b8 to make a circuit or it could be b3,b5,b6,b7 doing it by long hand I reckon it is 40 combination.
I fully understand if no one wishes to answer the question but I am completely useless at maths
Thank you to all
 
Physics news on Phys.org
8!/(4!4!)=70
 
Thankyou Robert will have to get paper and pencil out again
 

Thread 'Trouble understanding an online solution to an exercise in Dummit & Foote'

##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
View full post »

Thread 'Questions about non existence of GCDs vs (coimages, cokernels)'

The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
View full post »

Thread 'Decomposition into irreps of compact Lie group'

When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
View full post »

Similar threads

How to compute the rotation matrix
Replies
6
Views
4K
Question about the efficiency of using an array or individual variables
5
Replies
235
Views
13K
Help with VHDL to transition state diagram
Replies
7
Views
2K
Advanced (Or simple?) balls in a jar probability
Replies
17
Views
2K
Algorithm for creating unique groups of elements
Replies
1
Views
2K
Creating mathematical model from table of permutations?
Replies
9
Views
3K
Eigenvectors of Fourier transform operator #F:L^2\to L^2#
Replies
1
Views
2K
Very tricky line of people problem
Replies
8
Views
1K
Solve an Algebraic Equation: A+B=C
Replies
2
Views
2K
How can I reroute multiple signals from a 4 pin connector using a relay switch?
Replies
37
Views
6K

Hot Threads

Recent Insights

Back
Top