SOLUTION: For each positive integer n, the set of integers (0,1...,n-1) is known as the residue system modulo n. Within the residue system modulo 2^4, let A be the sum of all invertible inte

Question 1171543: For each positive integer n, the set of integers (0,1...,n-1) is known as the residue system modulo n. Within the residue system modulo 2^4, let A be the sum of all invertible integers modulo 2^4 and let B be the sum all of non-invertible integers modulo 2^4. What is A-B?
Please help me. I have tried multiple ways but have found nothing. Thank you
Answer by ikleyn(52754) (Show Source): You can put this solution on YOUR website!
.


By modulo 2^4 = 16, invertible are those and only those that are mutually prime with 2.


They are  1, 3, 5, 7, 9, 11, 13, 15 (all odd numbers from 1 to 15, inclusive).


The rest, 0, 2, 4, 6, 8, 10, 12, 14 are not invertible.


So they want you calculate the difference 


    (1+3+5+7+9+11+13+15) - (0+2+4+6+8+10+12+14).


Regrouping, you see that this difference is 8*1 = 8.    ANSWER

Solved.

RELATED QUESTIONS
2. Find the residue of 103^45 modulo... (answered by swincher4391)

Show that any positive integer N = 7 modulo 8 can never be expressed as the sum of the... (answered by Sphinx pinastri)

For any positive integer n, ((n+1)!/n!)-n = The answer is 1 Please... (answered by rothauserc)

Let $x$ and $y$ be integers. If $x$ and $y$ satisfy $41x + 5y = 31$, then find the... (answered by ikleyn)

For positive integer values of N, let N be defined as: N = 2 + 4 + 6 + ... + N, if N (answered by Edwin McCravy)

Show that any integer N = 7 modulo 8 cannot be expressed as the sum of the squares of... (answered by Sphinx pinastri)

How can I prove that for each positive integer n, the sum of the first n odd positive... (answered by tommyt3rd)

Show that there is only one set of different positive integers, x,y,z that 1=... (answered by Edwin McCravy)

Let $m$ and $n$ be non-negative integers. If $m = 6n + 2$, then what integer between $0$ (answered by ikleyn,math_tutor2020)