Question

22. Suppose that (ab, p)- 1 and that p> 2. Show that the number of solutions (x, y) of the congruence ax2 + by 1 (mod p) is -
0 0
Add a comment Improve this question Transcribed image text
Answer #1

Now we legendu stwokof teo tend Solut.cn ef ⓚ by C-1) p-1 Hp

Add a comment
Know the answer?
Add Answer to:
22. Suppose that (ab, p)- 1 and that p> 2. Show that the number of solutions (x, y) of the congru...
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. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT