Minimal clones have been a challenging topic in algebra for a long time. Every minimal clone is generated by each of its non-trivial functions. A non-trivial function 𝑓 ∈ 𝐹∖𝓙𝐴 of minimum possible arity in a minimal clone 𝐹 is called a minimal function. In this talk we focus on identifying minimal majority operations 𝑓：𝐴³ → 𝐴 satisfying 𝑓(𝑥,𝑥,𝑦) = 𝑓(𝑥,𝑦,𝑥) = 𝑓(𝑦,𝑥,𝑥) = 𝑥 for all 𝑥, 𝑦 ∈ 𝐴 = {0, 1, 2, 3, 4} on a five-element set with values in {0, 1} on the injective triples that generate a minimal clone. Finally, we count the number of majority operations in the generated minimal clones.