Re^5: Compare two dates - what's Renard Series?

that's super thanks.

Your last comment about money denominations got me thinking: another aspect of these numbers is to be able to construct sums with the shortest linear combination - e.g. use the fewest different money denominations for change of 39.43. So that's an added optimisation parameter right? Is there theory for that?

Comment on Re^5: Compare two dates - what's Renard Series?

Replies are listed 'Best First'.
Re^6: Compare two dates - what's Renard Series? by hippo (Archbishop) on Jul 25, 2019 at 12:50 UTC
Is there theory for that? Isn't it as simple as ~~prime~~ factors of the base (with the additional 1, of course)? Edit: not necessarily prime, d'oh!	[reply]
Re^7: Compare two dates - what's Renard Series? by bliako (Abbot) on Jul 25, 2019 at 13:04 UTC
Just 1/0.1/0.01 is enough! But I want "fewest denominations" or "fewest notes per denomination" or "fewest actual notes" (notes=valid money denominations includes coins)	[reply]
Re^8: Compare two dates - what's Renard Series? by hippo (Archbishop) on Jul 25, 2019 at 13:15 UTC
As above, isn't that what the factors give? The factors of base 10 are 2 and 5, adding in the 1 gives you the normal coinage/notage sequence. This is the fewest denominations which gives on average the fewest notes/coins per sum. If we used hexadecimal money, the factors would be 2, 4 and 8. Adding in the 1 again makes the fewest denominations which gives on average the fewest notes/coins per sum. Now that I think about it, this would be different for a prime base, of course. So, you're right - it is more complicated. Although any society using a prime base for currency deserves everything they get.	[reply]