ASCI-COEP / ASCI-COEP/hacktoberfest
Implement a program that finds out modular multiplicative inverse using Extended Euclidean Algorithm
Open
hacktoberfest
- Dominant language
- Jupyter Notebook
- Stars
- 12
- Forks
- 117
- PR merge metrics
- No merged PRs in 30d
Description
This issue has no description.
Contributor guide
No contributing guide indexed for this repository
Research direction
The issue names no file, notebook, test, input format, or expected output. Start by inspecting the repository's existing notebooks and algorithm examples, then identify the appropriate entry point for an Extended Euclidean Algorithm implementation. Done means the program computes modular multiplicative inverses for the supported inputs and demonstrates or tests the expected results.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- jupyter-notebook
- Domain
- data
- Issue type
- Feature
- Difficulty
- 3/5
- Estimated time
- 1-2 days
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100