The formula for the same time on both sides is: number of patties x number of sides of patties ÷ number of pans in a pan x time per side. (The pan cooks both sides at once.) Let's say it takes time t to cook one side, and for n pancakes, the total time is nt, which should be the same.

When the time does not come out as a whole number, an approximation is made by rounding up to the nearest whole number. For example, the number of pancakes for 4, the number of sheets per pan is 3, each side of the cooking 2 minutes, according to the formula 4 × 2 ÷ 3 × 2 ≈ 6 minutes ※ when a pot only two pancakes: total time = cooking one side of the time × the number of sheets.

Extension

Solution:

The number of pancakes for an even number of random branding, (such as two two, in turn, branding the front and back) the result is nt. The number of pancakes for an odd number of, the program is: branding the first and the second of the front, branding the second and the third of the reverse side, branding the third and the fourth front ...... branding.

The n-1st and the reverse of the nth, and finally cook the reverse of the first and the front of the second (well this scheme may not be optimal because the first patty will be cold orz). The result is the same anyway.