+0

# i need help

0
3
1
+2641

Given

a &\equiv 1 \pmod{7} \\

b &\equiv 2 \pmod{7} \\

c &\equiv 6 \pmod{7}

what is the remainder when a + b + c is divided by 7?

Jul 27, 2024

#1
+276
+1

use an example for a b c to solve this problem

a=1

b=2

c=6

a+b+C=1+2+6 = 9

$$9 \equiv 2 \pmod7$$
{"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0}