zlacker

[parent] [thread] 1 comments
1. coolTh+(OP)[view] [source] 2025-04-03 17:45:03
Try this, launch Cursor.

Type: print all prime numbers which are divisible by 3 up to 1M

The result is that it will do a sieve. There's no need for this, it's just 3.

replies(1): >>mysfi+54
2. mysfi+54[view] [source] 2025-04-03 18:07:15
>>coolTh+(OP)
Just tried this with Gemini 2.5 Pro. Got it right with meaningful thought process.
[go to top]