Skip to content

GCD code added #371

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 2 commits into from
Oct 2, 2018
Merged
Changes from 1 commit
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Next Next commit
Added GCD code
  • Loading branch information
JoaoMLima committed Oct 1, 2018
commit f7ba73100658cfc57bf09a02e313d8cec88f283e
12 changes: 12 additions & 0 deletions Maths/gcd.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,12 @@
def gcd(a, b):
if a == 0 :
return b

return gcd(b%a, a)

def main():
print(modularExponential(3, 200, 13))


if __name__ == '__main__':
main()