Timeline for Consecutive Composite Numbers
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 18 at 10:43 | history | edited | l4m2 | CC BY-SA 4.0 |
added 428 characters in body
|
| Jan 18 at 10:23 | comment | added | Mukundan314 | 38 bytes by returning a list instead of outputting to console | |
| Jan 18 at 10:21 | history | edited | l4m2 | CC BY-SA 4.0 |
added 28 characters in body
|
| Jan 18 at 9:56 | comment | added | tsh |
Maybe you need apply above comment again: f=(n,i=n)=>--n&&f(n,g=i*n)>console.log(n-~g)
|
|
| Jan 18 at 8:26 | history | edited | l4m2 | CC BY-SA 4.0 |
Cleanup
|
| Jan 18 at 8:21 | history | edited | l4m2 | CC BY-SA 4.0 |
added 463 characters in body
|
| Jan 18 at 8:11 | history | edited | l4m2 | CC BY-SA 4.0 |
deleted 2 characters in body
|
| Jan 18 at 2:06 | history | edited | l4m2 | CC BY-SA 4.0 |
added 16 characters in body
|
| Jan 18 at 1:14 | comment | added | Arnauld |
Comparing BigInts with Numbers is fine, so you can just do i>0.
|
|
| Jan 18 at 0:35 | history | answered | l4m2 | CC BY-SA 4.0 |