KR100838468B1 - Cash-back terminal threrof cash-back service method - Google Patents

Abstract

The present invention is to implement a cache-back terminal for providing a cache-back service in real time for the products requested to be calculated by the customer and a method for providing a cache-back service using the same. To this end, an operation of the terminal for providing a cache-back service in real time corresponding to the payment amount is specifically disclosed. In addition, a concrete scheme for setting a cache-back mode for providing a cache-back service, a detailed scheme for setting a cache-back level by setting a final rank, and setting of the total number of winners by a single event are prepared. In addition, a detailed plan for setting up the number of winners by each rank and a specific plan for determining a winning amount, that is, a discounted amount, for each rank are prepared.

Earn Points, Cash-Back, Reward Plan, Cash-back Terminal, POS System

Description

Cache-back terminal and cache-back service method using the same {CASH-BACK TERMINAL THREROF CASH-BACK SERVICE METHOD}

1 is a diagram showing the configuration of a cache-back terminal according to an embodiment of the present invention.

2 is a diagram illustrating a control flow of a cache-back terminal according to an exemplary embodiment of the present invention.

3 is a diagram for conceptually explaining a method of determining an rank based on a purchase order in a cache-back service proposed in an embodiment of the present invention.

4 is a diagram illustrating an example of determining a discount amount for each rank by a cache-back service according to an exemplary embodiment of the present invention.

5 is a view showing an example of a cash-back receipt according to an embodiment of the present invention.

The present invention relates to a cache-back system and a cache-back method using the same, which cache-backs a certain percentage of the seller's profits to the buyer in real time.

With the rapid economic growth and changing consciousness, consumer's needs are diversifying year after year. According to the consumer's disposition, the retailers are also showing a variety of products.

However, it is true that small stores are rapidly decreasing due to the appearance of large discount stores such as large discount marts, home shopping, and internet shopping malls. In addition, the company is striving to secure fixed customers among large discount stores amid intense competition among vendors.

As a part of this, a certain point is given according to the purchase, if you earn more than a certain point, aka points earning card that pays a product or discount according to the accumulated points will be a typical example. In the case of such a credit card is widely used from small small stores to large discount stores.

However, membership is required to obtain certain points defined by the store. In addition, since a certain number of product purchases or a certain amount of product purchases must be made, it is quite difficult to collect points for most general floating customers who are not fixed customers. The reality is that most of them give up before their customers fill up their points.

In addition, as point-of-sale stores using the point card are becoming more common and customer needs are diversified, it is difficult to maintain fixed customers, unlike the early days when floating customers were established as fixed customers of the corresponding stores to collect points.

Referring to the above points, the general point earning card is no longer a differentiated sales strategy of the store, a more direct and efficient strategy is urgently required.

The present invention provides a cache-back terminal and a cache-back method using the same to apply the cache-back to the purchased goods in real time in order to satisfy the requirements as described above.

The present invention also provides a cache-back terminal and a cache-back method using the same, which calculates a discounted amount of a purchased product through an event at the time of paying the purchased product, and reflects the discounted amount of the purchased product.

In a first aspect for achieving the above, the present invention is a user interface unit for receiving the event information required for the cache-back service from the user, and the event information provided through the user interface unit as an input, Comprising a point payment method, the final ranking, the number of winners by each ranking, the total amount of winnings to calculate the winning amount corresponding to the input event information, and includes a control unit for calculating the final payment amount to reflect the calculated winning amount; And notifying the user of the final payment amount calculated by the control unit through the user interface unit, and the winning amount is calculated by a random number or a purchase order designated corresponding to the input of the event information. Propose a terminal.

In a second aspect to achieve the above, the present invention is the process of receiving the event information required for the cache-back service from the user, and when the event information is input, the predetermined point payment method, final ranking, rank number Calculating a winning amount corresponding to the input event information, calculating a final payment amount by reflecting the calculated winning amount, and calculating the final settlement amount And a step of notifying a user, wherein the winning amount is calculated by a random number or a purchase order designated corresponding to the input of the event information.

Hereinafter, an embodiment of the present invention will be described with reference to the accompanying drawings. DETAILED DESCRIPTION In the following detailed description, one exemplary embodiment of the present invention will be presented to accomplish the above technical problem. And other embodiments that can be presented with the present invention are replaced by the description in the configuration of the present invention.

