Since 15 is congruent to 1 modulo 7, 15^2010 is congruent to 1^2010 = 1 modulo 7 and 16 is congruent to 2 modulo 7, 16^2011 is congruent to 2^2011 modulo 7. Imagine that 2^3 is congruent to 1 modulo 7, then 2^2010 is congruent to 1^2010 = 1 modulo 7 and hence, 2^2011 is congruent to 2 modulo 7. Adding the remainders (since positive congruence), 15^2010 + 16^2011 is congruent to 1 + 2 = 3.

Looks like you have a modular arithmetic problem there - have a look at the 2 technique trainer articles Modular Arithmetic and Euler's Theorem first, and see how you go.

Easy Math Editor

`*italics*`

or`_italics_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.`2 \times 3`

`2^{34}`

`a_{i-1}`

`\frac{2}{3}`

`\sqrt{2}`

`\sum_{i=1}^3`

`\sin \theta`

`\boxed{123}`

## Comments

Sort by:

TopNewestSince 15 is congruent to 1 modulo 7, 15^2010 is congruent to 1^2010 = 1 modulo 7 and 16 is congruent to 2 modulo 7, 16^2011 is congruent to 2^2011 modulo 7. Imagine that 2^3 is congruent to 1 modulo 7, then 2^2010 is congruent to 1^2010 = 1 modulo 7 and hence, 2^2011 is congruent to 2 modulo 7. Adding the remainders (since positive congruence), 15^2010 + 16^2011 is congruent to 1 + 2 = 3.

Answer: 3 is the remainder.

Log in to reply

Do it by modulo function.

Log in to reply

Looks like you have a modular arithmetic problem there - have a look at the 2 technique trainer articles Modular Arithmetic and Euler's Theorem first, and see how you go.

Log in to reply

4

Log in to reply