0
This is weird. Let's think for a minute ... how can half of something be as big as ten of it ?
Well, let's go through the algebra anyway:
n/2 = 10n
Multiply each side by 2:
n = 10n
Subtract n from each side:
0 = 9n
Divide each side by 9:
0 = n
=============================
Maybe the question meant: 2/n = 10n
In that case, 2 = 10n2, 5n2 = 1, n = sqrt(0.2) = 0.4472 (rounded)
What else can I help you with?
10 more than the quotient of a number and -2 equal 3?
(n/-2) + 10 = 3
The quotient of n and 8 algebreic expression?
The quotient n times 8 is an algebra expression. The answer to this math problem is 1.
1 more than the quotient of n and 2?
how to write this in algebraic expression 1 more than the quotient of n and 2
What is the quotient of 8 times a number and 3?
If the number is n, then 8n/3
How do you write the square of the quotient of a number and 4?
(n/4)2, where n is a number.
10 more than the quotient of a number and -2 equal 3?
(n/-2) + 10 = 3
How do you simplify 16 times 2 power of n times 10 times 2 to the power of n?
16(2^n)(10)(2^n)=160[2^(2n)]=160(4^n)
What is The quotient of nine times n plus 7?
The quotient is 9n + 7
What is the quotient of m and n?
You can write this as:m/nor "m" on top of "n", with a horizontal line separating them, like this:m---n
The quotient of n and 8 algebreic expression?
The quotient n times 8 is an algebra expression. The answer to this math problem is 1.
1 more than the quotient of n and 2?
how to write this in algebraic expression 1 more than the quotient of n and 2
Conversion of decimal to binary in fortran?
This is not a perfect program, but it will get you started in the right direction. Works for any INTEGER up to "some" power of 2 (decimals kill the program). PROGRAM binary IMPLICIT NONE INTEGER remainder, quotient, n, int_input, answer REAL input, dec_input WRITE(*,*) 'Input a number to convert to binary' READ(*,*) input int_input = input dec_input = input - int_input dec_input = abs(dec_input) quotient = abs(input) DO WHILE (dec_input==0) n = 0 answer = 0 DO WHILE (quotient>1) remainder = mod(quotient,2) quotient = quotient/2 answer = answer+remainder*10.**n n = n+1 END DO IF (input<0) answer = -answer answer = answer + quotient*10.**n WRITE(*,"(a,i31)") 'Your answer in binary is:',answer END DO END PROGRAM binary
10 plus the quotient of a number and 15?
10 + 15a * * * * * No! It is 10 + n/15
What is 4 more than n is the quotient of n and 2 symbolic form?
The phrase "4 more than n" can be expressed as ( n + 4 ). The "quotient of n and 2" is represented as ( \frac{n}{2} ). Therefore, the symbolic form of the statement is: [ n + 4 = \frac{n}{2} ].
How many combinations of 2 numbers are there in 10 numbers?
To find the number of combinations of 2 numbers from a set of 10, you can use the combination formula ( C(n, r) = \frac{n!}{r!(n-r)!} ). Here, ( n = 10 ) and ( r = 2 ). Calculating this gives ( C(10, 2) = \frac{10!}{2!(10-2)!} = \frac{10 \times 9}{2 \times 1} = 45 ). Therefore, there are 45 combinations of 2 numbers from 10.
How do you find the power of a quotient?
The power of a quotient is the quotient of the power! (a/b)^n = (a^n) / (b^n) where a/b is the quotient and n is the power.
How do you express the quotient of 2 and a number?
If your number is "n", you simply divide 2 by the number: 2/n.
