Tossing a coin is a binomial experiment.
Now lets say there are 'n' repeated trials to get heads. Each of the trials can result in either a head or a tail.
All of these trials are independent since the result of one trial does not affect the result of the next trial.
Now, for 'n' repeated trials the total number of successes is given by
where 'r' denotes the number of successful results.
In our case 
and 
,
Substituting the values we get,
Therefore, there are 1352078 ways to get heads if a person tosses a coin 23 times.
5x/7 - 5 = 50 is 4. x = 77
It isn’t because when there is no addition in the equation the y intercept is 0
The 4th factor would be 3. You would find this out through a factor tree. If you don't know the original number when you start you look at your numbers. A factor of 1 usually goes with the highest number, assuming that the number 6 is the highest factor, that would be the original number. As 2 is the other known factor than we know that 3 has to be the last factor, because 2 x 3 = 6. It cannot be the number 12 because then there would be 6 factors not the needed 4.
