# 10 print chr$(205.5+rnd(1)); : goto 10

**URL:** https://discourse.processing.org/t/10-print-chr-205-5-rnd-1-goto-10/15483
**Category:** Coding Questions
**Created:** [November 14, 2019, 10:30am UTC](https://discourse.processing.org/t/10-print-chr-205-5-rnd-1-goto-10/15483 "2019-11-14T10:30:45Z")
**Posts on this page:** 1
**Showing post:** 61

<div class="post-metadata">

### Author: ![paulstgeorge](https://avatars.discourse-cdn.com/v4/letter/p/53a042/32.png) [@paulstgeorge](https://discourse.processing.org/u/paulstgeorge)
#### Post date: [August 20, 2021, 7:23am UTC](https://discourse.processing.org/t/10-print-chr-205-5-rnd-1-goto-10/15483/61 "2021-08-20T07:23:13Z")

</div>

People!

Brevity is the soul of wit, golf, and much code. But many of the solutions here have something extra, and that is elegance. I suppose elegance is a short apparently simple statement (equation, sonnet, code, etc.) that when unpacked is huge and complex. An example would be the most beautiful equation in the world, "pow(e, i\*PI) + 1 = 0”, seen in a freeze-frame of Lisa Simpson’s book cover in ‘MoneyBart’ and named after Leonhard Euler.

I have been trying to find an elegant way to generate the permutations of all the members of a set. I can write code that does the job but it is far from elegant and certainly not brief. Perhaps this should be the subject of a new thread.

e = e = 2.71828; // Euler’s number  
i = sqrt(-1); // imaginary

---

_[View the full topic](https://discourse.processing.org/t/10-print-chr-205-5-rnd-1-goto-10/15483)._