Trip around the Earth You are standing at an airport (that lies somewhere) on equator (of the earth) and have an unlimited number of identical aircrafts (same model, make and fuel capacity etc.) to make a complete trip of equator.  Each of the aircraft has the fuel capacity to fly exactly 1/3 (one-third) around the earth along equator. Any flying plane can transfer fuel to any other plane in air instantaneously (without spillage) but after transfer, it should have left with sufficient fuel to come back to the airport (or get refuel again by someone else to eventually come to airport). In any case no plane should get crashed due to fuel outage.
Q(1). What is the minimum number of aircraft necessary to get one plane all the way around the equator assuming that all of the aircraft must return safely to the airport? Assume no other airport is available and unlimited supply of fuel is available (at the airport).
Q(2). What is the minimum number of aircraft necessary for a straight line to reach one of them from start to end point (assuming airport at the start point) and the fuel capacity is 1/3 (one-third) of the straight line (and other conditioned are same as that of Q1).
I can solve it using head and trial but I am looking for a mathematically way to derive the solution.
 A: There is a symmetric solution with 11 aircrafts.
If you manage to carry a plane with 5 assisting planes up to one third of the equator and leave it with its tank full, then let it fly through the middle third, and redo the same strategy in reverse with 5 other assisting planes, you get a solution.
Solving this kind of problem is hard, because you constantly have to maintain a delicate balance between how much you can support the aircraft while still being able to save the assisting aircrafts who in turn will need support that will have to be saved etc.
I kinda brute-forced over strategies running with time intervals of 1/6 to find this one (my first try needed a humble 20 aircrafts)
Here, I show how, with 6 aircrafts (flying at one unit of distance per unit of time and unit of fuel, where each aircraft has tank that can contain up to 6 units of fuel), you can send one of them to a distance of 12 units while still not crashing the other five. 
A pair $(p,f)$ denotes the number of planes $p$ with their combined fuel $f$ at that time and place. I don't detail explicitly how the fuel is distributed but you can infer it from the table easily.
$$\begin{array}c  & d=0 & d=1 & d=2 & d=3 & d=4 & d=5 & d=6 & d=7\\ 
t=0 & (6,36) \\ 
t=1& & (6,30) \\
t=2 & (1,6) & & (5,24) \\
t=3 & & (2,5) & & (4,19) \\
t=4 & (2,12) & & (1,1) & & (3,14) \\
t=5 & & (3,10) & & (1,1) & & (2,10) \\
t=6 & (2,12) & & (2,5) & & & & (2,8) \\
t=7 & & (3,10) & & (1,3) & & (1,1) & & (1,5) \\
t=8 & (2,12) & & (1,5) & & (2,2)\\
t=9 & & (2,10) & & (3,4)\\
t=10 & (1,6) & & (4,6) \\
t=11 & & (5,7) \\
t=12 & (5,30) \\
 \end{array} $$
Starting the solution in reverse at t=6 allows you to catch the aircraft when it reaches d=12 at time t=12, and finally to bring it at d=18 = 3 times the distance an aircraft can fly by itself.
Seeing as there is some fuel to spare sometimes and as I have almost solutions to doing the trip with 4+4+1 planes, I wouldn't be too surprised if there is a solution with only 10 aircrafts (and maybe 9).
It would be nice to know, for each $n$, the greatest distance you can possibly reach with $n$ aircrafts. Theoretically, you could do an A* search algorithm with hyperpolyedra in a phase space of dimension $2n$ to explore everything and obtain the solution after a horrifyingly long computation.
You could also write particular flight routes, deciding which aircraft meets which aircraft where and in what order, then leave unknowns for all the distances and the fuel exchanged at each meeting point, and try to solve the horrifying system of linear inequalities you obtain and get the best distance with that particular flight route.
Looking at the near solutions one can brute force with 5 aircrafts, this might be doable to find the best distance for $n=5$.
A: For Q(1), I believe I have discovered a solution using only 8 airplanes.  I will post that at a later date.  For now, here is a simpler solution using 9 airplanes.  Capacity of the fuel tank is 4, so a complete trip around the world is 12 units.  Numbers in green shows the amount of fuel that has reached that node.  Numbers in red show the number of airplanes travelling between nodes.  Note the two planes that sit idle and unused at the airport for parts of the journey, suggesting 9 planes is not the best solution.  I labelled node A since it is a bit tricky:  The 1 plane leaving that node travelling east is only carrying 3 units of fuel, not the expected full tank.  Similarly, for node B, the one returning plane entering the node arrives with 1 unit of fuel left, not the expected empty tank.   
A: Q(1) solution using only 8 planes.  Here, the capacity of a fuel tank is 36, so a full circumnavigation is 108.  Red indicates number of airplanes on each segment.  Blue is the length of each segment.  Available fuel at each node is left as an exercise for the reader.  Node A is a special case:  The inbound plane entering node A still has 6 fuel left.  He transfer 3 fuel to the outbound plane entering the node so that it again has a full tank, and keeps 3 fuel for the return to the airport.  Node B does the opposite:  The outbound plane transfers 3 fuel to the inbound plane, which gives it just enough fuel to make the next node and get rescued by another outbound plane.
A: Considering each aircraft has a storage capacity to travel 1/3 the distance, we need 17 aircrafts with full storage and another one with 9.3% capacity at the start point. I do not think it makes any difference whether it is on the equator or on a straight line with the same distance.
