answersLogoWhite

0

What does n mean in algebra?

Updated: 4/28/2022
User Avatar

Wiki User

14y ago

Best Answer

n is any number, (it is not n because it is the first letter of the word number,because the 'n' could be a 'q' or a 'h') Basically, 'n' is any number, and usually when working with algebra, it is easiest to work backwards

User Avatar

Wiki User

14y ago
This answer is:
User Avatar
More answers
User Avatar

Jennifer Hurtado

Lvl 2
3y ago

n is any number, (it is not n because it is the first letter of the word number,because the 'n' could be a 'q' or a 'h') Basically, 'n' is any number, and usually when working with algebra, it is easiest to work backwards

This answer is:
User Avatar

User Avatar

Wiki User

13y ago

N is a variable, used to substitute a number.

Hope that helped! (:

This answer is:
User Avatar

User Avatar

Anonymous

Lvl 1
3y ago

what is mean n in algebra?

This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: What does n mean in algebra?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Continue Learning about Geometry

How do you solve an algebra problem?

You can solve your algebra question like this: Example; n+6=16. You are going to need to find out what the N equals to. __+6=16 So you need to find out what the N equals to. You can also solve it like this: 16-6=10. So, 10 is the answer to the equation.


Calculate the number of sides of a regular polygon whose interior angles are each 150 degrees?

the answer is very simple 12 sides---------------------------------------------------------------- Here you go for the rule --------------------------Each interior angle in a regular polygon = (n-2)×180 ÷ n** n = number of sidesI love algebra so i solved with it(n-2)×180÷n = 150(n-2) × 180 = 150 × n180 n × -360 = 150 n180 n - 150 n = 36030 n = 360n = 360 ÷ 30n = ...............


How many minimum edges in a Cyclic graph with n vertices?

The term "cyclic graph" is not well-defined. If you mean a graph that is not acyclic, then the answer is 3. That would be the union of a complete graph on 3 vertices and any number of isolated vertices. If you mean a graph that is (isomorphic to) a cycle, then the answer is n. If you are really asking the maximum number of edges, then that would be the triangle numbers such as n (n-1) /2.


What is more harder geometry or algebra 2?

It depends on your aptitude.


What Grade do you take Geometry?

if you are in honors math you take geometry your freshman year, and if not your sophmore year. the order goes per-algebra, algebra 1, geometry, algebra 2, pre calculas, and then calculas (calculas is only taken for AP classes, for seniors that want to take it. Calculas counts for a college credit.)