Re: Error

From: Anith Sen (anith_at_bizdatasolutions.com)
Date: 11/01/04


Date: Mon, 1 Nov 2004 08:55:26 -0600

You can trap the errors using a CASE expression with a PATINDEX() function
to check if the strings have digits in them. If you search the google
archives of this newsgroup, you can find several t-SQL examples of such
checking.

-- 
Anith 


Relevant Pages

  • Solving the Google "prime number in e" challenge
    ... JOB HUNTERS, GOOGLE THIS ... Here you'll find a RosAsm assembly program that computes the decimal digits ... have one multi-kilobyte number to deal with, E, that you divide by N, ... the Woz algorithm runs through a long memory array one byte ...
    (alt.lang.asm)
  • Re: abundance of irrationals!)
    ... >> non-terminating strings of binary digits, ... > In order to form your antidiagonal number, you need too many digits. ... Any terminating sequence of binary digits can be arbitrarily extended ...
    (sci.math)
  • Re: infinity
    ... >> Sure, given S symbols in L digits, you can represent exactly L^S ... If you are required to have infinite ... > strings in an infinite set of strings from a finite alphabet ... Individual naturals are all finite, but the set of all of them has no ...
    (sci.math)
  • Re: infinity
    ... >>> Sure, given S symbols in L digits, you can represent exactly L^S ... If you are required to have infinite ... >> strings in an infinite set of strings from a finite alphabet ... if there is no finite bound on the lengths of the strings, ...
    (sci.math)
  • Re: Euclidean Geometry in Schools
    ... >>> strings of decimal digits, ... Thus strings of digits aren't the reals for if they were, ... > real numbers are infinite strings of digits is misleading naivete. ...
    (sci.math)