Patents by Inventor Teck Sing Tie

Teck Sing Tie has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 9542158
    Abstract: A new mathematical technique called the T-sequence is a primality testing method. A similar approach can be applied to perform fast factoring for numerous special cases, a method that can, in all likelihood, be extended to the general case, making possible a general and fast factoring algorithm. The same T-sequence can be used to construct a prime number formula and a good random number generator.
    Type: Grant
    Filed: November 27, 2002
    Date of Patent: January 10, 2017
    Inventors: Teck Sing Tie, Shaul O. Backal
  • Publication number: 20040057580
    Abstract: Using a new mathematical technique called the T-sequence, the inventor has discovered a powerful primality testing method that meets all four conditions above. A similar approach can be applied to perform fast factoring for numerous special cases, a method that can, in all liklihood, be extended to the general case, making possible a general and fast factoring algorithm. (Researchers heretofore have been able to factor only in sub-exponential time, never in polynomial time.) The same T-sequence can be used to construct a prime number formula (long sought after but never achieved) and a good random number generator. The former can be used to generate infinitely many prime numbers of any size efficiently, and the latter can generate non-periodic and absolutely chaotic random numbers. These numbers are widely used in all areas of industrial and scientific simulations.
    Type: Application
    Filed: November 27, 2002
    Publication date: March 25, 2004
    Inventors: Teck Sing Tie, Shaul O. Backal
  • Publication number: 20020099746
    Abstract: Using a new mathematical technique called the T-sequence, the inventor has discovered a powerful primality testing method that meets all four conditions above. A similar approach can be applied to perform fast factoring for numerous special cases, a method that can, in all liklihood, be extended to the general case, making possible a general and fast factoring algorithm. (Researchers heretofore have been able to factor only in sub-exponential time, never in polynomial time.) The same T-sequence can be used to construct a prime number formula (long sought after but never achieved) and a good random number generator. The former can be used to generate infinitely many prime numbers of any size efficiently, and the latter can generate non-periodic and absolutely chaotic random numbers. These aft numbers are widely used in all areas of industrial and scientific simulations.
    Type: Application
    Filed: April 27, 2000
    Publication date: July 25, 2002
    Inventors: Teck Sing Tie, Shaul O. Backal