Validate the credit card (oracle 10 g plsql code) – working!

Posted by Jay     Tags: , , , , 29 January, 2009    3,841 views    (1) Comment

The Luhn algorithm or Luhn formula, also known as the “modulus 10″ or “mod 10″ algorithm, is a simple checksum formula used to validate a variety of identification numbers, such as credit card numbers and Canadian Social Insurance Numbers. Recently, Oracle has stopped validating the credit card numbers as there is match for Authorization of credit card. However, this rudimentary mod-10 LUHN algorithm is still valid and valuable for us to check. Hence, I started Read Full Article (Click here)...

Categories : 11i Scripts, Scripts Oracle Tags : , , , ,

LUHN algorithm for credit card check using javascript

Posted by Jiltin     Tags: , 10 December, 2008    5,312 views    (2) Comment

Here is the LUHN algorithm for credit card check using javascript /*—————————————————————*/ /*                                                               */ /* Function  : isCreditCard()       Read Full Article (Click here)...

Categories : Web & Scripts Tags : ,

LUHN Algorithm Logic

Posted by Jiltin     Tags: , , 4 December, 2008    7,153 views    (0) Comment

Algorithm for the Luhn Formula LUHN Algorithm in C# (Validate Credit Card) Credit Card validation LUHN algorithm using C LUHN Algorithm – Validate credit card – in PHP Validate the credit card (plsql code)! Here’s how the algorithm for the Luhn formula works. Starting with a given credit card number, 1 2 3 4 – 5 6 7 8 – 9 0 1 2 – 3 4 5 2 we reverse the number, removing any non-numeric characters, to create a new string of digits like this (note that the Read Full Article (Click here)...

Categories : 11i Scripts, Web & Scripts, Web Mysql Tags : , ,

LUHN Algorithm in C# (Validate Credit Card)

Posted by Jiltin     Tags: , , , 18 November, 2008    10,248 views    (4) Comment

The Luhn algorithm or Luhn formula, also known as the “modulus 10″ or “mod 10″ algorithm, is a simple checksum formula used to validate a variety of identification numbers, such as credit card numbers and Canadian Social Insurance Numbers. The formula verifies a number against its included check digit, which is usually appended to a partial account number to generate the full account number. This account number must pass the following test: 1. Counting from Read Full Article (Click here)...

Categories : Web & Scripts Tags : , , ,

Credit Card validation LUHN algorithm using C

Posted by Jiltin     Tags: , 9 November, 2008    6,383 views    (0) Comment

Checks whether a string of digits is a valid credit card number according to the Luhn algorithm. Starting with the second to last digit and moving left, double the value of all the alternating digits. For any digits that thus become 10 or more, add their digits together. For example, 1111 becomes 2121, while 8763 becomes 7733 (from (1+6)7(1+2)3). Add all these digits together. For example, 1111 becomes 2121, then 2+1+2+1 is 6; while 8763 becomes 7733, then 7+7+3+3 is 20. If the total ends in Read Full Article (Click here)...

Categories : Web & Scripts Tags : ,