subject

The luhn-10 algorithm is a weighted algorithm. each digit in the credit card number is multiplied by a weight. these weights are then summed, forming the checksum. the checksum is divided by 10. if the remainder is 0, the credit card number is valid. if the remainder is not 0, the user made an error and can be prompted to re-enter their credit card data. the weighting for the luhn-10 algorithm is as follows: beginning with the first (ie leftmost) digit in the credit card, every other number is multiplied by 2. if the product results in a 2 digit number (eg 6 x 2 = 12) then the individual digits (eg 1 and 2) are added to the checksum. the remaining digits of the credit card number are simply added to the checksum. that is, their weight is 1.some examples are given below, but this algorithm will work with your visa or mastercard number. try it! write a method in java named luhnchecksum which takes an array of integers as an input parameter and returns the integer checksum computed by the above algorithm.

ansver
Answers: 1

Another question on Computers and Technology

question
Computers and Technology, 22.06.2019 03:30
Jessie has received a contract to build a real-time application for a baker. however, the baker doesn't want to invest too much money. his only requirement is that he wants the customers to know which cupcakes are available at what time and in what quantity. so his core requirement is that the details of product should be in real time. what platform can jessie use to develop this application?
Answers: 1
question
Computers and Technology, 22.06.2019 04:30
There is a simple pattern for determining if a binary number is odd. what is it and why does this pattern occur? how many bits would you need if you wanted to have the ability to count up to 1000? how high could you count in binary if you used all 10 of your fingers as bits? (finger up means 1, finger down means 0)
Answers: 3
question
Computers and Technology, 22.06.2019 10:10
3. bob is arguing that if you use output feedback (ofb) mode twice in a row to encrypt a long message, m, using the same key each time, it will be more secure. explain why bob is wrong, no matter what encryption algorithm he is using for block encryption (15 points).
Answers: 3
question
Computers and Technology, 23.06.2019 05:00
Acompany is inviting design for its new corporate logo from its users. this is an example of ? a. crowdfunding b. crowdvoting c. crowdsourced design d. crowdtracking
Answers: 3
You know the right answer?
The luhn-10 algorithm is a weighted algorithm. each digit in the credit card number is multiplied by...
Questions
question
Mathematics, 16.12.2019 18:31
Questions on the website: 13722367