Question

comparing permutations to combinations for the same set of parameters you would have more combinations than permutations true or false

Answer 1

Let a set of $n$ elements. 
We can find $n!$ (factorial) of the $n$ element. 
However, combination of the element lead to less than $n!$ possibilities. 
(combining like adding or multiplying)
So the proposition is false. 

Answer 2

Answer:

False; you would have more permutations than combinations.

Step-by-step explanation:

The formula for taking combinations of n objects taken r at a time is

$\frac{n!}{r!(n-r)!}$

The formula for taking permutations of n objects taken r at a time is

$\frac{n!}{(n-r)!}$

Comparing these two, we can see that the difference between the formulas is that the formula for combinations is divided by an extra r!.  Since it is divided by a larger number, it will result in a smaller answer; therefore permutations give more results than combinations.