The present invention is to implement a cache-back terminal for providing a cache-back service in real time for the products requested to be calculated by the customer and a method for providing a cache-back service using the same.

To this end, the operation of the terminal for providing the cache-back service in real time corresponding to the payment amount should be specifically disclosed. In addition, a concrete plan for setting a cache-back mode for providing a cache-back service, a detailed plan for setting a cache-back level by setting a final rank, and setting a total winning number by a single event should be prepared. In addition, a concrete plan for setting up the number of winners for each rank and a specific plan for determining a winning amount, that is, a discounted amount, for each rank must be prepared. In the following description, a detailed description of the aforementioned methods will be made.

Hereinafter, exemplary embodiments of the present invention will be described in detail with reference to the accompanying drawings.

1 illustrates a structure of a terminal providing a cache-back service according to an exemplary embodiment of the present invention.

Referring to FIG. 1, the user interface 112 receives event information for a cache-back service from a user. The event information provided through the user interface unit 112 includes information on setting point payment methods, final rankings, winning numbers by ranking, total winning amount, and selling items and selling amounts.

The controller 110 receives the event information provided through the user interface 112 and performs overall control for the cache-back service based on the event information. That is, the controller 110 calculates a winning amount corresponding to the input event information in consideration of a predetermined point payment method, final ranking, winning number of winning persons, and total winning amount. The final payment amount is calculated by reflecting the calculated winning amount, and the calculated final payment amount is output through the user interface unit 112. At this time, the controller 110 calculates a winning amount based on a random number or a purchase order designated corresponding to the input of the event information. A detailed method of calculating the winning amount by the controller 110 will be described later.

On the other hand, the control unit 110 selects and uses one of the methods of granting a one-time lottery opportunity by a predetermined amount and the method of granting the number of lottery opportunities set for each item as the point payment method. The controller 110 determines levels for paying the winning amount by setting the final rank, and the number of winners for each rank is calculated by one of multiples or random setting. In addition, the controller 110 determines the winning amount for each ranking by one of the methods of distributing the total winning amount at the same ratio or setting the ratio at an arbitrary ratio. And in the case of the method of granting one chance of drawing by the predetermined amount, the remaining amount after granting the chance of drawing may be added to the winning amount, and in the case of the method of granting the number of times of drawing set by the items, the same. You may also draw the item by item.

The memory unit 114 manages the winning amount in response to the user information included in the event information under the control of the controller 110. And in response to the request of the control unit 110 provides information about the winning history of the desired subscriber.

2 illustrates a control flow performed by a cache-back terminal for an embodiment of the present invention. The control flow shown in FIG. 2 may be adulterated by the operation of the controller constituting the cache-back terminal. In the following description, it should be noted that the description focuses on the operation performed in the controller.

2, in step 210, the controller monitors whether a cache-back mode setting is requested from a user through a user interface. The cache-back mode that may be requested by the user may be classified into a lottery mode for each bar code for lottery and a lottery mode for sales amount for lottery for a certain point. The lottery mode for each bar code is a method of setting points for each sale item and giving an opportunity for lottery for each sale item. The lottery mode for each sale amount is a method of designating the number of lotteries corresponding to the sale amount, and cash-backing the lottery amount obtained through the lottery as many times as the number of lotteries.

When the controller detects the cache-back mode setting request from the user, the controller performs a subroutine for setting the cache-back mode in step 212. The cache-back mode setting subroutine changes the previously set cache-back mode to a cache-back mode newly selected by the user. For example, if the user is requested to set the lottery mode by sales amount while the lottery mode by barcode is set as the existing cache-back mode, the cache-back mode is changed to the lottery mode by sales amount.

In step 214, the controller monitors whether a final rank setting is requested from the user through the user interface. The final ranking means the lowest ranking that can be won by drawing. When the final rank setting request is received by the user, the controller proceeds to step 216 to perform the final rank setting subroutine. For example, if 7 is input as the final ranking from the user, the controller sets the ranking that can be won through the drawing from 1st to 7th.

In step 218, the controller monitors whether the setting of the number of winners by rank is requested from the user through the user interface. The number of winners by ranking means the number of people who decide to win in response to each ranking determined above. When the setting request of the number of winners by rank is requested from the user, the controller performs a winner number setting subroutine for setting the number of winners by each rank in step 220.

