-
Notifications
You must be signed in to change notification settings - Fork 4.6k
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
Add find primitive root #608
Conversation
To find primitive root, Euler's totient function is used. |
0 is the only primitive root of 1 """ | ||
else: | ||
phi = euler_totient(n) | ||
pRootList = [] |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
please use consistent naming convention
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
[Edit] Change pRootList into p_root_list
PULL_REQUEST_TEMPLATE.md
Outdated
- [X] **If creating a new file :** | ||
- [X] added links to it in the README files ? | ||
- [X] included tests with it ? | ||
- [X] added description (overview of algorithm, time and space complexity, and possible edge case) in docstrings ? |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
no need to edit the template
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
[Edit] Revert PULL_REQUEST_TEMPLATE.md
…solving collision
…find_primitive_root
(Put an
X
inside the[ ]
to denote check mark[X]
.)If creating a new file :
if done some changes :
other