Re^2: Hamming Sequences and Lazy Lists

Replies are listed 'Best First'.
Re^3: Hamming Sequences and Lazy Lists by kvale (Monsignor) on Mar 17, 2005 at 17:38 UTC
Given the OP's reference to the factors of a composite number thread, I interpreted 'use an unlimited number of times" to mean create numbers of the form `2*$i 3*$j 5**$k` [download] with $i, $j, and $k as integers >= 0. The program I wrote generalizes this by handling an arbitrary number of arbitrary factors. I don't know what you mean by 'factors of 3 lists', but if I guess that each list is a multiple of each factor, then I think that must not be right. The example given by the OP had 1 as the first member, but 1 is not any multiple 2, 3, or 5. That said, there is an error my program :) 16 should be in the list even in my understanding of the problem. The mistake with is that the bound on the $depth I set was too low. In the harsh light of the morning, a safe bound is `my $depth = $seq_len;` [download] But I am sure this bound can be made tighter, right after I have some tea :) -Mark	[reply] [d/l] [select]
Re^4: Hamming Sequences and Lazy Lists by Limbic~Region (Chancellor) on Mar 17, 2005 at 18:01 UTC
kvale, I understand the need for caffeine. I plan on cleaning my code up too. Here is a visual representation of my understanding of the Hamming sequence. `2 = 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30, ... 3 = 3, 6, 9, 12, 15, 18, 21, 24, 27, 30, ... 5 = 5, 10, 15, 20, 25, 30, ... H = 1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 14, 16, 18, 20, 21, 22, 24, 25, 26 +, 27, 28, 30, ...` [download] Cheers - L~R Update: This is wrong. I was so focused on lazy evaluation that I misunderstood "how do you generate the series of numbers composed of a given list of prime factors, where each can be used an unlimited number of times?" To me, that meant any positive multiple of any factor was valid.	[reply] [d/l]


XP is just a number
	PerlMonks