|
View previous topic :: View next topic
|
| Author |
Message |
Gabriel Araujo Alves
New User
Joined: 20 Jul 2010
Posts: 38
Location: Brazil
|
|
|
|
Hi,
have any way to find the digit using mod10 algorithm ? |
|
| Back to top |
|
 |
dick scherrer
Moderator Emeritus
Joined: 23 Nov 2006
Posts: 19244
Location: Inside the Matrix
|
|
|
|
Hello,
Which digit?
You need to make sure you ask complete questions (with explanations if necessary).
Not everyone will know what you are thinking. |
|
| Back to top |
|
|
Robert Sample
Global Moderator
Joined: 06 Jun 2008
Posts: 8692
Location: Dubuque, Iowa, USA
|
|
|
|
You posted in the JCL section of this forum. JCL does only one thing -- it executes programs. The programs might be COBOL, PL/I, assembler, C, Perl, or a system utiltiy such as IDCAMS, SORT, or IEBGENER, but all JCL can do is execute programs.
As Dick said, you need to explain more. Which language are you implementing the mod 10 algorithm in? Which digit are you looking for -- the checksum? the first digit? the ninth digit? Are you looking for an existing implementation of mod 10, or are you planning on writing one? |
|
| Back to top |
|
|
enrico-sorichetti
Superior Member
Joined: 14 Mar 2007
Posts: 10863
Location: italy
|
|
|
|
| Quote: |
| have any way to find the digit using mod10 algorithm ? |
if the description of the algorithm is available nothing prevents You from implementing it!
where are You having problems ... the logic or the coding ??
but wiser to use a better posting style,
You just asked a YES/NO question, and suche questions usually receive YES/NO answers, technically correct, but pretty useless. |
|
| Back to top |
|
|
|
|
