Communities

Writing
Writing
Codidact Meta
Codidact Meta
The Great Outdoors
The Great Outdoors
Photography & Video
Photography & Video
Scientific Speculation
Scientific Speculation
Cooking
Cooking
Electrical Engineering
Electrical Engineering
Judaism
Judaism
Languages & Linguistics
Languages & Linguistics
Software Development
Software Development
Mathematics
Mathematics
Christianity
Christianity
Code Golf
Code Golf
Music
Music
Physics
Physics
Linux Systems
Linux Systems
Power Users
Power Users
Tabletop RPGs
Tabletop RPGs
Community Proposals
Community Proposals
tag:snake search within a tag
answers:0 unanswered questions
user:xxxx search by author id
score:0.5 posts with 0.5+ score
"snake oil" exact phrase
votes:4 posts with 4+ votes
created:<1w created < 1 week ago
post_type:xxxx type of post
Search help
Notifications
Mark all as read See all your notifications »
Challenges

Comments on Make my number a set

Parent

Make my number a set

+7
−0

Natural to set

(set meaning an unordered collection with no duplicates, though answers may use and output lists instead)

Recently I was brainstorming what a language with only (arbitrarily nested) sets would be like. A number is represented with a set of that many elements. The elements need to be different, which leads to this definition:

Definition

  • The set representation of $0$ is the empty set.
  • The set representation of any other integer $n$ is the set of the set representations of all positive integers less than $n$, including zero.
  • Negative, complex, or rational numbers do not need to be handled.
  • Your full program or function is to convert from a positive integer to a set or list.

Examples

0 {}
1 {{}}
2 {{}, {{}}}
3 {{}, {{}}, {{}, {{}}}}
History
Why does this post require moderator attention?
You might want to add some details to your flag.
Why should this post be closed?

0 comment threads

Post
+2
−0

Ruby, 27 bytes

->n{x=[];n.times{x<<x*1};x}

->n{                      }  # lambda taking n
    x=[];                    # set x to empty array
         n.times{      };    # repeat n times
                 x<<x*1      # append x with a copy of itself       
                         x   # return x

Try it online!

History
Why does this post require moderator attention?
You might want to add some details to your flag.

1 comment thread

alternative 27 bytes: `o=->n{(0...n).map{|x|o[x]}}` (3 comments)
alternative 27 bytes: `o=->n{(0...n).map{|x|o[x]}}`
Wezl‭ wrote over 2 years ago

alternative 27 bytes: o=->n{(0...n).map{|x|o[x]}}

Wezl‭ wrote over 2 years ago

21 bytes: o=->n{(0...n).map &o}

snail_‭ wrote over 2 years ago

Feel free to submit your own answer, since this approach is different enough from my own. I only feel good about taking small golf improvements.