0
No it is made by PurAqua it is a knock off of Gatorade
Wiki User
∙ 12y ago
Add your answer:
Earn +20 pts
3H2 N2 --- is it a maths a eqision?
No, N2 + 3H2 -> 2NH is the formula to make Ammonia, a gas that is present in urine.
How do you make a program for Fibonacci sequence?
The following is a schematic program. Details will depend on the language.n1 = 1output n1n2 = 1output n2.start loopn3 = n1 + n2output n3got enough numbers?if yes go to end elsen1
How can you create calculator in computer language cpp?
void main() { int i; float n1,n2; abc: printf("Enter two nos "); scanf("%f%f",&n1,&n2); printf("\n %f + %f = %f " ,n1,n2,n1+n2); printf("\n %f - %f = %f " ,n1,n2,n1-n2); printf("\n %f x %f = %f " ,n1,n2,n1*n2); printf("\n %f / %f = %f " ,n1,n2,n1/n2); printf("\npress 5 to make another calculation"); scanf("%d",&i); if (i==5) goto abc; }
If you have 14 grams of N2 how much NH3 can you make?
To convert 14 grams of N2 to NH3, you first need to balance the chemical equation for the reaction (N2 + 3H2 --> 2NH3) and calculate the molar ratio between N2 and NH3. Then you can use this ratio to determine the amount of NH3 produced.
How do you make ammonia?
the haber process the haber process the equation is N2 + 3H2 <--> 2NH3 the haber process! its easy, the equation is N2 + 3H2 <--> 2NH3
Are there infinitely many primes of the form n2-1 and n2-2 and n2-3 and n2-4?
n2-1 and n2-4 are trivial cases because of n2-m2=(n-m)(n+m). So the only prime of the form n2-1 is 3 and of the form n2-4 is 5.
What is a balanced chemical equation for nitrogen in pure form?
The balanced chemical equation for nitrogen in pure form is N2(g) → N2(g). This represents the equilibrium reaction where nitrogen exists as diatomic molecules in the gaseous state.
How do you add n squared plus n squared?
n2 + n2 = 2 n2
What is the pmf of trinomial distribution?
P(x=n1,y=n2) = (n!/n1!*n2!*(n-n1-n2)) * p1^n1*p2^n2*(1-p1-p2) where n1,n2=0,1,2,....n n1+n2<=n
What is the oxidation number for N2?
0 in N2
What is oxidation number for N2?
0 in N2
Codings for coprime number in c?
#include<stdio.h> int main(){ int n1,n2; printf("\nEnter two numbers:"); scanf("%d %d",&n1,&n2); while(n1!=n2){ if(n1>=n2) n1=n1-n2; else n2=n2-n1; } printf("\nGCD=%d",n1); return 0; }
