Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
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.

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 browsing the Monastery: (8)
As of 2016-06-28 22:57 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    My preferred method of making French fries (chips) is in a ...











    Results (364 votes). Check out past polls.