# Tough Math problem

I need a math expert that can come up with a forumla but discuss it in mathmatical detail. I want it to be very high-level and very good.

Problem:

In a computer system there are Jobs (Processes) that re-arrive periodically.

For example, if there are two Jobs: J1 and J1.

J2's service time (Completion time) is R2, it comes every T2 = 2 seconds.

J1's service time (Completion time) is R1, it comes every T1 =1 seconds

I want to determine the NUMBER of times J1 re-arrives during J2's time.

If J1 re-arrives periodically then n1 = R2/T1. That means J1 re-arrives n1 times. This is upper bound.

If R1&gt;T1, then If J1 re-arrives periodically then n2 = R2/R1. That means J1 re-arrives n2 times during J2's time. This is the lower bound.

I want a very good math formula , that can help show the &quot;Most Likely value&quot; (a number between n1 and n2).

Budget \$30.

Please do not ask me to select you until I see your solution. I am honest. I need more than one solution. If I tell you NO, the answer is not correct, then please trust me, since I will be sending your equations to math experts to check it before paying you.

If the solution is good, you will be selected for many more projects related to math.

thank you

Færdigheder:

Om arbejdsgiveren:
( 1 bedømmelse ) Pluto, United States

Projekt-ID: #279699