Ok, so first convert both the numbers to improper fractions. (Multiply the denominator of the fraction by the whole number and add the numerator of the fraction)
Then keep the first number the same, change the division symbol to a multiplication symbol and use the reciprocal of the second number. (flip the numbers so that the denominator becomes the numerator and the numerator becomes the denominator.)
Then simply multiply across.
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.
Answer:

Step-by-step explanation:
The total length of this line is 15 units. FG is 6 units long.
This means that the probability of p being on FG would be
which can be simplified to 