# Camel and Travelers Puzzle || Can You Find Number of Camels and Travelers ?

Problem Statement: In a desert, there are some camels and some travelers. you are supposed to find, How many camels and travelers are there if both the following statements are TRUE?

Statement 1: If each traveler sits on the camel, one traveler doesn’t get a camel. Statement 2: If two travelers share each camel there is one camel left out. can you find How many camels and travelers by analyzing these statements ?

since there are 2 statements, the most logical way of solving this problem is by creating the equations. let us solve this puzzle logically instead of following some blind method.

for convenience, let's call the number of camels as C and the number of travelers as T.

let us analyze the statements now, As we can see in statement 1, there is a condition that one traveler doesn’t get a camel to sit which implies the number of camels is one less than the number of travelers.

So the following case occurs:
According to the first statement, the number of camels is equivalent to the number of travelers minus one. we can write the equation like this

C = T - 1
where C is the number of camels and T is the Number of travelers.
camels = travellers - 1    ------(1)

And in statement 2 there is a condition that If two travelers share each camel there is one camel left out which implies that traveler must be an even number.

So the following case occurs:
According to the second statement, the number of camels is going to be equal to half the traveler (because two are on each camel)plus one leftover. we can write the equation like this

(T/2) + 1 = C ------(2)
Let us solve equation 2.

by solving this equation it results in
T + 2 = 2C
from equation 1 we know that C = T -1
now equation becomes T + 2 = 2 (T -1)

T + 2 = 2T -2
after solving this equation => T = 4
Substitute value of T in equation 1, which results in C = 3
Hence the total number of camels is 3 and the total number of travelers is 4

By following these simple steps we can solve the problem in minimum time.