Question

a) Prove: If n is the square of some integer, then n /≡ 3 (mod 4)....

a) Prove: If n is the square of some integer, then n /≡ 3 (mod 4). (/≡ means not congruent to)

b) Prove: No integer in the sequence 11, 111, 1111, 11111, 111111, . . . is the square of an integer.

Math   Advanced-Math   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

0 0
Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Without using induction, prove that for x is an odd, positive integer, 3x ≡−1 (mod 4)....
Without using induction, 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.
Prove that for any integer a, a^37 is congruent to a (mod 1729). We have Fermat's...
Prove that for any integer a, a^37 is congruent to a (mod 1729). We have Fermat's Little Theorem and Euler's Theorem to work with.
Let n be an integer. Prove that if n is a perfect square (see below for...
Let n be an integer. Prove that if n is a perfect square (see below for the definition) then n + 2 is not a perfect square. (Use contradiction) Definition : An integer n is a perfect square if there is an integer b such that a = b 2 . Example of perfect squares are : 1 = (1)2 , 4 = 22 , 9 = 32 , 16, · · Use Contradiction proof method
Let p be a prime that is congruent to 3 mod 4. Prove that there is...
Let p be a prime that is congruent to 3 mod 4. Prove that there is no solution to the congruence x2≡−1 modp. (Hint: what would be the order of x?)
Prove: If n ≡ 3 (mod 8) and n = a2 + b2 + c2 +...
Prove: If n ≡ 3 (mod 8) and n = a2 + b2 + c2 + d2, then exactly one of a, b, c, d is even. (Hint: What can each square be modulo 8?)
Prove let n be an integer. Then the following are equivalent. 1. n is an even...
Prove let n be an integer. Then the following are equivalent. 1. n is an even integer. 2.n=2a+2 for some integer a 3.n=2b-2 for some integer b 4.n=2c+144 for some integer c 5. n=2d+10 for some integer d
If n is a square-free integer, prove that an abelian group of order n is cyclic.
If n is a square-free integer, prove that an abelian group of order n is cyclic.
Prove that every integer of the form 5n + 3 for n ∈ Z, n ≥...
Prove that every integer of the form 5n + 3 for n ∈ Z, n ≥ 1, cannot be a perfect square
Prove that a positive integer n, n > 1, is a perfect square if and only...
Prove that a positive integer n, n > 1, is a perfect square if and only if when we write n = P1e1P2e2... Prer with each Pi prime and p1 < ... < pr, every exponent ei is even. (Hint: use the Fundamental Theorem of Arithmetic!)
Prove: If n≡3 (mod 8) and n=a^2+b^2+c^2+d^2, then exactly one of a, b, c, d is...
Prove: If n≡3 (mod 8) and n=a^2+b^2+c^2+d^2, then exactly one of a, b, c, d is even. (Hint: What can each square be modulo 8?)
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT