Please dont add in html script but use coding should be in javascript. It shouldnt be prompting message or alert but it should errorflag the error like the card is valid or the card is invalid when i click the purchase button. Modulus Check Logic For this project, we will be taking in 10 digit credit card numbers. Ensure the user entered only 10 numbers. If they pass this check, perform a modulus check to ensure that the user has submitted a valid credit card number. Note that the checking factors below are the literal checking factors you will use in your solution. Sample Credit Card Number 9434578423 Checking Factors 432765432 Multiply Checking Factors by Credit Card digits and Sum (9 * 4) + (4 * 3) + (3 * 2) + (4 * 7) + (5 * 6) + (7 * 5) + (8 * 4) + (4 * 3) + (2 * 2) = 195 Divide the Sum by 11 195 / 11 = 17, gives a remainder of 8 Subtract 11 - 8 = 3 (this is the check digit) Compare the check digit to the last digit in the credit card number 9434578423 The credit card number is valid when the check digit and the last digit in the credit card number are equal. The following valid credit card numbers can be used for testing: 1111111118 2222222225 4111313135 2234321326 Note: The “%” is the mathematical operator used to get the remainder. Examples: 10 % 5 = 0, there is no remainder 10 % 3 = 1, there is a remainder of 1
Please dont add in html script but use coding should be in javascript. It shouldnt be prompting message or alert but it should errorflag the error like the card is valid or the card is invalid when i click the purchase button.
Modulus Check Logic
For this project, we will be taking in 10 digit credit card numbers. Ensure the user entered only 10 numbers. If they pass this check, perform a modulus check to ensure that the user has submitted a valid credit card number.
Note that the checking factors below are the literal checking factors you will use in your solution.
Sample Credit Card Number |
9434578423 |
Checking Factors |
432765432 |
Multiply Checking Factors by Credit Card digits and Sum |
(9 * 4) + (4 * 3) + (3 * 2) + (4 * 7) + (5 * 6) + (7 * 5) + (8 * 4) + (4 * 3) + (2 * 2) = 195 |
Divide the Sum by 11 |
195 / 11 = 17, gives a remainder of 8 |
Subtract |
11 - 8 = 3 (this is the check digit) |
Compare the check digit to the last digit in the credit card number |
9434578423 |
The credit card number is valid when the check digit and the last digit in the credit card number are equal.
The following valid credit card numbers can be used for testing:
1111111118
2222222225
4111313135
2234321326
Note:
The “%” is the mathematical operator used to get the remainder.
Examples:
10 % 5 = 0, there is no remainder
10 % 3 = 1, there is a remainder of 1
Step by step
Solved in 4 steps with 3 images
Please dont add in html script but use coding should be in jscript code. It shouldnt be prompting message or alert or console log but it should errorflag the error like the card is valid or the card is invalid when i click the purchase button.
Modulus Check Logic
For this project, we will be taking in 10 digit credit card numbers. Ensure the user entered only 10 numbers. If they pass this check, perform a modulus check to ensure that the user has submitted a valid credit card number.
Note that the checking factors below are the literal checking factors you will use in your solution.
Sample Credit Card Number |
9434578423 |
Checking Factors |
432765432 |
Multiply Checking Factors by Credit Card digits and Sum |
(9 * 4) + (4 * 3) + (3 * 2) + (4 * 7) + (5 * 6) + (7 * 5) + (8 * 4) + (4 * 3) + (2 * 2) = 195 |
Divide the Sum by 11 |
195 / 11 = 17, gives a remainder of 8 |
Subtract |
11 - 8 = 3 (this is the check digit) |
Compare the check digit to the last digit in the credit card number |
9434578423 |
The credit card number is valid when the check digit and the last digit in the credit card number are equal.
The following valid credit card numbers can be used for testing:
1111111118
2222222225
4111313135
2234321326
Note:
The “%” is the mathematical operator used to get the remainder.
Examples:
10 % 5 = 0, there is no remainder
10 % 3 = 1, there is a remainder of 1