Divide a rectangle into a number of unequal triangles: Difference between revisions

m
→‎{{header|Raku}}: fix a mistake
(added Raku programming solution)
m (→‎{{header|Raku}}: fix a mistake)
Line 423:
sub UnequalDivider (\L,\H,\N where N > 2) {
 
if N == 3 { return (0,H), (0,0), ((2/5)*L,0H), (L,0), (L,H) }
my @primes = ((2..*).grep:{.is-prime})[^N] ; # for randomness
351

edits