https://wiki.forth-ev.de/ 2026-04-21T11:56:29+00:00 https://wiki.forth-ev.de/ https://wiki.forth-ev.de/lib/exe/fetch.php/wiki:logo.png text/html 2013-06-06T19:26:43+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.forth-ev.de/doku.php/en:examples:project_euler_-_problem_p115?rev=1370546803 Project Euler - Problem 115 From here NOTE: This is a more difficult version of problem 114. A row measuring n units in length has red blocks with a minimum length of m units placed on it, such that any two red blocks (which are allowed to be different lengths) are separated by at least one black square. text/html 2013-06-06T19:26:43+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.forth-ev.de/doku.php/en:examples:project_euler_-_problem_p146?rev=1370546803 Project Euler - Problem p146 Solution of the Problem and definition of forth words: * double precision logic and shift words * double precision math * Miller-Rabin primality test * random number generator #! /usr/bin/gforth \ ---- logic and shift words for double cell operands ------------------------- : dand ( d d -- d ) rot and >r and r> ; : dinvert ( d -- d ) swap invert swap invert ; : dlshift ( d u -- d ) 0 ?do d2* loop ; : dor ( d d -- d … text/html 2013-06-06T19:26:43+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.forth-ev.de/doku.php/en:examples:project_euler_-_problem_p151?rev=1370546803 Project Euler - Problem 151 From here A printing shop runs 16 batches (jobs) every week and each batch requires a sheet of special colour-proofing paper of size A5. Every Monday morning, the foreman opens a new envelope, containing a large sheet of the special paper with size A1.