Answer:
Gold, Orange, White, Blue
Step-by-step explanation:
Given:
A number when divided by 780 gives remainder 38.
To find:
The reminder that would be obtained by dividing same number by 26.
Solution:
According to Euclis' division algorithm,
...(i)
Where, q is quotient and
is the remainder.
It is given that a number when divided by 780 gives remainder 38.
Substituting
in (i), we get

So, given number is in the form of
, where q is an integer.
On dividing
by 26, we get




Since q is an integer, therefore (30q+1) is also an integer but
is not an integer. Here 26 is divisor and 12 is remainder.
Therefore, the required remainder is 12.
x =14
Answer:
Step-by-step explanation:
11. By inscribed angle theorem:
12. Again by inscribed angle theorem:
Answer:
11/381
Step-by-step explanation:
Not sure what the ? after each number means but I'm going to assume they aren't there
so we need find the number of tokens in all which is
44+1414+66=1524
P(red)=44/1524 now reduce giving P(red)=11/381