1. Limited time only! Sign up for a free 30min personal tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Counting Function for Polygonal Numbers of Rank Greater Than 2.

  1. Feb 7, 2010 #1
    Just as [tex]Li(x)[/tex] can be used to approximate how many
    prime numbers there are under a given number [tex]x[/tex],
    my function [tex]B(x)[/tex], which you can find here:

    http://donblazys.com/on_polygonal_numbers.pdf

    can be used to approximate how many
    polygonal numbers of rank greater than [tex]2[/tex]
    there are under a given number [tex]x[/tex].

    What makes this function really interesting is that
    it seems to require a constant [tex]\alpha[/tex]
    that either is, or is very, very close to
    the actual "experimental value" of the fine structure constant !.

    Thus, this function presents us with a wonderful mystery.

    Is the actual fine structure constant required
    in order to achieve the best possible approximation
    (meaning the lowest possible upper bound)
    for how many polygonal numbers of rank greater than [tex]2[/tex]
    there are under a given number [tex]x[/tex] ?

    Don.
     
    Last edited: Feb 7, 2010
  2. jcsd
Share this great discussion with others via Reddit, Google+, Twitter, or Facebook

Can you offer guidance or do you also need help?
Draft saved Draft deleted