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.
sara is unlikely to score a point on her next turn
Answer:
2/3 cup
Step-by-step explanation:
first you need to convert the fractions so that they have the same denominator (1/3 turns into 2/6)
then you just add up the numerators (2+2=4..... 4/6)
you can stop there or you can simplify it (4/6 turns into 2/3)
Answer:
50
Step-by-step explanation:
If the first statement its true (At most 0 of the statements are true), there are not true statements in the paper. So, the first statement its false.
Now, if the first statement its false, this mean there must be at least 1 true statement in the paper.
Now, if the second statement its true ( at most 1 of the statements are true) this implies that the third statement its true (if "at most 1" its true, then "as most 2" must be true).
If any statement (besides the first) its true, then all the statement that follows it must be true.
The first non false statement, then, must be the statement made by the person 51: "At most 50 statements are true"
And the 49 statements that follows are true as well.
The answer is x2 + 2xy + y2.
