The answer is 25 chicks
Reasoning:
This is a simple problem.
Consider you are the only chick that matters, and construct a table to say whether YOU get pecked. Your chance of being pecked comes down to only 4 outcomes. (1) YES - pecked twice. (2) YES - pecked from left wing only. (3) YES - pecked from right wing only. (4) NO - unpecked.
The table has 4 elements, all of equal probability, 1 of which is unpecked. YOU are therefore pecked 3:1 ratio or 3:4 opportunities 75% of the time. For convenience, this needs to be conducted for 100 trials of YOU, and the answer is that 25 times YOU will NOT be pecked. The circular nature of the 100 chicks says that YOU are not unique, and your experience is the same as the others, so we extrapolate your experience of 100 trials to a single trial of 100 chicks just like YOU. 25 unpecked chicks, 50 get pecked once, 25 get double pecks.
This is the same table constructed for 100 women having two children and asking how many have no girls.
Answer:
A 6.4
Step-by-step explanation:
(4/5)/(1/8) this is the answer
Answer:
-4x -10x
See both terms contain a common multiple x
and HCF of 4 and 10 is 2
So, take -2x common
-2x( 2 +5)
= -2x(7)
=-14x
Answer:
1 - positive
2 - negative
3 - negative
4 - none
5. - positive
Step-by-step explanation:
1. A set is described either by listing all its elements between braces { } (the listing method), or by enclosing a rule within braces that determines the elements of the set (the rule method).
Example: So if P(x) is a statement about x, then S = { x | P ( x )} means “S is the set of all x such that P(x) is true.”
2. Types of set:
• Empty, or null, set {∅}.
• finite sets
• infinite set.
3. An infinite set: The set whose elements cannot be listed, i.e., set containing never-ending elements. Example: Set of all points in a plane.
4. The union of two given sets is the smallest set which contains all the elements of both the sets. To find the union of two given sets A and B is a set which consists of all the elements of A and all the elements of B such that no element is repeated. The symbol for denoting union of sets is ‘∪’.
The union of sets A and B, denoted by A ∪ B, is the set of elements formed by combining all the elements of A and all the elements of B into one set.
