[
Skip Navigation]
≡
-
🏠
CS 255 Spring 2015
:
Talk
:
03. Prove the equation ax≡b(modn) either has d distinct solutions modulo n, where d=gcd(a,n), or it has no solutions.
≡
Welcome
Signin
Create Account
CS 255 Spring 2015 Group
03. Prove the equation ax≡b(modn) either has d distinct solutions modulo n, where d=gcd(a,n), or it has no solutions. Thread
Group Feed
Group Wiki
Group Places
Discussions
My Groups
2015-05-13
nayana
✓
nayana
Public Posts
03. Prove the equation ax≡b(modn) either has d distinct solutions modulo n, where d=gcd(a,n), or it has no solutions.
.
Team: Nayana DV, Sushma Satyanarayan, Tina philips
(
Edited: 2015-05-13
)
((resource:IMG_20150513_155311.jpg|Resource Description for IMG_20150513_155311.jpg)) Team: Nayana DV, Sushma Satyanarayan, Tina philips
X
(c) 2024 Yioop -
PHP Search Engine
We use cookies to implement this site's user functionality, social media features, and traffic analytics.
Privacy Policy Details
.
Allow Cookies