Question

Let n = 391 = 17x23 (which is not a prime number) a. Using Maple to...

Let n = 391 = 17x23 (which is not a prime number)

a. Using Maple to show that 2n-1 is not congruent to 1 (mod n).   

b. Use Maple Find a non-zero exponent j such that 2j ≡1 (mod n).

Homework Answers

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
In number theory, Wilson’s theorem states that a natural number n > 1 is prime if...
In number theory, Wilson’s theorem states that a natural number n > 1 is prime if and only if (n − 1)! ≡ −1 (mod n). (a) Check that 5 is a prime number using Wilson’s theorem. (b) Let n and m be natural numbers such that m divides n. Prove the following statement “For any integer a, if a ≡ −1 (mod n), then a ≡ −1 (mod m).” You may need this fact in doing (c). (c) The...
Let p be prime. Show that the equation x^2 is congruent to 1(mod p) has just...
Let p be prime. Show that the equation x^2 is congruent to 1(mod p) has just two solutions in Zp (the set of integers). We cannot use groups.
Definition: Let p be a prime and 0 < n then the p-exponent of n, denoted...
Definition: Let p be a prime and 0 < n then the p-exponent of n, denoted ε(n, p) is the largest number k such that pk | n. Note: for p does not divide n we have ε(n,p) = 0 Notation: Let n ∈ N+ we denote the set {p : p is prime and p | n} by Pr(n). Observe that Pr(n) ⊆ {2, 3, . . . n} so that Pr(n) is finite. Problem: Let a, b be...
1. Let p be any prime number. Let r be any integer such that 0 <...
1. Let p be any prime number. Let r be any integer such that 0 < r < p−1. Show that there exists a number q such that rq = 1(mod p) 2. Let p1 and p2 be two distinct prime numbers. Let r1 and r2 be such that 0 < r1 < p1 and 0 < r2 < p2. Show that there exists a number x such that x = r1(mod p1)andx = r2(mod p2). 8. Suppose we roll...
Let p = 26981 and q = 62549 and let n = pq. Find all four...
Let p = 26981 and q = 62549 and let n = pq. Find all four values of a ∈ Z*n such that a2≡1(mod n). [a in Z*n such that a2 is congruent to 1 (mod n)] (Hint: use the Chinese remainder theorem.)
(7) Which of the following statement is TRUE? (A) If am−1 ≡ 1 (mod m), then...
(7) Which of the following statement is TRUE? (A) If am−1 ≡ 1 (mod m), then by Fermat’s Little Theorem m must be a prime. (B) If ac ≡ bc (mod m), then a ≡ b (mod m). (C) If a ≡ b (mod m) and n | m, then a ≡ b (mod n). (D) If 2n −1 is a prime, then 2n−2(2n −1) is a perfect number. (E) If p is a prime, then 2p −1 is also...
Euler's Totient Function Let f(n) denote Euler's totient function; thus, for a positive integer n, f(n)...
Euler's Totient Function Let f(n) denote Euler's totient function; thus, for a positive integer n, f(n) is the number of integers less than n which are coprime to n. For a prime p its is known that f(p^k) = p^k-p^{k-1}. For example f(27) = f(3^3) = 3^3 - 3^2 = (3^2) 2=18. In addition, it is known that f(n) is multiplicative in the sense that f(ab) = f(a)f(b) whenever a and b are coprime. Lastly, one has the celebrated generalization...
Let n be a positive integer and let S be a subset of n+1 elements of...
Let n be a positive integer and let S be a subset of n+1 elements of the set {1,2,3,...,2n}.Show that (a) There exist two elements of S that are relatively prime, and (b) There exist two elements of S, one of which divides the other.
In this question we show that we can use φ(n)/2. Let n = pq. Let x...
In this question we show that we can use φ(n)/2. Let n = pq. Let x be a number so that gcd(x, n) = 1. Show that x φ(n)/2 = 1 mod p and x φ(n)/2 = 1 mod q, Show that this implies that and x φ(n)/2 = 1 mod n
Let p be a prime and let a be a primitive root modulo p. Show that...
Let p be a prime and let a be a primitive root modulo p. Show that if gcd (k, p-1) = 1, then b≡ak (mod p) is also a primitive root modulo p.
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT