flancian/garden
0
0
Fork 0
mirror of https://github.com/flancian/garden.git synced 2026-08-08 07:26:21 +00:00
Code Issues Packages Projects Releases Wiki Activity

autopushed

Browse Source
This commit is contained in:
Flancian
2023-05-11 21:00:21 +02:00
parent d5993b8657
commit b7610cfdcd
1 changed files with 1 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files
406.md
+1
View File
@@ -2,3 +2,4 @@
- I think the fact that 405 and 406 are adjacent in the number line and have wildly differing difficulties of factorization probably says something about the nature of numbers? analyzing this fact can probably lead to interesting relations
- [[203]] * 2 but then I'm stumped, 203 could be a prime. I hope it is, maybe?
- It's clearly not divisible by 3 if you already checked [[406]] (sum of digits 10, not divisible by 3), but I still checked out of custom. While doing this, remembering which numbers you don't have to check is useful as it prevents duplicate work. Still I'm not concerned about repeating checks because I enjoy them.
- There is a bound for possible divisors we have to check; the bound is the square root of 203. That means that we may have gained some equity by not having taken the square root of 406, potentially harder to calculate than that of 203.