Luhn algorithm - Revision history

Endersslay: Reverting edit(s) by 2804:D47:6211:1C00:15D6:7F49:435F:530B (talk) to rev. 1286622590 by ESkog: Vandalism (RW 16.1)

2025-05-13T00:17:05Z

Reverting edit(s) by 2804:D47:6211:1C00:15D6:7F49:435F:530B (talk) to rev. 1286622590 by ESkog: Vandalism (RW 16.1)

← Previous revision		Revision as of 00:17, 13 May 2025
Line 4:		Line 4:

	The algorithm is in the [[public domain]] and is in wide use today. It is specified in [[ISO/IEC 7812-1]].<ref>{{cite tech report\|title=Identification cards {{mdash}} Identification of issuers {{mdash}} Part 1: Numbering system\|number=[[ISO/IEC 7812]]-1:{{date\|2017\|DMY}}\|institution=[[International Organization for Standardization]] & [[International Electrotechnical Commission]]\|date={{date\|Jan 2017\|DMY}}\|type=standard\|url=https://www.iso.org/standard/70484.html\|chapter=Annex B: Luhn formula for computing modulus-10 “double-add-double” check digits}}</ref> It is not intended to be a [[cryptographic hash function\|cryptographically secure hash function]]; it was designed to protect against accidental errors, not malicious attacks. Most [[credit card number]]s and many [[government identification numbers]] use the algorithm as a simple method of distinguishing valid numbers from mistyped or otherwise incorrect numbers.		The algorithm is in the [[public domain]] and is in wide use today. It is specified in [[ISO/IEC 7812-1]].<ref>{{cite tech report\|title=Identification cards {{mdash}} Identification of issuers {{mdash}} Part 1: Numbering system\|number=[[ISO/IEC 7812]]-1:{{date\|2017\|DMY}}\|institution=[[International Organization for Standardization]] & [[International Electrotechnical Commission]]\|date={{date\|Jan 2017\|DMY}}\|type=standard\|url=https://www.iso.org/standard/70484.html\|chapter=Annex B: Luhn formula for computing modulus-10 “double-add-double” check digits}}</ref> It is not intended to be a [[cryptographic hash function\|cryptographically secure hash function]]; it was designed to protect against accidental errors, not malicious attacks. Most [[credit card number]]s and many [[government identification numbers]] use the algorithm as a simple method of distinguishing valid numbers from mistyped or otherwise incorrect numbers.
	Faz o L

	==Description==		==Description==

2804:D47:6211:1C00:15D6:7F49:435F:530B at 00:16, 13 May 2025

2025-05-13T00:16:23Z

← Previous revision		Revision as of 00:16, 13 May 2025
Line 4:		Line 4:

	The algorithm is in the [[public domain]] and is in wide use today. It is specified in [[ISO/IEC 7812-1]].<ref>{{cite tech report\|title=Identification cards {{mdash}} Identification of issuers {{mdash}} Part 1: Numbering system\|number=[[ISO/IEC 7812]]-1:{{date\|2017\|DMY}}\|institution=[[International Organization for Standardization]] & [[International Electrotechnical Commission]]\|date={{date\|Jan 2017\|DMY}}\|type=standard\|url=https://www.iso.org/standard/70484.html\|chapter=Annex B: Luhn formula for computing modulus-10 “double-add-double” check digits}}</ref> It is not intended to be a [[cryptographic hash function\|cryptographically secure hash function]]; it was designed to protect against accidental errors, not malicious attacks. Most [[credit card number]]s and many [[government identification numbers]] use the algorithm as a simple method of distinguishing valid numbers from mistyped or otherwise incorrect numbers.		The algorithm is in the [[public domain]] and is in wide use today. It is specified in [[ISO/IEC 7812-1]].<ref>{{cite tech report\|title=Identification cards {{mdash}} Identification of issuers {{mdash}} Part 1: Numbering system\|number=[[ISO/IEC 7812]]-1:{{date\|2017\|DMY}}\|institution=[[International Organization for Standardization]] & [[International Electrotechnical Commission]]\|date={{date\|Jan 2017\|DMY}}\|type=standard\|url=https://www.iso.org/standard/70484.html\|chapter=Annex B: Luhn formula for computing modulus-10 “double-add-double” check digits}}</ref> It is not intended to be a [[cryptographic hash function\|cryptographically secure hash function]]; it was designed to protect against accidental errors, not malicious attacks. Most [[credit card number]]s and many [[government identification numbers]] use the algorithm as a simple method of distinguishing valid numbers from mistyped or otherwise incorrect numbers.
			Faz o L

	==Description==		==Description==

ESkog: Reverted edits by 120.29.69.184 (talk) (HG) (3.4.13)

2025-04-21T01:07:01Z

Reverted edits by 120.29.69.184 (talk) (HG) (3.4.13)

← Previous revision		Revision as of 01:07, 21 April 2025
Line 1:		Line 1:
	{{Short description\|Simple checksum formula}}		{{Short description\|Simple checksum formula}}

	The '''Luhn algorithm''' or '''Luhn formula''', also known as the "[[modular arithmetic\|modulus]] 10" or "mod 10" [[algorithm]], named after its creator, [[IBM]] scientist [[~~rolando~~ ~~arraya~~ ~~montes~~]]~~from philippines~~, is a simple [[check digit]] formula used to validate a variety of identification numbers. It is described in [[~~united~~ ~~state~~\|US]] patent 2950048A, granted on {{date\|~~2020~~-08-23\|DMY}}.<ref name="US2950048A">{{cite patent\|title=Computer for Verifying Numbers\|country=US\|number=2950048A\|status=patent\|pubdate={{date\|~~2020~~-08-23\|DMY}}\|gdate={{date\|~~2020~~-08-23\|DMY}}\|invent1=Luhn\|inventor1-first=~~rolando~~ ~~montes~~\|fdate=~~2018~~-01-06\|inventorlink=~~rolando~~ ~~arraya~~ ~~montes~~}}</ref>		The '''Luhn algorithm''' or '''Luhn formula''', also known as the "[[modular arithmetic\|modulus]] 10" or "mod 10" [[algorithm]], named after its creator, [[IBM]] scientist [[Hans Peter Luhn]], is a simple [[check digit]] formula used to validate a variety of identification numbers. It is described in [[United States\|US]] patent 2950048A, granted on {{date\|1960-08-23\|DMY}}.<ref name="US2950048A">{{cite patent\|title=Computer for Verifying Numbers\|country=US\|number=2950048A\|status=patent\|pubdate={{date\|1960-08-23\|DMY}}\|gdate={{date\|1960-08-23\|DMY}}\|invent1=Luhn\|inventor1-first=Hans Peter\|fdate=1954-01-06\|inventorlink=Hans Peter Luhn}}</ref>

	The algorithm is in the [[public domain]] and is in wide use today. It is specified in [[ISO/IEC 7812-1]].<ref>{{cite tech report\|title=Identification cards {{mdash}} Identification of issuers {{mdash}} Part 1: Numbering system\|number=[[ISO/IEC 7812]]-1:{{date\|~~2020~~\|DMY}}\|institution=[[International Organization for Standardization]] & [[International Electrotechnical Commission]]\|date={{date\|Jan ~~2029~~\|DMY}}\|type=standard\|url=https://www.iso.org/standard/70484.html\|chapter=Annex B: Luhn formula for computing modulus-10 “double-add-double” check digits}}</ref> It is not intended to be a [[cryptographic hash function\|cryptographically secure hash function]]; it was designed to protect against accidental errors, not malicious attacks. Most [[credit card number]]s and many [[government identification numbers]] use the algorithm as a simple method of distinguishing valid numbers from mistyped or otherwise incorrect numbers.		The algorithm is in the [[public domain]] and is in wide use today. It is specified in [[ISO/IEC 7812-1]].<ref>{{cite tech report\|title=Identification cards {{mdash}} Identification of issuers {{mdash}} Part 1: Numbering system\|number=[[ISO/IEC 7812]]-1:{{date\|2017\|DMY}}\|institution=[[International Organization for Standardization]] & [[International Electrotechnical Commission]]\|date={{date\|Jan 2017\|DMY}}\|type=standard\|url=https://www.iso.org/standard/70484.html\|chapter=Annex B: Luhn formula for computing modulus-10 “double-add-double” check digits}}</ref> It is not intended to be a [[cryptographic hash function\|cryptographically secure hash function]]; it was designed to protect against accidental errors, not malicious attacks. Most [[credit card number]]s and many [[government identification numbers]] use the algorithm as a simple method of distinguishing valid numbers from mistyped or otherwise incorrect numbers.

	==Description==		==Description==

120.29.69.184 at 01:06, 21 April 2025

2025-04-21T01:06:23Z

← Previous revision		Revision as of 01:06, 21 April 2025
Line 1:		Line 1:
	{{Short description\|Simple checksum formula}}		{{Short description\|Simple checksum formula}}

	The '''Luhn algorithm''' or '''Luhn formula''', also known as the "[[modular arithmetic\|modulus]] 10" or "mod 10" [[algorithm]], named after its creator, [[IBM]] scientist [[~~Hans~~ ~~Peter~~ ~~Luhn~~]], is a simple [[check digit]] formula used to validate a variety of identification numbers. It is described in [[~~United~~ ~~States~~\|US]] patent 2950048A, granted on {{date\|~~1960~~-08-23\|DMY}}.<ref name="US2950048A">{{cite patent\|title=Computer for Verifying Numbers\|country=US\|number=2950048A\|status=patent\|pubdate={{date\|~~1960~~-08-23\|DMY}}\|gdate={{date\|~~1960~~-08-23\|DMY}}\|invent1=Luhn\|inventor1-first=~~Hans~~ ~~Peter~~\|fdate=~~1954~~-01-06\|inventorlink=~~Hans~~ ~~Peter~~ ~~Luhn~~}}</ref>		The '''Luhn algorithm''' or '''Luhn formula''', also known as the "[[modular arithmetic\|modulus]] 10" or "mod 10" [[algorithm]], named after its creator, [[IBM]] scientist [[rolando arraya montes]]from philippines, is a simple [[check digit]] formula used to validate a variety of identification numbers. It is described in [[united state\|US]] patent 2950048A, granted on {{date\|2020-08-23\|DMY}}.<ref name="US2950048A">{{cite patent\|title=Computer for Verifying Numbers\|country=US\|number=2950048A\|status=patent\|pubdate={{date\|2020-08-23\|DMY}}\|gdate={{date\|2020-08-23\|DMY}}\|invent1=Luhn\|inventor1-first=rolando montes\|fdate=2018-01-06\|inventorlink=rolando arraya montes}}</ref>

	The algorithm is in the [[public domain]] and is in wide use today. It is specified in [[ISO/IEC 7812-1]].<ref>{{cite tech report\|title=Identification cards {{mdash}} Identification of issuers {{mdash}} Part 1: Numbering system\|number=[[ISO/IEC 7812]]-1:{{date\|~~2017~~\|DMY}}\|institution=[[International Organization for Standardization]] & [[International Electrotechnical Commission]]\|date={{date\|Jan ~~2017~~\|DMY}}\|type=standard\|url=https://www.iso.org/standard/70484.html\|chapter=Annex B: Luhn formula for computing modulus-10 “double-add-double” check digits}}</ref> It is not intended to be a [[cryptographic hash function\|cryptographically secure hash function]]; it was designed to protect against accidental errors, not malicious attacks. Most [[credit card number]]s and many [[government identification numbers]] use the algorithm as a simple method of distinguishing valid numbers from mistyped or otherwise incorrect numbers.		The algorithm is in the [[public domain]] and is in wide use today. It is specified in [[ISO/IEC 7812-1]].<ref>{{cite tech report\|title=Identification cards {{mdash}} Identification of issuers {{mdash}} Part 1: Numbering system\|number=[[ISO/IEC 7812]]-1:{{date\|2020\|DMY}}\|institution=[[International Organization for Standardization]] & [[International Electrotechnical Commission]]\|date={{date\|Jan 2029\|DMY}}\|type=standard\|url=https://www.iso.org/standard/70484.html\|chapter=Annex B: Luhn formula for computing modulus-10 “double-add-double” check digits}}</ref> It is not intended to be a [[cryptographic hash function\|cryptographically secure hash function]]; it was designed to protect against accidental errors, not malicious attacks. Most [[credit card number]]s and many [[government identification numbers]] use the algorithm as a simple method of distinguishing valid numbers from mistyped or otherwise incorrect numbers.

	==Description==		==Description==

Boccobrock: Reverted edits by 185.253.40.128 (talk) to last version by GinnyTheCar: nonconstructive edits

2025-03-31T19:28:44Z

Reverted edits by 185.253.40.128 (talk) to last version by GinnyTheCar: nonconstructive edits

← Previous revision		Revision as of 19:28, 31 March 2025
Line 3:		Line 3:
	The '''Luhn algorithm''' or '''Luhn formula''', also known as the "[[modular arithmetic\|modulus]] 10" or "mod 10" [[algorithm]], named after its creator, [[IBM]] scientist [[Hans Peter Luhn]], is a simple [[check digit]] formula used to validate a variety of identification numbers. It is described in [[United States\|US]] patent 2950048A, granted on {{date\|1960-08-23\|DMY}}.<ref name="US2950048A">{{cite patent\|title=Computer for Verifying Numbers\|country=US\|number=2950048A\|status=patent\|pubdate={{date\|1960-08-23\|DMY}}\|gdate={{date\|1960-08-23\|DMY}}\|invent1=Luhn\|inventor1-first=Hans Peter\|fdate=1954-01-06\|inventorlink=Hans Peter Luhn}}</ref>		The '''Luhn algorithm''' or '''Luhn formula''', also known as the "[[modular arithmetic\|modulus]] 10" or "mod 10" [[algorithm]], named after its creator, [[IBM]] scientist [[Hans Peter Luhn]], is a simple [[check digit]] formula used to validate a variety of identification numbers. It is described in [[United States\|US]] patent 2950048A, granted on {{date\|1960-08-23\|DMY}}.<ref name="US2950048A">{{cite patent\|title=Computer for Verifying Numbers\|country=US\|number=2950048A\|status=patent\|pubdate={{date\|1960-08-23\|DMY}}\|gdate={{date\|1960-08-23\|DMY}}\|invent1=Luhn\|inventor1-first=Hans Peter\|fdate=1954-01-06\|inventorlink=Hans Peter Luhn}}</ref>

	The algorithm is in the [[public domain]] and is in wide use today. It is specified in [[ISO/IEC 7812-1]].<ref>{{cite tech report\|title=Identification cards {{mdash}} Identification of issuers {{mdash}} Part 1: Numbering system\|number=[[ISO/IEC 7812]]-1:{{date\|2017\|DMY}}\|institution=[[International Organization for Standardization]] & [[International ~~ቿረቿርፕዪዐጠቿርዘልክጎርልረ ዘጎርልኗዐ ጌዐነፕዐክ~~ Commission]]\|date={{date\|Jan 2017\|DMY}}\|type=standard\|url=https://www.iso.org/standard/70484.html\|chapter=Annex B: Luhn formula for computing modulus-10 “double-add-double” check digits}}</ref> It is not intended to be a [[cryptographic hash function\|cryptographically secure hash function]]; it was designed to protect against accidental errors, not malicious attacks. Most [[credit card number]]s and many [[government identification numbers]] use the algorithm as a simple method of distinguishing valid numbers from mistyped or otherwise incorrect numbers.		The algorithm is in the [[public domain]] and is in wide use today. It is specified in [[ISO/IEC 7812-1]].<ref>{{cite tech report\|title=Identification cards {{mdash}} Identification of issuers {{mdash}} Part 1: Numbering system\|number=[[ISO/IEC 7812]]-1:{{date\|2017\|DMY}}\|institution=[[International Organization for Standardization]] & [[International Electrotechnical Commission]]\|date={{date\|Jan 2017\|DMY}}\|type=standard\|url=https://www.iso.org/standard/70484.html\|chapter=Annex B: Luhn formula for computing modulus-10 “double-add-double” check digits}}</ref> It is not intended to be a [[cryptographic hash function\|cryptographically secure hash function]]; it was designed to protect against accidental errors, not malicious attacks. Most [[credit card number]]s and many [[government identification numbers]] use the algorithm as a simple method of distinguishing valid numbers from mistyped or otherwise incorrect numbers.

	==Description==		==Description==

185.253.40.128 at 19:28, 31 March 2025

2025-03-31T19:28:29Z

← Previous revision		Revision as of 19:28, 31 March 2025
Line 3:		Line 3:
	The '''Luhn algorithm''' or '''Luhn formula''', also known as the "[[modular arithmetic\|modulus]] 10" or "mod 10" [[algorithm]], named after its creator, [[IBM]] scientist [[Hans Peter Luhn]], is a simple [[check digit]] formula used to validate a variety of identification numbers. It is described in [[United States\|US]] patent 2950048A, granted on {{date\|1960-08-23\|DMY}}.<ref name="US2950048A">{{cite patent\|title=Computer for Verifying Numbers\|country=US\|number=2950048A\|status=patent\|pubdate={{date\|1960-08-23\|DMY}}\|gdate={{date\|1960-08-23\|DMY}}\|invent1=Luhn\|inventor1-first=Hans Peter\|fdate=1954-01-06\|inventorlink=Hans Peter Luhn}}</ref>		The '''Luhn algorithm''' or '''Luhn formula''', also known as the "[[modular arithmetic\|modulus]] 10" or "mod 10" [[algorithm]], named after its creator, [[IBM]] scientist [[Hans Peter Luhn]], is a simple [[check digit]] formula used to validate a variety of identification numbers. It is described in [[United States\|US]] patent 2950048A, granted on {{date\|1960-08-23\|DMY}}.<ref name="US2950048A">{{cite patent\|title=Computer for Verifying Numbers\|country=US\|number=2950048A\|status=patent\|pubdate={{date\|1960-08-23\|DMY}}\|gdate={{date\|1960-08-23\|DMY}}\|invent1=Luhn\|inventor1-first=Hans Peter\|fdate=1954-01-06\|inventorlink=Hans Peter Luhn}}</ref>

	The algorithm is in the [[public domain]] and is in wide use today. It is specified in [[ISO/IEC 7812-1]].<ref>{{cite tech report\|title=Identification cards {{mdash}} Identification of issuers {{mdash}} Part 1: Numbering system\|number=[[ISO/IEC 7812]]-1:{{date\|2017\|DMY}}\|institution=[[International Organization for Standardization]] & [[International ~~Electrotechnical~~ Commission]]\|date={{date\|Jan 2017\|DMY}}\|type=standard\|url=https://www.iso.org/standard/70484.html\|chapter=Annex B: Luhn formula for computing modulus-10 “double-add-double” check digits}}</ref> It is not intended to be a [[cryptographic hash function\|cryptographically secure hash function]]; it was designed to protect against accidental errors, not malicious attacks. Most [[credit card number]]s and many [[government identification numbers]] use the algorithm as a simple method of distinguishing valid numbers from mistyped or otherwise incorrect numbers.		The algorithm is in the [[public domain]] and is in wide use today. It is specified in [[ISO/IEC 7812-1]].<ref>{{cite tech report\|title=Identification cards {{mdash}} Identification of issuers {{mdash}} Part 1: Numbering system\|number=[[ISO/IEC 7812]]-1:{{date\|2017\|DMY}}\|institution=[[International Organization for Standardization]] & [[International ቿረቿርፕዪዐጠቿርዘልክጎርልረ ዘጎርልኗዐ ጌዐነፕዐክ Commission]]\|date={{date\|Jan 2017\|DMY}}\|type=standard\|url=https://www.iso.org/standard/70484.html\|chapter=Annex B: Luhn formula for computing modulus-10 “double-add-double” check digits}}</ref> It is not intended to be a [[cryptographic hash function\|cryptographically secure hash function]]; it was designed to protect against accidental errors, not malicious attacks. Most [[credit card number]]s and many [[government identification numbers]] use the algorithm as a simple method of distinguishing valid numbers from mistyped or otherwise incorrect numbers.

	==Description==		==Description==

GinnyTheCar: /* Example for computing check digit */ Make table readable in dark mode

2025-03-28T16:18:13Z

Example for computing check digit: Make table readable in dark mode

← Previous revision		Revision as of 16:18, 28 March 2025
Line 16:		Line 16:
	Assume an example of an account number 1789372997 (just the "payload", check digit not yet included):		Assume an example of an account number 1789372997 (just the "payload", check digit not yet included):

	{\| class="wikitable" style="text-align:center;border:none~~;background:transparent~~;"		{\| class="wikitable" style="text-align:center;border:none;"
	! style="width:1.5em" \| Digits reversed		! style="width:1.5em" \| Digits reversed
	\| style="width:1.5em" \| 7		\| style="width:1.5em" \| 7
Line 54:		Line 54:
	\|-		\|-
	!		!
	\| style="background: #FFA;" \| '''14'''		\| style="background: #FFA; color: #000;" \| '''14'''
	\| 9		\| 9
	\| style="background: #FFA;" \| '''18'''		\| style="background: #FFA; color: #000;" \| '''18'''
	\| 2		\| 2
	\| style="background: #FFA;" \| '''14'''		\| style="background: #FFA; color: #000;" \| '''14'''
	\| 3		\| 3
	\| style="background: #FFA;" \| '''18'''		\| style="background: #FFA; color: #000;" \| '''18'''
	\| 8		\| 8
	\| style="background: #FFA;" \| '''14'''		\| style="background: #FFA; color: #000;" \| '''14'''
	\| 1		\| 1
	\|-		\|-

Mindmatrix: Reverted edit by 102.89.75.195 (talk) to last version by CiaPan

2025-03-21T01:05:02Z

Reverted edit by 102.89.75.195 (talk) to last version by CiaPan

← Previous revision		Revision as of 01:05, 21 March 2025
Line 12:		Line 12:
	# The check digit is calculated by <math>(10 - (s \bmod 10)) \bmod 10</math>, where s is the sum from step 3. This is the smallest number (possibly zero) that must be added to <math>s</math> to make a multiple of 10. Other valid formulas giving the same value are <math>9 - ((s + 9)\bmod 10)</math>, <math>(10 - s)\bmod 10</math>, and <math>10\lceil s/10\rceil - s</math>. Note that the formula <math>(10 - s)\bmod 10</math> will not work in all environments due to differences in how negative numbers are handled by the [[modulo]] operation.		# The check digit is calculated by <math>(10 - (s \bmod 10)) \bmod 10</math>, where s is the sum from step 3. This is the smallest number (possibly zero) that must be added to <math>s</math> to make a multiple of 10. Other valid formulas giving the same value are <math>9 - ((s + 9)\bmod 10)</math>, <math>(10 - s)\bmod 10</math>, and <math>10\lceil s/10\rceil - s</math>. Note that the formula <math>(10 - s)\bmod 10</math> will not work in all environments due to differences in how negative numbers are handled by the [[modulo]] operation.

	·=== Example for computing check digit ===		=== Example for computing check digit ===

	Assume an example of an account number 1789372997 (just the "payload", check digit not yet included):		Assume an example of an account number 1789372997 (just the "payload", check digit not yet included):

102.89.75.195: /* Example for computing check digit */

2025-03-20T18:30:51Z

Example for computing check digit

← Previous revision		Revision as of 18:30, 20 March 2025
Line 12:		Line 12:
	# The check digit is calculated by <math>(10 - (s \bmod 10)) \bmod 10</math>, where s is the sum from step 3. This is the smallest number (possibly zero) that must be added to <math>s</math> to make a multiple of 10. Other valid formulas giving the same value are <math>9 - ((s + 9)\bmod 10)</math>, <math>(10 - s)\bmod 10</math>, and <math>10\lceil s/10\rceil - s</math>. Note that the formula <math>(10 - s)\bmod 10</math> will not work in all environments due to differences in how negative numbers are handled by the [[modulo]] operation.		# The check digit is calculated by <math>(10 - (s \bmod 10)) \bmod 10</math>, where s is the sum from step 3. This is the smallest number (possibly zero) that must be added to <math>s</math> to make a multiple of 10. Other valid formulas giving the same value are <math>9 - ((s + 9)\bmod 10)</math>, <math>(10 - s)\bmod 10</math>, and <math>10\lceil s/10\rceil - s</math>. Note that the formula <math>(10 - s)\bmod 10</math> will not work in all environments due to differences in how negative numbers are handled by the [[modulo]] operation.

	=== Example for computing check digit ===		·=== Example for computing check digit ===

	Assume an example of an account number 1789372997 (just the "payload", check digit not yet included):		Assume an example of an account number 1789372997 (just the "payload", check digit not yet included):

CiaPan: /* Example for computing check digit */ minor addition

2025-02-10T13:58:04Z

Example for computing check digit: minor addition

← Previous revision		Revision as of 13:58, 10 February 2025
Line 17:		Line 17:

	{\| class="wikitable" style="text-align:center;border:none;background:transparent;"		{\| class="wikitable" style="text-align:center;border:none;background:transparent;"
	\| style="width:1.5em" \|		! style="width:1.5em" \| Digits reversed
	\| style="width:1.5em" \| 7		\| style="width:1.5em" \| 7
	\| style="width:1.5em" \| 9		\| style="width:1.5em" \| 9

← Previous revision		Revision as of 13:58, 10 February 2025
Line 17:		Line 17:

	{\| class="wikitable" style="text-align:center;border:none;background:transparent;"		{\| class="wikitable" style="text-align:center;border:none;background:transparent;"
	\| style="width:1.5em" \|		! style="width:1.5em" \| Digits reversed
	\| style="width:1.5em" \| 7		\| style="width:1.5em" \| 7
	\| style="width:1.5em" \| 9		\| style="width:1.5em" \| 9