The method for setting the winning number of people includes a setting method by multiples and a random setting method. The way to set the multiple is to set the winning number of the next ranking by the multiple of the winning number corresponding to the previous ranking. At this time, the drainage is selected by the user. That is, setting to 2, 3, 4, etc. is selected by the information provided from the user. If the user is requested to set the number of winners by double, the 1st is 1, the 2nd is 2, the 3rd is 4, the 4th is 8, the 5th is 16 and the 6th is 32 The winners will be 64. The winner will be 127.

On the other hand, the winning number can be arbitrarily set. For example, 1 may be set to 1, 2 to 5, 3 to 7, 4 to 10, 5 to 20, 6 to 50, and 7 to 60. Of course, the winning number for each rank should be set by the information provided from the user.

In step 222, the controller monitors whether the user is required to set a winnings for each rank through the user interface. The winnings for each ranking may be set by the same ratio for each ranking and may be set by any ratio. If the user is requested to set up a winnings for each rank, the controller performs a winnings setting subroutine in step 224.

If the user is requested to set the winnings by the same ratio for each rank, the controller divides the total winning amount by the lowest rank set previously and sets the share as the winnings for each rank. In this case, the remaining amount may be additionally given to the winnings corresponding to one of the set ranks.

Otherwise, if an arbitrary setting is requested by the user, the winnings for each ranking are set by distributing the total winnings by the ratio specified for each ranking. For example, the winning rate of the first prize is 10%, the winning of the second prize is 15%, the winning of the third prize is 15%, the winning of the fourth prize is 15%, the winning of the fifth prize is 15%, the winning of the sixth prize. 20%, 7 prizes, etc. can be set as the remainder. In this way, the total prize money will be distributed by the rate specified by each rank. If the number of winners and the winnings are determined by each ranking as described above, the winnings that can be distributed in case of winning each ranking will be determined.

The controller monitors whether a lottery event occurs in step 226. That is, it monitors whether a specific sale amount or a draw request is generated by a barcode. When the drawing event occurs, the controller performs a drawing event subroutine in step 228. The lottery event subroutine performs the lottery at the request of the user, determines the rank through the lottery, and calculates a winning amount corresponding to the determined rank. The final settlement amount is calculated in consideration of the calculated winning amount, and the consumer is billed for the calculated settlement amount. Of course, if it is not an immediate payment method, only the winnings are notified to the consumer, and can be managed as a cash-back point corresponding to the consumer until a separate request is made.

In performing the lottery subroutine, the controller should consider the parameters set above. That is, the winning amount should be calculated in consideration of the preset cache-back mode, the ranking information, the winning number information and the winning information for each ranking. On the other hand, the lottery event subroutine may occur when the payment request for the sale amount or may occur at the time of order. This can also be determined by the user's settings.

Hereinafter, the operation of the present invention described above will be described by applying an actual example. The following description will be made for each cache-back mode.

First, referring to the lottery mode for each bar code, a point of an item having a sales amount of 3,000 won is set to 1,000 won. In other words, if you sell an item that costs 3,000 won, the cash-back amount is set to 1,000 won. It is assumed that the final rank is set to 7 and the winning number is set to 2 times for each rank. The number of winners will be determined by each ranking from 1st to 7th. In other words, 1st Prize, 2nd Prize, 2nd Prize, 3rd Prize, 4th Prize, 8th Prize, 8th Prize, 5th Prize 16, 32th Prize, 7th Prize 64, 127 people. In this case, the 127 are the total number of people who can win by one event. If there are 127 winners, a new event will start and draw another 127 winners.

And if the same percentage of winnings were set for each rank, the total winnings would be allocated for each rank by a ratio of 14.28% divided by 100. In other words, the amount equivalent to 14.28% of the total winnings will be the winning prize for each rank. If you calculate this amount, the total winnings will be 127,000 won by the product of the total winnings of 127, 1,000 won, and 18,142 won divided by 7 divided by 127,000 won is the winning prize for each rank.

The amount cashed back to the customer who wins each ranking, that is, the winnings, is calculated by the share of the winnings calculated for each ranking by the number of winners of each ranking. In other words, if you win the second place, the final prize is 9,071 won divided by 18,142 won.

In this case, the ranking determination may include a random number scheme and a sales sequence scheme. In the case of random numbers, the equal number is determined by a number generated by any random number generation algorithm among 1 to 127. For example, if 63 is a random number, the winning rank is sixth. Otherwise, it may be possible to use the generated random number to determine the equal number through additional drawing. In this case, the same random number should not be selected more than once. That is, the random number generation algorithm must be implemented so that the same random number does not occur. Alternatively, in case of sales order, the rank may be determined by assuming the sales order is a random number in the previous example.

Next, referring to the lottery mode for each sales amount, a point corresponding to the sales amount is set. The point set at this time will be set separately from the winning rank. For example, the point is set in 12 stages, and the sales amount criteria are set in each stage. In other words, the first stage is 100,000 won, the second stage is 50,000 won, the third stage is 40,000 won, the fourth stage is 30,000 won, the fifth stage is 20,000 won, the sixth stage is 10,000 won, the seventh stage is 5,000 won, the eighth stage is 4,000 won, 9 The stage can be set to 3,000 won, the ten stage to 2,000 won, the eleventh stage to 1,000 won, and the twelve stage to 500 won. If the sales amount is 275,500 won, two lottery opportunities corresponding to stage 1 are granted, one lottery opportunity corresponding to stage 2, one lottery opportunity corresponding to stage 5, and one corresponding to stage 7 Give one chance of drawing and one chance of drawing in 12 levels.

It is assumed that the final rank is set to 7 and the winning number is set to 2 times for each rank. The number of winners will be determined by each ranking from 1st to 7th. In other words, 1st Prize, 2nd Prize, 2nd Prize, 3rd Prize, 4th Prize, 8th Prize, 8th Prize, 5th Prize 16, 32th Prize, 7th Prize 64, 127 people. In this case, the 127 are the total number of people who can win by one event. If there are 127 winners, a new event will start and draw another 127 winners. Determination of the final ranking and the winning number can be set differently for each point. In the present invention, it should be noted that only the examples that are applied equally for convenience of description.

And if the same percentage of winnings were set for each rank, the total winnings would be allocated for each rank by a ratio of 14.28% divided by 100. In other words, the amount equivalent to 14.28% of the total winnings will be the winning prize for each rank. If you calculate this amount, the total winnings will be 127,000 won by the product of the total winnings of 127, 1,000 won, and 18,142 won divided by 7 divided by 127,000 won is the winning prize for each rank.

The amount cashed back to the customer who wins each ranking, that is, the winnings, is calculated by the share of the winnings calculated for each ranking by the number of winners of each ranking. In other words, if you win the second place, the final prize is 9,071 won divided by 18,142 won.

In this case, the ranking determination may include a random number scheme and a sales sequence scheme. In the case of random numbers, the equal number is determined by a number generated by any random number generation algorithm among 1 to 127. For example, if 63 is a random number, the winning rank is sixth. Otherwise, it may be possible to use the generated random number to determine the equal number through additional drawing. In this case, the same random number should not be selected more than once. That is, the random number generation algorithm must be implemented so that the same random number does not occur. Alternatively, in case of sales order, the rank may be determined by assuming the sales order is a random number in the previous example.

Hereinafter, a method of determining a rank for an embodiment of the present invention and calculating a winning amount (a discount amount) for cash-backing each rank will be described in detail. In the following description, it is assumed that the calculation is based on a random number, but it will be apparent that the same may be applied to the sales order. In other words, the same result can be obtained by replacing the random numbers in the order of sale in the following description.

Rank determination method

Hereinafter, a method of determining an rank for each customer for each product in the cache-back service according to an embodiment of the present invention will be described in detail.

The event for determining the rank proposed in the embodiment of the present invention is repeatedly performed in units of a predetermined sales amount. The unit of the predetermined sales amount means the total number of customers who win a single event, which may be defined differently for each product or point. The total number of customers here means the total number of winners.

The total number of customers is determined by the total number of ranks awarded in one event. Generalizing this is as shown in Equation 1 below.

Where C _total is the total number of customers who win a single event, and N is the total rank awarded for a single event.

