“Soooo big!” Counting on bit.ly, Part I

The URL-shortening service, bit.ly, is heavily used on Twitter to help members stay within the 140-character limit for each tweet (post). According to a brief story by Ben Parr in Mashable, bit.ly took over first place in this market from TinyURL last August. If you are wondering how this could possibly be a “market” or why anyone would care, see the longer piece by Michael Arrington in TechCrunch from almost exactly a year ago.

Over that same year, I went from follower of a few people to occasional poster. I certainly noticed the bit.ly and TinyURL re-directs, but didn’t give them much thought. I do remember thinking, however, that the sum total of URLs that could be generated with a string of six characters, chosen from the 26 lower- and 26 upper-case letters plus the 10 digits, must be a pretty big number, but that was it.

Most of these shortened URLs look like this — http://bit.ly/9hfrXY — with a seemingly-random 6-character string at the end generated by some hash function or other algorithmic recipe. But early last month, in a tweet by “zen habits” (Leo Babauta), this URL caught my eye: http://bit.ly/byTT2t. It was the first one I could recall with duplicates of any of the six characters. The two upper-case “T”s meant that any of the potential 62 (=26+26+10, see above) characters could be repeated. And, if repeated once, why not more than once, which allowed not only “byTT2t,” but “byTTTt” and “bTyT2T” and on and on. This would mean, in turn, a far bigger universe of unique URLs for bit.ly to assign. But just how big?…

The answer is one of the simplest counting expressions for combinations: the number of ways you can choose R objects (allowing the possibility of repetition) from a total population of N objects is N^R (N raised to the power R).

It is easy to see this empirically. Try it with the population (1,2), that is, the first two digits of the whole numbers, so N=2. And take R=2. Then the only possible arrangements where the order of choice matters are these: (1,1), (1,2), (2,1), and (2,2). And indeed N^R = 2^2 = 4. If the population is the first three digits, (1,2,3), N=3. If you keep R=2, you can check very quickly that there are only nine possible arrangements, and indeed N^R = 3^2 = 9. QED, or close enough.

In the bit.ly example, N = 62 and R = 6, so 62^6 = 56,800,235,584, which is the answer to the “how big” question a few paragraphs up.

For a global perspective, according to the U.S. Census Bureau World POPClock Projection, that is roughly eight URLs for each person on the planet. Not many, if they were all active Twitter and bit.ly users. But just at a guess, most of those six-plus billion have never been online at all, let alone on Twitter. Surely, then, 56 billion re-directs should last the rest of us for a very long time, right? Hold that comforting thought for Part II….

This entry was posted in Technology and tagged , , , , , . Bookmark the permalink.

14 Responses to “Soooo big!” Counting on bit.ly, Part I

  1. It’s an amazing post in support of all the online people; they will take benefit from
    it I am sure.

  2. This piece of writing offers clear idea for the new visitors
    of blogging, that actually how to do blogging and site-building.

  3. Noella says:

    What i don’t realize is actually how you’re now
    not actually much more neatly-favored than you might be right now.
    You are very intelligent. You understand therefore
    significantly in terms of this subject, produced me in my
    opinion imagine it from numerous varied angles.
    Its like women and men are not fascinated except it’s one thing to accomplish with Woman gaga!
    Your personal stuffs outstanding. All the time maintain it up!

  4. lpffa.org says:

    Thankfulness to my father who shared with me regarding this
    website, this website is in fact remarkable.

  5. You really make it seem so easy together with your presentation however I to find
    this topic to be really one thing which I think I would by
    no means understand. It seems too complex and extremely extensive for me.
    I’m taking a look ahead in your next put up, I’ll try to
    get the grasp of it!

  6. I’ve read several just right stuff here. Certainly value bookmarking for revisiting.
    I wonder how a lot effort you set to make one of these excellent
    informative website.

  7. Katlyn says:

    Link exchange is nothing else however it is only placing the other person’s
    blog link on your page at suitable place and other person will also do similar for you.

  8. For hottest news you have to visit internet and on the web
    I found this web page as a finest website for most up-to-date

  9. nbanswer.com says:

    I must thank you for the efforts you have put in writing this site.
    I am hoping to check out the same high-grade blog posts by you in the future
    as well. In truth, your creative writing abilities has encouraged me to get my own, personal site now ;)

  10. whoah this weblog is great i like reading
    your posts. Keep up the good work! You recognize,
    lots of people are hunting round for this info, you could aid them greatly.

  11. What’s up, after reading this amazing paragraph i am also happy to share my experience here with colleagues.

  12. I got this web page from my buddy who shared with me regarding this website and at the moment this time I am visiting this web site and
    reading very informative articles or reviews at
    this place.

  13. Very great post. I just stumbled upon your weblog
    and wished to say that I have really enjoyed browsing your weblog posts.
    In any case I’ll be subscribing to your feed and I’m hoping you write once more very soon!

  14. It’s remarkable to go to see this web page and reading the views
    of all mates on the topic of this post, while I am also eager of getting experience.

Leave a Reply

Your email address will not be published. Required fields are marked *

You may use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>