Question

In: Math

1. compute the least non-negative residue of 4^n (mod 9) for n=1,2,3,4,5.... prove that 6*(4^n)=6 (mod...

1. compute the least non-negative residue of 4^n (mod 9) for n=1,2,3,4,5.... prove that 6*(4^n)=6 (mod 9) for every n>0.

2. find nice tests for divisibility of numbers in base 34 by each of 2,3,5,7,11,and 17.

3. in Z/15Z, find all solutions of : (i) [36]X=[78]. (ii) [42]X=[57] (iii) [25]X=[36]

4. in Z/26Z, find the inverse of [9], [11], [17], and [22]

4. write the set of solutions of x=5 mod24. x=17 (mod 18)

for all equation line, there are triple line.

Solutions

Expert Solution

Ans 1)

(a) Least Residue non negative number are

4 for n=1

7 for n=2

1 for n=3

4 for n=4..

now terms will be repeat.

(b) The powers of 4 modulo 9 are

4, 4^2 ? 16 ? 7, 4^3 ? 7 · 4 ? 28 ? 1, 4^4 ? 4, . . . i.e. 4, 7, 1, 4, 7, 1, 4, 7, 1, . . .

But 6 · 4 ? 24 ? 6 mod 9, 6 · 7 ? 42 ? 6 mod 9 and 6 · 1 ? 6 mod 9.

Therefore, 6 · 4^n ? 6 mod 9 for all n ? 1.

Ans 2)

A number in base 34 looks like this: N = a^n · 34^n + a_(n?1) · 34^(n?1 )+ · · · + a_1 · 34 + a_0 where each coefficient a_i is a number 0 ? a_i ? 33.

Therefore, in this base:

1. N is divisible by 2 if a_0 is divisible by 2.

2. N is divisible by 3 if the sum of all coefficients a_i is divisible by 3 (because 34 ? 1 mod 3).

3. N is divisible by 5 if the alternating sum of the coefficients a_i is divisible by 5 (because 34 ? ?1 mod 5).

4. N is divisible by 7 if the alternating sum of the coefficients a_i is divisible by 7 (because 34 ? ?1 mod 7).

5. N is divisible by 11 if the sum of all coefficients a_i is divisible by 11 (because 34 ? 1 mod 11).

6. N is divisible by 17 if a_0 is 0 or 17 (because N ? a_0 mod 17 and 0 ? a_0 ? 33, so a_0 ? 0 mod 17 iff a_0 = 0 or 17).


Related Solutions

Prove that 3^n + 7^(n−1) ≡ 4 (mod 12) for all n ∈ N+.
Prove that 3^n + 7^(n−1) ≡ 4 (mod 12) for all n ∈ N+.
prove or disprove .if n is a non negative integer, then 5 divides 2 ⋅ 4^n...
prove or disprove .if n is a non negative integer, then 5 divides 2 ⋅ 4^n + 3⋅9^n.
Prove that for every n ∈ N: a) (10^n + 3 * 4^(n+2)) ≡ 4 mod...
Prove that for every n ∈ N: a) (10^n + 3 * 4^(n+2)) ≡ 4 mod 19, [note that 4^3 ≡ 1 mod 9] b) 24 | (2*7^(n) + 3*5^(n) - 5), c) 14 | (3^(4n+2) + 5^(2n+1) [Note that 3^(4n+2) + 5^(2n+1) = 9^(2n)*9 + 5^(2n)*5 ≡ (-5)^(2n) * 9 + 5^(2n) *5 ≡ 0 mod 14]
Use a direct proof to prove that 6 divides (n^3)-n whenever n is a non-negative integer.
Use a direct proof to prove that 6 divides (n^3)-n whenever n is a non-negative integer.
Prove: If a1 = b1 mod n and a2 = b2 mod n then (1) a1...
Prove: If a1 = b1 mod n and a2 = b2 mod n then (1) a1 + a2 = b1 + b2 mod n, (2) a1 − a2 = b1 − b2 mod n, and (3) a1a2 = b1b2 mod n.
Prove the following by induction: 2 + 4 + 6 + …+ 2n = n(n+1) for...
Prove the following by induction: 2 + 4 + 6 + …+ 2n = n(n+1) for all integers n Show all work
Prove the following theorem. If n is a positive integer such that n ≡ 2 (mod...
Prove the following theorem. If n is a positive integer such that n ≡ 2 (mod 4) or n ≡ 3 (mod 4), then n is not a perfect square.
Part A: Compute the derivative of ?(?)=(4?^4 + 2?)(?+9)(?−6) Part B: Compute the derivative of ?(?)=...
Part A: Compute the derivative of ?(?)=(4?^4 + 2?)(?+9)(?−6) Part B: Compute the derivative of ?(?)= (9x^2 + 8x +8)(4x^4 + (6/x^2))/x^3 + 8 Part C: Compute the derivative of ?(?)=(15?+3)(17?+13)/(6?+8)(3?+11).
Compute the following: (a) 13^2018 (mod 12) (b) 8^11111 (mod 9) (c) 7^256 (mod 11) (d)...
Compute the following: (a) 13^2018 (mod 12) (b) 8^11111 (mod 9) (c) 7^256 (mod 11) (d) 3^160 (mod 23)
prove that for x is an odd, positive integer, 3x ≡−1 (mod 4). I'm not sure...
prove that for x is an odd, positive integer, 3x ≡−1 (mod 4). I'm not sure how to approach the problem. I thought to assume that x=2a+1 and then show that 3^x +1 is divisible by 4 and thus congruent to 3x=-1(mod4) but I'm stuck.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT