Question: I have a problem I want to ask that has a cool math trick I know that can help people solve it. Should I reveal it in the question or let people discover it on their own?
I had a lot of fun discovering it myself so I thought it would be fun to leave it for other people to find, but it feels a little underhanded because the trick is pretty powerful.
If you are going to make it a challenge, I would recommend posting it to the sandbox and people will judge if the trick should be part of the question if they figure it out
@Dennis, the !!superprime answer on the primality checking question isn't a valid answer because it isn't a programming language according to our standards.
Intro
Reverse and add is as simple as it sounds, take n and add it to its digits in reverse order. (e.g. 234 + 432 = 666).
If you apply this process repeatedly some numbers will eventually hit a prime number, and some will never reach a prime.
Example
I currently have
11431 rep.
11431 is n...
([aeiouy]\w*)\Bing\b/$1in''s a favourite regex for me, because it replaces words like flying and running with flyin' and runnin', but preserves thingblingsing and such.
.code.tio: fork: retry: No child processes
.code.tio: fork: retry: No child processes
.code.tio: fork: retry: No child processes
.code.tio: fork: retry: No child processes
.code.tio: fork: retry: No child processes
Usage: grep [OPTION]... PATTERN [FILE]...
Try 'grep --help' for more information.
Real time: 15.140 s
User time: 0.012 s
Sys. time: 0.027 s
CPU share: 0.26 %
.code.tio: fork: retry: Resource temporarily unavailable
..code.tio: fork: retry: No child processes
code.tio: fork: retry: No child processes
Is anyone actually interested in solving my challenge? Because if its not as interesting as I think I can provide a sample algorithm to make it easier.
I thought it was fun but it might not be fun for other people.
So this is interesting. If I force my PC to the memory limit (i.e. compress all compressible memory), I gain more free memory because Windows is very reluctant to uncompress any of it.
I thought I would inform everyone that I have just upped the reward on the fastest miniflak Quine, there is now a 1100 rep indefinite bounty for beating me.
Intro
Reverse and add is as simple as it sounds, take n and add it to its digits in reverse order. (e.g. 234 + 432 = 666).
If you apply this process repeatedly some numbers will eventually hit a prime number, and some will never reach a prime.
Example
I currently have
11431 rep.
11431 is n...