로 계산될 수 있다. 여기서 n은 등수를 지정하는 등수 인덱스로써, 1부터 N의 범위에서 결정된다.At this time, the number of customers who can win by each rank in one event

It can be calculated as N is an equal index that specifies an equal number, and is determined in the range of 1 to N.

The ranking of the total customers to be won in one event is given by random numbers. In other words, a customer who receives an event and receives a random number corresponding to the first place is considered to win the first place. In other words, when a random number is assigned to a specific customer, the winning number is regarded as the winning number.

명의 고객들에 대한 등수 부여가 완료되면, 해당 이벤트는 종료된다. 그 후 새로운 이벤트를 개시한다. By the foregoing

When the ranking is completed for the number of customers, the event ends. Then start a new event.

As described above, an example of the method for determining equality proposed by the present invention is shown in Equation 2 below.

Where r is a random number and t is an equality decision index.

The equality determination index t may be generalized by Equation 3 below.

Where k is a purchase order number or a random number, a is an event count index for designating the number of advanced events, and N is a total number of branches that can be given through one event.

Therefore, if only the total number of branches of the random number, the event count index, and the equal number is determined, the equal information may be determined.

FIG. 3 is a diagram for conceptually explaining a method of determining an equal number by a random number in a cache-back service proposed in an embodiment of the present invention.

In FIG. 3, it is assumed that first to seventh ranks are given in one event. That is, when N is 7. In this case, the total number of customers is 127. And the first number of customers to win, etc., by ²⁰ one, the number of customers to win or the like 2 are two people as the 2 ¹ and 3 the number of customers to win or the like is four people as ^22, the number of customers to win or the like 4 The number of customers who will win 8th place and 5th place as 2 ³ is 16 with 2 ⁴ , the number of customers who will win 6th place is 32 with 2 ⁵ and 64 with 2 ^6th place.

For example, if an event is initiated and one random number is given for a particular customer, that customer is considered to win the first prize. The second and third random numbers will be deemed to have won the second place and the fourth and seventh random numbers will be deemed to be won. In addition, a customer with 8 to 15 random numbers will be deemed to have won the fourth place, and a customer with 16 to 31 random numbers will be deemed to have won the fifth place and 32 to 63 random numbers will be given. The winner will be deemed to have won sixth place. Lastly, customers with 64 to 127 random numbers are considered to be in the 7th place.

In the above-described example, the random number is given to match the total winning customers, and the random number is directly determined to determine the winning number. Otherwise, it is possible to designate a range of random numbers to be given separately, and to improve reliability of giving an equal number by using a modular operation using a random number provided within the specified range. In other words, it may be possible to further process the given random number so that the equality can be determined. However, the number of customers who win each prize must not exceed the number of possible winners. Therefore, care should be taken to ensure that random numbers already given in one event are not given again.

How to determine your discount

Hereinafter, a method of determining a discount amount by rank for a cache-back service according to an embodiment of the present invention will be described in detail.

The cache-back service proposed in the embodiment of the present invention is proposed as a method of returning a part of the profit returned to the seller by selling a product. This requires determining the total amount of refunds to be returned to customers in one event for each product or point. The amount to be refunded to the customer may be determined in consideration of the unit price of the product, or may be determined in consideration of the overall profit due to the products sold for one event or in consideration of each product. The amount of refund to be distributed by rank should be determined based on the total amount of refund.

The easiest way is to divide the total amount of the refund by the total number of branches, to determine the amount of refund to be distributed by rank. Such a method would be in the form of dividing the refund amount by rank among the customers constituting each rank.

Generalizing this can be represented by Equation 4 below.

는 x보다 작은 정수이다. Where P _CASH-BACK is the amount of refund for each customer whose rank is n, T _P is the total amount of refund, N is the total number of ranks in one event, and C _n is the total number of customers who can be given rank n. ,

Is an integer less than x.

에 의해 각 고객에 대한 환급 금액을 결정할 수 있다. 여기서 R은 등수 n에 대해 부여된 분배 비율을 결정하는 파라미터이다. 예컨대 3등에 대해 부여된 분배 비율이 20%라면, R₃은 20이 된다.As another example, if the amount of refund is to be distributed by any ratio without equalizing by each rank,

