With a base 12 version of everything you would have 1/12 of a day being 2 hours, 1/144 of a day is 10 minutes, and 1/1728 of a day is 50 seconds. These units would give us both easy divisibility and are close enough to existing time units to make sense.
This change would mean we have to memorize a 12 times table rather than a 10 times table. But in base 10 a 10 times table has easy patterns for 1, 2, 5, 9 and 10. A 12 times table has repeating patterns for 1, 2, 3, 4, 6, 8, 9, 11 and 12. The result is that a 12 times table in base 12 is actually less work to memorize than a 10 times table in base 10.
In the long run this transition would be a clear win. But it isn't enough of one compared to the transition to ever make sense to initiate.
The only country to actually use the calendar was, of course, France for 16(!?) years until Napoleon repealed it during his imperial reign.
https://en.wikipedia.org/wiki/Metric_time
Anyone, feel free to correct me. I, literally, just read about this (fascinating) subject a couple nights ago. I haven't had time to independently follow up on the topic, but I plan to do so soon.
Amendum: A better link, https://en.wikipedia.org/wiki/Decimal_time#France
If anything, the way the French "pushed their influence" was by conquest: The first countries that adopted metric were forced to when they were conquered by Napoleon. Many of them reverted after Napoleon was beaten, but then gradually they started converting to it again,
Since you're mentioning Napoleon I assume you just got your periods mixed up. There were indeed many crazy suggestions for calendars after the French revolution...
Most famous of all is the Eighteenth Brumaire, when Napoleon overthrew revolutionary institution and became the de facto dictator: https://en.wikipedia.org/wiki/Coup_of_18_Brumaire
The date was made even more famous by one Karl Marx, who used it in the evocative title of his essay https://en.wikipedia.org/wiki/The_Eighteenth_Brumaire_of_Lou... (or maybe the essay got famous because the title was evocative, don't know).
Also quite famous was the https://en.wikipedia.org/wiki/Thermidorian_Reaction which saw Robespierre and the Jacobins overthrown.
For other slightly less known events, see https://en.wikipedia.org/wiki/Glossary_of_the_French_Revolut...
https://en.wikipedia.org/wiki/Roman_calendar#Nundinal_cycle
"Because the term of office of elected Roman magistrates was defined in terms of a Roman calendar year, a Pontifex Maximus would have reason to lengthen a year in which he or his allies were in power, or shorten a year in which his political opponents held office. For example, Julius Caesar made the year of his third consulship in 46 BC 445 days long."
(Also, there's the old rule-of-thumb from Grace Murray Hopper that "pi seconds equals a nanocentury".)
Of course that would mean I would have to memorize the entire multiplication table again: because 55 in duodec would be 65 in dec. And 5x18 would be 84.
In the long run, trinary gives you the best radix-economy, being closest to e: https://en.wikipedia.org/wiki/Radix_economy
In base-N, you can accurately write any fraction of (1/y) provided that y can be expressed using the same prime-factors found in N.
For example, 10 has the prime factors of 2 and 5, leading to the requirement that y=(2^a × 5^b) .
This means base-10 can accurately represent (1/80), because 80 = (2^4 × 5^1). In base-2, you're limited to stuff in the form (2^a).
Finally, the, uh, infinity-of-integers that matches (2^a) is always going to be "smaller" than the infinity which can be matched by (2^a × 5^b), since the latter "contains" the former when b=0.
But there are two approaches that we can use.
The first is to point out that in real life it is more common to encounter small numbers than big ones. So if you choose a probability distribution for what denominators you expect in practice, and sum up the values of all of the exactly represented numbers, you can get to a fixed probability of even division. And it won't be zero.
Unfortunately your choice of the relative probability of having a 2 in the denominator versus a 3 is extremely arbitrary. So while the approach makes sense, the numbers you get really will be made up. (Though no matter how you make them up, your general statement is guaranteed correct.)
The second approach is to just look at how the count of exactly representable numbers below N scales with both N and your set of primes. This has been studied. The exact counts are a mess, but if you have a set S of prime divisors of size k, then the count is (1+o(1)) * 1/k! * [product over p in S of (log(N)/log(p)].
The upshot is that for large N, more prime factors always wins. And for specific prime factors, you just look at the ratio of logs.
For instance with this approach we can say that log(3)/log(5) = 1.46497352071793... times as many denominators are exactly representable in base 12 as in base 10. (The log(2) factors cancel out.) Therefore base 12 is better.
Of course the second approach says that base 6 is as good as base 12, and it is smaller, so why not use it? Well, the reason why we keep on winding up with base 12 in practical situations is that divisibility by 4 comes up a lot. It isn't just exactly representable that matters, efficiency matters.
In this fashion, primes p seem "better" as they increase, because for a given size limits on k and n, you get more 'numbers' per unit space on the real line. Composite numbers are 'even better', but there are a lot of pains in the ass with composite numbers, stemming from Z/nZ not being a field if n not prime.
Ultimately, though, your internal representation is binary, using anything not two produces other inefficiency. That's why IEEE 754 BCD is not base-10 but base-1000 (since 2^10 = 1024 which is the closest a power of two gets to a power of 10, for bit-wise representation efficiency). We don't have bi-quinary computers.
In fact, I think it exemplifies the upper bound for the number of digits you'd need for "related fractions". For example, we know "one eighth" is expressible in decimal as 0.125. Even if you pick a really big N value, N * (1/8) should never need more than three digits to the right of the decimal point.
It is easier for the computer to adapt to us, rather than vice versa. And over time things get easier and easier for the computer, while staying the same for us. Which is why over time we wind up interacting with computers in ways that are more and more adapted to us rather than them.
We already have acceptably good algorithms to convert to/from different representations, and roundoff errors are generally acceptable. (If they weren't, we wouldn't default to using floating point for most things.) Where precision matters, we have reasonably efficient implementations of exact integer arithmetic and exact fraction arithmetic. The performance hit from using these is less than the hit from using a high level language like Python versus a low-level language like C.
The main challenge is getting programmers to use the right representation for the purpose that they are using it for. Which is mostly challenging exactly because floating point works so well in practice that it is easy not to learn what its limitations are.
In physics it is uncommon to have exact measurements for much of anything except integers. In physics, measurement error is usually a bigger issue than roundoff errors from floating point, so the non-existence of an exact floating point representation of the stated measurement is a non-issue.
In the real world, most cases that I'm aware of where we need exact base 10 calculations have to do with dealing with money in a single currency. You would be amazed how often square roots don't come up in this context!
Fractions show up as soon as you start doing currency conversions. (In fact the Euclidean algorithm for finding the GCD is believed to have been first developed by merchants for exactly this problem.) They are easy to add to a programming language, but you'd only use them in contexts (like finance) where square roots make no sense.
If you want to go beyond fractions to add square roots and so on, you can do algebraic numbers. This is a fairly specialized mathematical need, but Mathematica has done it perfectly well for decades.
For arbitrary real numbers, we're sort of stuck. We can come up with representations that can cover any real number that we can talk about. But we can't take 2 arbitrary representations of a real number and in finite time decide whether or not they are actually the same number. That said, Mathematica again solves this problem "well enough" for most practical purposes. See http://mathworld.wolfram.com/Ferguson-ForcadeAlgorithm.html for more.
This is a complex topic, with ongoing research across multiple fields of study.
That said, floating point is a "good enough" default for a surprisingly wide variety of situations.
It's just that top to bottom very few people are willing to trade the loss of speed for the increase in accuracy (not that decimal is great either, you still run into plenty of repeating fractions)
I think so, by multiplying by 12 and then 3.
1 2 3 4 5 6 7 8 9 a b
so 10 would be 12
I did not otherwise specify, so I represented my numbers in base 10 everywhere even though I was talking about base 12.
(With TeX formatting implied)
In fact we mostly indicate the base when there is a good possibility that it isn't 10, and any stray numbers fail to have a base represented, they should be assumed to be base 10.
(Mathematical notation mostly uses sensible defaults except for differential geometry.)
Multiply by 36 (12*3) then divide by 10?
But it isn't the "move the decimal point" of other metric unit conversions.
I'd have to run the numbers. It would be interesting to consider different subsets. I also think adding in 15 would probably worth the extra number for real-world datasets.
Isn't that backwards? 7 is the hardest, so you spend more time on it, not less.
But I only have 10 fingers!
On a practical note, wouldn't that mean inventing 2 new symbols to represent 10 and 11 as single digits, otherwise I could see that getting very confusing.
You could't really use A and B, as then some people would be unable to find the correct seat on an airplane.
That's why I mentioned counting on the finger-joints :-)
> On a practical note, wouldn't that mean inventing 2 new symbols to represent 10 and 11
Already been done, over a hundred years ago, and they're even in Unicode already[1]!
10 is a rotated 2 (ᘔ)
11 is a rotated 3 (Ɛ)
"Finger-counting systems in use in many regions of Asia allow the counting to 12 by using a single hand."[0]
[0] https://en.wikipedia.org/wiki/Finger-counting
(Edit: silly me and trying to use Markdown)
I agree about the symbols, though.
You can count to 10 with 5 fingers with not much practice (look up Chisanbop); I think most kids could pick up counting to 12 on their finger joints pretty quickly.
Base 10 and base 12 both use two of them. (12/4=3 yay, but 10/4 = 2.5 so meh) The same is true of base 6 or base 15.
Every other prime number repeats so switching is pointless, unless you divide by 3 vastly more often than by 5.
PS: Several ancient systems use base 60 which uses 2, 3, and 5 and may have been created by joining a base 6 system with a base 10 system. However, base 30 also works well for this and is thus a clear step up from base 10 or 12 while being simpler than base 60.
It's highly probable that in duodecimal one would divide by 2, 3, 4, 6, 8 & 9 as often as one divides by 5 in decimal, and avoid 5 as much as one avoids 3 & 7 in decimal.
3 and 9 are also fast though you get either a remainder or a repeating number. So, really the advantage is 6 vs 5.
say in hex you have a number 0x56aF900000, you know that your divisors can have no more than 5 non-zero (hex) digits. This is not so for decimal numbers; 32 * 125 = 4000
And then there are measures like a gross (144) and a great gross (1,728). Part of the reason for these traditional measures is that they are more flexible than base-10 measures: an eighth-gross or a third-gross are both integer quantities, unlike an eighth-hundred or third-hundred.