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:
<em>5</em><em> players participated in the tournament.</em>
Step-by-step explanation:
In a small chess tournament, 20 matches were played.
Let us assume that n number of players participated in the tournament
As in each game 2 players play, so the number of ways they can play is,
As they played 2 games with every other participant in the tournament.
So the total number of games is,
But it is given to be 20, so
As 
, so we get n=5.
Therefore, 5 players participated in the tournament.
Answer:
$210
Step-by-step explanation:
He makes 7% of that which is:
So, he makes $210 in commission.
Answer:
x/6 - 1
Step-by-step explanation:
x divide 6 subtract 1