To determine the amount of refund for each customer. Where R is a parameter that determines the distribution ratio given for the equality n. For example, if the distribution ratio given to third class is 20%, then R ₃ is 20.

When the refund amount is determined for each customer by Equation 4, a part of the total refund amount remains. This is called a surplus refund amount. The surplus refund amount shall be further distributed to the designated rank or redistributed at an appropriate rate to the refund amount calculated for the customers who have won the ranks N-1 and N.

For example, the total refund amount (T _P) is 1,627,886 won, and assuming the case where the total number of branches (N) of the rank 7, C _n is 1, 1, 232,555 won, including a win for our customers discounted price (P _{CASH- BACK} ), and the discount amount (P _CASH-BACK ) is set at KRW 116,277 for each of the second prize winners with C _n = 2.

Another method of determining the refund amount is to use a cash-back point value assigned to each winning customer.

To do this, cache-back point values are equally assigned to all winning customers. This is called a cache-back point value of 1. The cache-back point value of 1 may be generalized as shown in Equation 5 below.

는 x보다 작은 정수이다.Where SP _n is the cache-back point value of 1 calculated for the customer who wins the rank n, 2 ^N -1 is the total number of winners, C _n is the total number of customers who win the rank n,

Is an integer less than x.

As can be seen in Equation 5, the cash-back point value that can be given to each of the winning customers is calculated by an integer value smaller than the quotient of the number of celestial winners divided by the total number of customers of the same rank. can do.

However, when the cash-back point value of 1 is calculated by Equation 5, a part of the total refund amount is generated as a surplus refund amount. Thus, the value of the one-person cache-back point is adjusted such that 80% of the surplus refund amount is redistributed to customers who win the rank N, and 20% is redistributed to the customers who win the rank N-1. Of course, the surplus refund amount may be redistributed to a predetermined number.

The total cache-back point value for each ranking may be generalized by Equation 6 below.

Where LP _n is the total cache-back point value calculated for rank n, SP _n is the cache-back point value equal to 1 calculated for customers winning rank n, and C _n is the total number of customers winning rank n to be.

As an example, assuming that the total number of branches (N) of the rank in a single event is 7, the cache-back point value (SP _n ) of 1 calculated by Equation 5 and the total cache calculated by the rank -Shows back point value.

When the cache-back point value of 1 for the cache-back service is calculated as described above, a discount amount for each winning customer may be calculated using the value. Generalizing the method for calculating the discount amount may be represented by Equation 7 below.

는 x보다 작은 정수이다.Where P _CASH-BACK is the amount of refund for each customer with rank n, U _CASH-BACK is the unit refund amount of the product, N is the total number of ranks in a single event, and SP _n is the number of customers who win rank n. A cache-back point value of 1 calculated for

Is an integer less than x.

4 is a diagram illustrating an example of determining a discount amount for each rank by a cache-back service according to an exemplary embodiment of the present invention. In FIG. 4, it is assumed that the unit amount of the product is 168,000 won, and the refund amount (U _CASH-BACK ) is 12,818 won. And the total number of branches (N) of the rank in one event is 7.

First, when the refund amount for the first place is calculated using the above assumptions, 127 is calculated as the cache-back point value SP ₁ that is 1 by Equation 6. If the assumption values and the calculated cache-back point value SP ₁ are applied to Equation 7, the refund amount for the first prize is 232,555 won.

Next, when the refund amount for the second place is calculated using the above assumptions, 63 is calculated as the cache-back point value SP ₂ that is 1 by Equation 6. If the assumption values and the calculated cache-back point value (SP ₂ ) of ₁ are applied to Equation 7, the refund amount for the second place is 115,361 won.

Since the refund amount for the remaining ranking may also be calculated by the same procedure as described above, a detailed description will be omitted, and the refund amount calculated for each ranking will be as shown in FIG. 6. The refund amount corresponding to the rank N-1 and the rank N in the refund amount by rank shown in FIG. 6 may be calculated by redistributing the surplus refund amount. In other words, the refund amount corresponding to the rank N-1 is calculated by SP + (LP * 0.2 / PN), and the refund amount corresponding to the rank N is calculated by SP + (LP * 0.8 / PN).

