| 摘要 |
PROBLEM TO BE SOLVED: To prevent forgery of a ticket like pari-mutuel ticket and to prevent the third person who has found a winning ticket from wrongfully converting it into money. SOLUTION: There is only one correct combination between ticket data printed on a ticket 10 issued by a ticket forgery preventing system 12 and peculiar discrimination data, and it is stored in a storage device 22, and it is discriminated whether the combination between ticket data of the issued ticket 10 and peculiar discrimination data is correct or not at the time of conversion into money. Thus forgery is found soon though a person tries to convert the ticket 10, which is forged by combining proper peculiar discrimination data with a winning number, into money. A purchaser of the ticket 10 divides the ticket 10 in two by a perforated line and preserves a piece of paper 10A of ticket data and a piece of paper 10B of peculiar discrimination data independently of each other. Consequently, though the purchaser has lost the piece of paper of ticket data or has had it stolen, wrong conversion into money is found because of the absence of the other piece of paper of peculiar discrimination data when the third person who has found or stolen it tries to convert it into money. |
