Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

(Financial: credit card number validation) Credit card numbers follow certain pa

ID: 3531080 • Letter: #

Question

(Financial: credit card number validation) Credit card numbers follow certain pat- terns. A credit card number must have between 13 and 16 digits. It must start with: ? 4 for Visacards ? 5 for Mastercards ? 37 for AmericanExpresscards ? 6 for Discovercards In 1954, Hans Luhn of IBM proposed an algorithm for validating credit card num- bers. The algorithm is useful to determine whether a card number is entered cor- rectly or whether a credit card is scanned correctly by a scanner. Credit card numbers are generated following this validity check, commonly known as the Luhn check or the Mod 10 check, which can be described as follows (for illustra- tion, consider the card number 4388576018402626): 1. Double every second digit from right to left. If doubling of a digit results in a two-digit number, add up the two digits to get a single-digit number. ?4388576018402626 ?2*2 = 4 2*2 = 4 4*2 = 8 1*2 = 2 6 * 2 = 12 5 * 2 = 10 8 * 2 = 16 4*2 = 8 (1 + 2 = 3) (1 + 0 = 1) (1 + 6 = 7) 2. Now add all single-digit numbers from Step 1. 4 + 4 + 8 + 2 + 3 + 1 + 7 + 8 = 37 3. Add all digits in the odd places from right to left in the card number. 6 + 6 + 0 + 8 + 0 + 7 + 8 + 3 = 38 4. Sum the results from Step 2 and Step 3. 37 + 38 = 75 5. If the result from Step 4 is divisible by 10, the card number is valid; otherwise, it is invalid. For example, the number 4388576018402626 is invalid, but the number 4388576018410707 is valid. ******Write a program that prompts the user to enter a credit card number as a long integer. Display whether the number is valid or invalid. Design your program to use the following methods:********** /** Return true if the card number is valid */ public static boolean isValid(long number) /** Get the result from Step 2 */ public static int sumOfDoubleEvenPlace(long number) /** Return this number if it is a single digit, otherwise, * return the sum of the two digits */ public static int getDigit(int number) /** Return sum of odd-place digits in number */ public static int sumOfOddPlace(long number) /** Return true if the digit d is a prefix for number */ public static boolean prefixMatched(long number, int d) /** Return the number of digits in d */ public static int getSize(long d) /** Return the first k number of digits from number. If the * number of digits in number is less than k, return number. */ public static long getPrefix(long number, int k) Here are sample runs of the program: ?Enter a credit card number as a long integer: 4388576018410707 4388576018410707 is valid ?Enter a credit card number as a long integer: 4388576018402626 4388576018402626 is invalid

Explanation / Answer


Related Questions

(Figure 1) represents the motion of a mass on a spring. 1.What is the amplitude
Question #1295971
(Figure 1) shows a 1.0-cm-diameter loop with R = 0.50 inside a 2.0-cm-diameter s
Question #3164197
(Figure 1) shows a 17-cm-diameter loop in three different magnetic fields. The l
Question #1554831
(Figure 1) shows a 17-cm-diameter loop in three different magnetic fields. The l
Question #1603413
(Figure 1) shows a circuit with an area of 0.050 m containing a R 1.0 2 resistor
Question #2036677
(Figure 1) shows a friend standing on the roof of a building that is 51.8 m tall
Question #1286441
(Figure 1) shows a friend standing on the roof of a building that is 51.8 m tall
Question #1489182
(Figure 1) shows a long, straight current-carrying wire running perpendicular to
Question #1374116

Navigate

Previous
(Financial tsunami) Banks lend money to each olher. In lough economic times, if
Next
(Financial: credit card number validation) in C++ Credit card numbers follow cer

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.