As described above, when the first event is received after the start of a new event in the state that the refund amount by rank is calculated, the main server receives the rank information corresponding to the first place and the cash-back of 232,555 won to the corresponding terminal. Send the information. Thereafter, the main server also transmits the cache-back information corresponding to the rank number to the corresponding terminal with respect to the received product information.

On the other hand, in order to implement an optimal cache-back system, it is desirable to properly adjust the total amount of refunds as well as the total number of branches in one event, and appropriately adjust the number of customers who can win in one event.

5 is a diagram illustrating an example of a cash-back receipt according to an embodiment of the present invention. This is based on the description to help understand what is proposed in the embodiments of the present invention.

Buyer purchases 1 Coca Cola (PET), 2 brown rice green tea 300 T / B, 1 Jeju tangerine + orange 100%, and Coca Cola (PET) won 2nd place and received a 3,726 won discount on the 1,200 won product. . In addition, 300 T / B of brown rice green tea purchased two products, and won the fourth prize and received a discount of 11,570 won. Jeju tangerine + orange 100% won the fifth place and received a discount of 549 won. Therefore, it can be seen that the total purchase amount of 22,880 won was purchased at 7,035 won, which was discounted by 15,845 won.

In the above description, the cache-back service considering only the cache-back terminal has been described. However, it may be easy to implement the cache-back terminal to manage the information about the customer in conjunction with the server connected to the network. That is, the cache-back terminal provides cache-back information generated for the customer to the server through the network, and the server manages the cache-back information corresponding to each customer. In this case, the cache-back information managed by the server can be accessed at the request of the customer, and the cash-back point can be paid in cash at the request of the customer.

As described above, in the present invention, by providing a cache-back system and a cache-back method in which the cache-back is performed in real time, the purchase motivation of the buyer can be increased, thereby securing a fixed customer without additional promotion. It can also lead to voluntary promotion of buyers.

In addition, it is possible to sell a large amount of goods in a short time, so that the product can be purchased at a low price from the producer, so that the profit of the retailer can be purchased at a low cost from the producer, not the buyer, thereby securing a high profit. In addition, it is possible to reduce costs and costs in the producers, so that it is possible to supply goods at low prices.

Therefore, fixed customers and mass sales are possible, which reduces the distribution stage. As a result, both producers, sellers, and consumers can generate more profits and lead smooth product distribution.

Claims (20)

delete delete The user interface unit receives the event information required for the cache-back service from the user and the event information provided through the user interface unit as inputs, and the predetermined point payment method, final rank, number of winners by rank, and total winning amount Calculating a winning amount corresponding to the input event information, and calculating a final payment amount by reflecting the calculated winning amount, wherein the final payment amount calculated by the control unit is determined by the user interface. In the cache-back terminal for notifying the user through the unit, and provides the cash-back service in a normal real-time, the winning amount is calculated by the random number or the purchase order specified in response to the input of the event information, A memory unit configured to manage the winning amount in response to user information included in the event information; The winning amount is calculated by winning rank; The winning rank (n) is

Determined by, and the equality index t is

Where k is a purchase order number or a random number, a is an event count index that designates the number of advanced events, and N is a total number of branches that can be given through one event. . The method of claim 3, The winning amount (

)silver

Where T _P is the total refund amount, N is the total number of branches in one event, C _n is the total number of customers who can be given rank n,

Is an integer less than x. delete delete delete delete delete delete delete delete The event information input for the cache-back service from a user, and when the event information is input, the input event information in consideration of a predetermined point payment method, final ranking, number of winners by number, and total winning amount Calculating a winning amount corresponding to the present invention; calculating a final payment amount by reflecting the calculated winning amount; and notifying a user of the calculated final payment amount, wherein the winning amount is In the method for providing a cache-back service in real time in a conventional cache-back terminal consisting of a process of calculating by a random number or a purchase order specified in response to the input of the event information, Managing the winning amount corresponding to the user information included in the event information; The winning amount is calculated by winning rank; The winning rank (n) is

Determined by, and the equality index t is

Where k is a purchase order number or a random number, a is an event count index that specifies the number of advanced events, and N is a total number of ranks that can be given through one event. Way. The method of claim 13, The winning amount (

)silver

Where T _P is the total refund amount, N is the total number of branches in one event, C _n is the total number of customers who can be given rank n,

Is an integer less than x. delete delete delete delete delete delete

Images