Computation Contest #1 Results and Solution
Solution
The problem of this contest was to sum up all numbers smaller than 1 000 000 which are not divisible by a number less then 100, but are not prime.
The solution is just a simple brute force calculation through all numbers.
Here is a simplified version of how you could have done it:
The result is then 22939817743 which is no prime as can be tested with the same prime tester.
↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓
List of participants with their entries:
| Name | Solution found |
|---|---|
| @kaeserotor | 22939817743, false |
| @crokkon | 22939817743, false |
↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓
Winner draw:
Congratulations @kaeserotor you won 1 SBI!
Of course everyone also got 10 STEM for participating(check your steem engine)!
↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓↑↓
The next contest starts in 2 days. Don't miss it!
0
0
0.000
@untersatz curate 50
The @untersatz witness and manual curation is under the guidance of @contrabourdon and @organduo.
Cool, thank you!. Maybe on the computation side one should mention that when checking if a number is prime, it's quite important to just check all numbers less or equal to the root of the number that is checked (as seen in your code). Otherwise the calculations will take forever