Answer:
C.64
Step-by-step explanation:
The first step is to figure out what the sequence is, the first step is 2, 4 the only ways for 2 to get to 4 would be +2 or *2 so we will look at the next step, 4 to 8. The only ways for 4 to get to 8 is +4 or *2, since these both have *2 in common we will check that with all of the terms
2, 4, 8, 16, 32
2 (*2) = 4 (*2) = 8 (*2) = 16 (*2) 32
Since the equation is working we are going to multiply 32 by 2 to get the 6th term
32 (*2) = 64
 
        
                    
             
        
        
        
Answer:
P43=4!(4–3)!=241=24
Step-by-step explanation:
There are four choices you can make for the lead reindeer. For each possible choice, there are then three remaining you can choose to fly second, making 4×3=12 choices for the lead pair. For each possible choice there are two remaining reindeer to take up the back position, making 12×2=24 choices for the team of three.
This type of problem is called a permutation problem, and we write Pnr for the number of ways of choosing r items from n possibilities when the order of the items matters. In this case we are choosing 3 reindeer from 4 possibilities, and the order they appear in the flying line does matter, so the answer we want is P43. The general formula is Pnr=n!(n−r)!. For the answer we are looking for we therefore have:
P43=4!(4–3)!=241=24 
 
        
                    
             
        
        
        
Let 

. Then 

 and 

 are two fundamental, linearly independent solution that satisfy


Note that 

, so that 

. Adding 

 doesn't change this, since 

.
So if we suppose

then substituting 

 would give

To make sure everything cancels out, multiply the second degree term by 

, so that

Then if 

, we get

as desired. So one possible ODE would be

(See "Euler-Cauchy equation" for more info)
 
        
        
        
[x] represents floor function also called as Greatest integer function.
Floor function is the function that takes as input a real number and gives as output the greatest integer less than or equal to.
like [1.5]=1
[0.7]=0
[-0.3]=-1
Now we have to find set of x-values which satisfies equation [x-1]=[x]
Due to -1 in [x-1], it always produces output value one less than value of [x]
for example when x=0.5 then [x]=[0.5]=0, [x-1]=[0.5-1]=[-0.5]=-1
when x=1.5 then [x]=[1.5]=1, [x-1]=[1.5-1]=[0.5]=0
when x=3 then [x]=[3]=3, [x-1]=[3-1]=[2]=2
From above results we can see that there is no value of x which satisfies the given equation [x-1]=[x]
Hence there is NO solution.
 
        
                    
             
        
        
        
Angle 1 = 30°
Angle 2 = 90°
⇒ Angle 3 = 60°
So, it's right triangle. We can set the length of one side and get all other sides.
So, we have 1 triangle. If there are 2 or more triangles with the same data, all the triangles will be congruent because of : <span>Two triangles are </span><span>congruent if </span>"<span>ASA: Two interior angles and the included side in a triangle have the same measure and length, respectively, as those in the other triangle</span><span>.</span>"