![]() |
Originally Posted by Yoshi
(Post 5629356)
You have 13 skid patches with a 40x13. However because you skid anywhere from 1 to 5 o'clock a lot of them overlap and it looks like 6.
like i stated 650c rims front and rear, it throws the math off for me. thats why i have 74 gear inches at that ratio |
Originally Posted by mander
(Post 4451893)
A lot of people just associate math with the boring number crunching they did in high school, but it *is* sexy when you get into the good stuff. the power and beauty is really summinelse.
|
Great proof. Elegant and well-written (I didn't check every line, but I believe it is correct.) And contrary to the last poster, there is something sexy about basic algebra.
|
Originally Posted by c0urt
(Post 5630555)
not running 700c tires so I have fewer skid patches due to smaller rim size and fewer rotations in relation to the cranks.
basic algebra rocks. |
Originally Posted by c0urt
(Post 5630555)
not running 700c tires so I have fewer skid patches due to smaller rim size and fewer rotations in relation to the cranks.
like i stated 650c rims front and rear, it throws the math off for me. thats why i have 74 gear inches at that ratio |
An Equivalence
My aim in this post is to couch the original theorem in language of cyclic groups (Fraction probably had this in mind). The only real benefit of this is that it reduces Part (2) of the theorem to an immediate corollary.
Corollary to 1: Let a be the number of teeth on the chainring and b the number of teeth on the rear sprocket, and s=# skid patches. Then s=ord(a) in Z/bZ, where Z is the group of integers. In particular, s=b/gcd(a,b). Proof: The equivalence is immediate when you recognize that b/gcd(a,b) is the b from the reduced fraction a/b as per the theorem, Part (1). Corollary to 2: Suppose the rider is an ambidextrous skidder. If a is even, then in general ord(a) in Z/2bZ is the least k such that ka equiv 0 (mod 2b), and since b is even we have ka/2 equiv 0 (mod b). The converse is similarly shown. Suppose that a was odd. Recall that the order of an element has to divide the order of the group, which in the ambidextrous skidder case is 2b. So in particular, k is even. Thus, letting k be as above, we have ka equiv 0 (mod 2b) which implies k/2 a equiv 0 (mod b). Or, for a more direct number theoretic description, simply recognize that 2b/gcd((a,2b)=b/gcd(a,b) if and only if a is even. |
by golly, i think you're on to something!
|
Right, but any non-trivial case of gear ratios will involve at least one odd number. Hm. Shouldn't there be some kind of probabilistic analysis? Meaning, even if one skids in the same position every time, and I'll accept that, and even if each skid patch is a discrete point, which I'm also willing to buy for the sake of argument, does each of the b skid patches occur with equal frequency? One would think so, but it might be worth looking into.
Best thread ever, IMHO. |
What's The Derivative Of My Bike Nigguh
|
SS = 1 x 1 = 1^2 so SS' = 2 x 1^1 = 2 :)
|
Originally Posted by Satyr
(Post 6589824)
My aim in this post is to couch the original theorem in language of cyclic groups (Fraction probably had this in mind). The only real benefit of this is that it reduces Part (2) of the theorem to an immediate corollary.
Corollary to 1: Let a be the number of teeth on the chainring and b the number of teeth on the rear sprocket, and s=# skid patches. Then s=ord(a) in Z/bZ, where Z is the group of integers. In particular, s=b/gcd(a,b). Proof: The equivalence is immediate when you recognize that b/gcd(a,b) is the b from the reduced fraction a/b as per the theorem, Part (1). Corollary to 2: Suppose the rider is an ambidextrous skidder. If a is even, then in general ord(a) in Z/2bZ is the least k such that ka equiv 0 (mod 2b), and since b is even we have ka/2 equiv 0 (mod b). The converse is similarly shown. Suppose that a was odd. Recall that the order of an element has to divide the order of the group, which in the ambidextrous skidder case is 2b. So in particular, k is even. Thus, letting k be as above, we have ka equiv 0 (mod 2b) which implies k/2 a equiv 0 (mod b). Or, for a more direct number theoretic description, simply recognize that 2b/gcd((a,2b)=b/gcd(a,b) if and only if a is even. E.g., suppose you have a chain ring with a = 42 teeth and a sprocket with b = 14 teeth, then a is even but the reduced ratio 42/14 = 3/1 has an odd numerator. Note that this also gives a counter example to your final claim: 2*14/gcd(42,2*14) = 2 does not equal 1 = 14/gcd(42,14) |
| All times are GMT -6. The time now is 09:21 AM. |
Copyright © 2026 MH Sub I, LLC dba Internet Brands. All rights reserved. Use of this site indicates your consent to the Terms of Use.