As a point of pedantry, mathematics doesn't use any mode of reasoning, mathematicians use modes of reasoning. And, naturally, like all people, they use a mixture of all different modes of reasoning to suit their needs.
However, we can talk about what sorts of modes of reasonings are depicted in the proofs that mathematicians provide to convey confidence in their ideas. In proof theory, we often see an operator known as "implies," typically represented by the turnstyle (⊢) which is a "metaoperator" in that no system defines the exact behavior of "implies." You're expected to understand what that means.
In a proof system, we set up a set of inferences which are deemed "acceptable for use" within the proof system in this way. For example, one might write {p, p→q}⊢q
, which can be thought of informally to say "if p is true, and 'if p is true then q is true' then we can infer that q is also true." The list of these accepted inferences is typically provided up front. As a case study, one can look at First Order Logic, which defines a set of inferences in this way. Once the inference is accepted, it may be used in the proof from then on out.
So really, to answer your question, what we need to look at are the inference rules that mathematicians use. Many of these get phrased as axioms, so we can look there. If you look at the axioms we tend to use, most seem to be used to convey a deductive reasoning, but there are inductive examples as well. The one that comes to my mind is the Law of Induction, which is part of the Peano Axioms which define the natural numbers (0, 1, 2...). That law is very visibly designed to convey an inductive reasoning, to the point where they actually named the law "Induction!"
So mathematicians use both deduction and induction, along with whatever else is convenient to use. If you want to be more specific than that, simply look at the axioms which they use as part of their proofs, and you can see the reasoning they are trying to convey.