https://github.com/anjisweety2/algorithm-for-admissible-pairs
https://github.com/anjisweety2/algorithm-for-admissible-pairs
Science Score: 13.0%
This score indicates how likely this project is to be science-related based on various indicators:
-
○CITATION.cff file
-
✓codemeta.json file
Found codemeta.json file -
○.zenodo.json file
-
○DOI references
-
○Academic publication links
-
○Academic email domains
-
○Institutional organization owner
-
○JOSS paper metadata
-
○Scientific vocabulary similarity
Low similarity (4.4%) to scientific vocabulary
Repository
Basic Info
- Host: GitHub
- Owner: Anjisweety2
- Language: Python
- Default Branch: main
- Size: 1.95 KB
Statistics
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
- Releases: 0
Metadata Files
README.md
Algorithm-for-Admissible-Pairs
In the main branch, there is a Algorithm I.py file and a folder named "Algorithm II".
The Algorithm I.py file is used to check that Conjecture 1.1 is true for the first 12000 positive integers.
The Algorithm II folder contains four .py files, which are used to finish the proof of Theorem 1.3. The name of each file in this folder corresponds to the relevant pairs being checked. Note that there are in total 12 pairs in Conjecture 1.1, but Algorithm II only contains algorithms for 10 of them. This is because (15,0) and (0,22) are already checked in one of the references.
Remark:
We use two distinct approaches here because of Algorithm I runs much slower than Algorithm II for integers >> 10^5. We are incapable of running Algorithm I with such large integers.
Owner
- Login: Anjisweety2
- Kind: user
- Repositories: 1
- Profile: https://github.com/Anjisweety2
GitHub Events
Total
- Delete event: 1
- Push event: 18
- Create event: 3
Last Year
- Delete event: 1
- Push event: 18
- Create event: 3