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

autopushed

Browse Source
This commit is contained in:
Flancian
2023-05-11 21:00:56 +02:00
parent b7610cfdcd
commit a731a03627
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
@@ -3,3 +3,4 @@
- [[203]] * 2 but then I'm stumped, 203 could be a prime. I hope it is, maybe? - [[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. - 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. - 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.
- In this case, though, the square root of 400 comes easier (to me): 20.