Let p be a prime. What is the remainder of (p−1)!, when divided by p? In other words: find a simple formula for (p−1)!∈Z_p (find a simple formula for the integer in {0,1,...,p−1} that is equivalent to (p−1)! modulo p). Do the computation out for small examples p=2,3,5,7, and try and spot a pattern. It might help to observe that for for p prime and for all a∈{0,1,...,p}, there is a unique x∈{0,1,...,p−1} so that ax≡1modp (though you will need to prove this fact).

Q: u will prove that 7*+1 - 1 is divisible by 6. ypothesis, since 6 evenly divides , there exists an…

A: We will fill in the blanks.

Q: Find all primes that are the difference of the fourth powers of two integers.

A: Let the two integers are x and y and n is prime so we have  n=(x4-y4)       (suppose x>y)…

Q: Calculate C(12,5) by hand. As C(n,r) = n!/(n-r)!r! identify n and r, and write out every number in…

A:

Q: Find a formula for 1/2+1/4+1/8+.+ 1/2h by examining the values of this expression for small values…

A:

Q: Find the least residue of  -5 -46 modulo 14.

A:

Q: Let n be a number with 3 digits. (i.e 100sns 999) Show that if the sum of digits of n is divisible…

A:

Q: Show that if p = q + 4a (p and q are odd primes), then (p/q) = (a/q).

A:

Q: Show that if k is a positive integer, then (15k+4)/(10k+3) is in lowest terms.

A: We use the concept of Ring theory that a fraction is in lowest form if the gcd of numerator and…

Q: Let Find formulas for the entries of M", where n is a positive integer. Hint: a formula such as 5…

A: Given that the matrixM=16-147-5

Q: S²₁ Sinmxsinhxbx = 2 x if m=n So min

A: To prove:- ∫-ππsinmxsinnxdx=0if m≠nπif m=n

Q: If n is a positive integer, is there always a prime between n and 2n?

A: given that n is a positive integer. we have to show that there is always a prime number between n…

Q: Suppose that a and b are integers, c b = 3 (mod 19). Find the integer c that a) с%3D 13а (mod 19).…

A:

Q: For each positive integer n, define an = ((2+√3)" + (2-√3)") 2 It is known that an is a positive…

A:

Q: Use the PMI to prove that 6" – 1 is divisible by 5 for every integer n > 0.

A: To prove that 6^n-1 is divisible by 5 for every integer greater that or equals to 0.

Q: Let m = p^3 qr^3 and n = p^2 r^5, where p,q,r are distinct primes. Find each of the following. a.…

A:

Q: Suppose p and q are distinct primes such that ordp a = h and ordq a = k Prove that ordpq a= lcm(h,…

A: Here we use basic group theory.

Q: Consider the list of numbers: 2n-1, where n first equals 2, then 3, 4, 5,6,…What is the smallest…

A: Given that, A numver is, 2n - 1 Where n = 2, 3, 4, 5, 6, 7, ............ We have to find the…

Q: Show that if a and b are relatively prime then (a+2b,2a+b)=1 or 3.

A:

Q: Fermat's Little Theorem tells us that if p is prime and a is an integer not divisible by p, then…

A: