Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris
 
PerlMonks  

Re^3: Hamming Sequences and Lazy Lists

by Roy Johnson (Monsignor)
on Mar 17, 2005 at 18:01 UTC ( #440461=note: print w/ replies, xml ) Need Help??


in reply to Re^2: Hamming Sequences and Lazy Lists
in thread Hamming Sequences and Lazy Lists

I did not implement Hamming here; only merging of two list iterators. But I have just posted a lazy Hamming solution.


Caution: Contents may have been coded under pressure.


Comment on Re^3: Hamming Sequences and Lazy Lists
Replies are listed 'Best First'.
Re^4: Hamming Sequences and Lazy Lists
by Limbic~Region (Chancellor) on Mar 17, 2005 at 18:04 UTC
    Roy Johnson,
    Ok - my mistake. In fact, I completely missed the boat on the entire problem. 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 any positive multiple of any factor was valid.

    Cheers - L~R

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://440461]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others rifling through the Monastery: (5)
As of 2015-07-29 04:23 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (260 votes), past polls