All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Numbers > Sequences
Sequence of Sets (Posted on 2017-07-30) Difficulty: 3 of 5

  
Design a sequence S0, S1, ... , S where each Si
   1) is a string of characters from the set
      {φ, "right brace", "left brace", comma} (φ denotes the empty set),
   2) denotes a valid set, and
   3) |Si| = i.

For clarity you can define substrings and use recursion.

Note; Si = {φ,{φ},{φ},φ,{φ,{φ}}} = {φ,{φ},{φ,{φ}}}
                |Si| = 3 not |Si| = 5.

Note: φ = {}. I don't know if this will help.

A possible start: S0 = φ , S1 = {φ} , ...
  
 

No Solution Yet Submitted by Bractals    
No Rating

Comments: ( You must be logged in to post comments.)
  Subject Author Date
There are no comments yet.
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (2)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2017 by Animus Pactum Consulting. All rights reserved. Privacy Information