Question

design a geonelogy with this heptatic structure...

Answer 1

http://resources.khouse.org/products/dvd127/

Answer 2

you have to watch the video to know what's the question

Answer 3

https://www.youtube.com/watch?v=8hOKA9fR2p4

Answer 4

\[\\\text{the rules for the challenge}\\\bullet\text{the number of words must be divisible by 7}
\\\bullet\text{the number of letters must be divisible by 7}
\\\bullet\text{the number of vowels and consonants must be divisible by 7 }
\]

Answer 5

is this possible to compute

Answer 6

only this three,for interest sake

Answer 7

interesting, should be trivial to compute wid oly 3 constraints

Answer 8

are there any rules for words ? (must have one vowel, thats all eh ?)

Answer 9

yes but it seems the more constraints the more difficult the smaller the probability the less triviality

Answer 10

lets try to implement and see

Answer 11

okay ???

Answer 12

i am taking words from /usr/share/dict/words

Answer 13

but this is very difficult cos we need to make 7 trees

Answer 14

now it meets the first constraint

Answer 15

number theory is a must i guess

Answer 16

a name can have multiple words i would assume. gimme some time, il get u the tree satisfying the 3 constraints picking words from dictionary

Answer 17

how long will your tree be,is it just one trees or 7 trees(generation)

Answer 18

yeah lets be specific, geneology trees are not binary i think. so... we can simply have 1 generation also ?

Answer 19

okay,lets take 1 probably the simplest sake

Answer 20

complex

Answer 21

this is too much,but the person gave the answer later wich is satisfying all the conditions
http://www.biblegateway.com/passage/?search=Matthew+1&version=NIV

Answer 22

3 constraints turns out to be simple, more constraints it becomes extremely complex for sure.
pfa one tree satisfying the 3 constraints

Answer 23

using above tree, we can generate multiple other trees that satisfy the given 3 constraints.

would like to judge the complexity when we add all other constraints listed in the video... wil try it once i get some time... nice problem, thanks for sharing :)

Answer 24

its a pleasure,thank you for your time

Answer 25

what program is that and can you -if possible paste the code needed to run that program 'shell'

Answer 26

```
#!/tools/cfr/bin/perl

my @dict_words = `cat /usr/share/dict/words`; chomp(@dict_words);


#my @words = qw /jonaskk Aalborg Aandahl Aaqbiye Aaronic aaronic /;
my @words = qw /ganeshh Aalborg Aandahl Aaqbiye Aaronic aaronic /;

foreach my $word (@dict_words) {
push(@words, $word) if (((length $word) == 7) && ($word !~ /[,-]/) && (&satisfies($word)));
last if $#words == 6;
}

sub satisfies {
my $test = shift;
my $words = join "", @words;
$words = $words . $test;
my $vowels = $words;
$vowels =~ s/[^aeiouAEIOU]//g;
my $consonents = $words;
$consonents =~ s/[\daeiouAEIOU]//g;
my $length = length $words;
my $length_vowels = length $vowels;
my $length_consonents = length $consonents;
if(($length_vowels % 7 == 0)&&($length_consonents %7 ==0)){
print "Letters ($length) : $words \n";
print "Vowels ($length_vowels) : $vowels \n";
print "Consonants ($length_consonents) : $consonents \n";
return 1;
}

return 0;
}

my $first = shift(@words);
print "$first\n>>>>";
print join "\n>>>>", @words;
print "\n";
```

Answer 27

familiar wid perl ? thats just quick dirty code i had to write... u wud understand i hope... but if we want to add remaining constraints we have to write it bit organized..