answersLogoWhite

0


Best Answer

2 n in a d is 2 = nickels in a dime.

User Avatar

chyna santiago

Lvl 4
3y ago

Still curious? Ask our experts.

Chat with our AI personalities

ReneRene
Change my mind. I dare you.
Chat with Rene
ViviVivi
Your ride-or-die bestie who's seen you through every high and low.
Chat with Vivi
CoachCoach
Success isn't just about winning—it's about vision, patience, and playing the long game.
Chat with Coach

Add your answer:

Earn +20 pts
Q: What is 2 n in a d?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

How to write a program to print first n odd numbers in descending ordre?

Pick one 1: for (i=2*n-1; i>=1; i-=2) printf ("%d\n", i); 2: for (i=n; i>=1; i--) printf ("%d\n", 2*i-1); 3: for (i=0; i<n; i++) printf ("%d\n", 2*(n-i)-1);


What is the formula to find sum of n even numbers?

Sum = n/2[2Xa1+(n-1)d] where n is last number, a1 is the first number & d is the common difference between the numbers, here d=2 for the even /odd numbers. Sum = n/2 [2Xa1+(n-1)2]


How many ways can you make change for a dollar using nickels dimes andor quarters?

There are 22 ways to make change from a dollar using nickels, dimes, and quarters. 1. 4 q 2. 10 d 3. 20 n 4. 2 q , 5 d 5. 3 q , 2 d , 1 n 6. 1 q , 7 d, 1 n 7. 9 d, 2 n 8. 8 d, 4 n 9. 7 d, 6 n 10. 6 d , 8 n 11. 5 d , 10 n 12. 4 d , 12 n 13. 2 d , 16 n 14. 1 d , 18 n 15. 5 n , 3 q 16. 3 n , 1 q , 6 d 17. 7 n , 1 q , 4 d 18. 9 n , 1 q , 3 d 19. 11 n , 1 q , 2 d 20. 13 n , 1 q , 1 d 21. 14n , 3 d 22. 15n , 1 q


What is the sum of the arithmetic sequence?

The sum of an arithmetical sequence whose nth term is U(n) = a + (n-1)*d is S(n) = 1/2*n*[2a + (n-1)d] or 1/2*n(a + l) where l is the last term in the sequence.


How many different ways can you make change for a half dollar without using pennies?

Assuming nickles, dimes, and quarters, there are ten different ways to make change for a half dollar. Just enumerate the combinations... 10 n 8 n 1 d 6 n 2 d 4 n 3 d 2 n 4 d 5 d 5 n 1 q 3 n 1 d 1 q 1 n 2 d 1 q 2 q


Denominator of a rational no is greater than its numerator by 7 if the denominator is decreased by 6 and the numerator is increased by 17 the new no becomes 2 what is the original no.?

d = n + 7 and (n + 17)/(d - 6) = 2 so (n + 17)/ n + 7 - 6 = 2 (n + 17)/(n + 1) = 2 2n + 2 = n + 17 n = 15 and d = 22 Check n + 17 = 32, d - 6 = 16, 32/16 = 2 Original number is 15/22


What are the different combinations you can use to make 0.35 only using quarters dimes and nickels?

1 q 1 d 1 q 2 n 2 d 3 n 3 d 1 n 1 d 5 n 7 n


What is first difference?

In a sequence of numbers, a(1), a(2), a(3), ... , a(n), a(n+1), ... he first differences are a(2) - a(1), a(3) - a(2), ... , a(n+1) - a(n) , ... Alternatively, d the sequence of first differences is given by d(n) = a(n+1) - a(n), n = 1, 2, 3, ...


Change two thirds into a percentage?

A fraction, n/d, in percentage terms is simply (100*n) / d. In this case, n = 2 and d = 3.


Write a c program to print the sum of even numbers from 300 to 400?

int n, N;N = some even numberfor (n=2; n


Function to find the transpose of a sparse matrix?

// transpose for the sparse matrix void main() { clrscr(); int a[10][10],b[10][10]; int m,n,p,q,t,col; int i,j; printf("enter the no of row and columns :\n"); scanf("%d %d",&m,&n); // assigning the value of matrix for(i=1;i<=m;i++) { for(j=1;j<=n;j++) { printf("a[%d][%d]= ",i,j); scanf("%d",&a[i][j]); } } printf("\n\n"); //displaying the matrix printf("\n\nThe matrix is :\n\n"); for(i=1;i<=m;i++) { for(j=1;j<=n;j++) { printf("%d\t",a[i][j]); } printf("\n"); } t=0; printf("\n\nthe non zero value matrix are :\n\n"); for(i=1;i<=m;i++) { for(j=1;j<=n;j++) { // accepting only non zero value if(a[i][j]!=0) { t=t+1; b[t][1]=i; b[t][2]=j; b[t][3]=a[i][j]; } } } printf("a[0 %d %d %d\n",m,n,t); for(i=1;i<=t;i++) { printf("a[%d %d %d %d\n",i,b[i][1],b[i][2],b[i][3]); } a[0][1]=n; a[0][2]=m; a[0][3]=t; int s[10],u[10]; if(t>0) { for(i=1;i<=n;i++) { s[i]=0; } for(i=1;i<=t;i++) { s[b[i][2]]=s[b[i][2]]+1; } u[1]=1; for(i=2;i<=n;i++) { u[i]=u[i-1]+s[i-1]; } for(i=1;i<=t;i++) { j=u[b[i][2]]; a[j][1]=b[i][2]; a[j][2]=b[i][1]; a[j][3]=b[i][3]; u[b[i][2]]=j+1; } } printf("\n\n the fast transpose matrix \n\n"); printf("a[0 %d %d %d\n",n,m,t); for(i=1;i<=t;i++) { printf("a[%d %d %d %d\n",i,a[i][1],a[i][2],a[i][3]); } getch(); }


Find the value of d so that the number n is 26578d341 is divisible by 11?

d = 2(n = 265782341)