Originated From
AOL Search

Mathematical terms

in what year was the mathematical term "prime" introduced

Liked this question? Tell your friends about it

7 Answers

Order by
Oldest to Newest
Newest to Oldest

Prime numbers were known to Euclid, around 300 BC.

Ancient Egyptians had some knowledge of prime numbers but was not recorded. Greek Euclid record prime number around 300 BC.  

In the year 300 BC C. and is found in Euclid's Elements (volumes VII to IX). Euclid definesprime numbers, shows that there are infinitely many of them, define the greatest common divisor and least common multiple and provides a method for determining which today is known as the Euclidean algorithm.

We believe that Prime Operators were first introduced by Euclid and then expanded on by Eristochus in 720 AD.  Basically, a prime operator sets a special condition for a secondary operator. 

Dirac did much of his work in these operators.  This is how he developed many of his theories that now delve into creation physics. 

It is a very exciting time for physicists, which I only wish I had seen the value to pursue earlier in my career.  Oh, well, we all make mistakes.



Our dwindling supply of leftists feel particularly morose, depressed, and hopeless around Christmas. That is all their fault. They feel it acutely because guilt will never leave them alone -- and will be their sole companion for eternity.

Prime factors first came into widepread use in Europe as Newton and Leibniz developed integral math.  There is evidence that a vartiety of prime factoring was first used in ancient Egypt, as we calculate the dimensions of certain chambers at Gizeh.


I changed my buddy icon because Physicalist pirated my screen name. Atheists have a way of being obnoxious, but that is because they lack a case. My new buddy icon is the planet Uranus. It will stay so until Physicalist learns his place -- under the front porch.

It seems you have knowledge on Euclid's. Can anyone help me in understanding http://youtu.be/fw2_GXMOf_o Euclid's algorithm. Give me some introduction on euclid's algorithm and theory on euclid algorithm

Euclid's algorithm for finding GCD of two numbers a and b is to divide the larger by the smaller. If there is no remainder, the answer is that divisor. If there is a remainder, substitute it for the previous larger number. It will now be the smaller number. Repeat the divisions until it comes out even.

Related Questions

Other people asked questions on similar topics, check out the answers they received:

Asked: Ancient Indian Vedic mathematics or modern ...

Ancient Indian Vedic mathematics or modern mathematics is scientific?

Asked: Mathematics

what percent is 305 million of 6.7 billion ?

Asked: Why celcius and farenheit are not used for ...

why celcius and farenheit are not used for science?

Ask a Question... We'll forward it to people who know

More Questions

Short term rental apartment or house

You obviously have a computer. You obviously know what Craigslist is. Why not just go there and look? Why come to AOL Answers?

Which category can you NOT win a Nobel Prize in Mathematics or

There are some other math prizes besides the Fields Medal and Abel Prize: Wolf Prize, Steele Prize, Cole Prize, Bocher Prize, Nevanlinna Prize, and there are Millennium Prizes.

What is the mathematical term for 9 squared multiplied by b squared

This equation may be expressed C^2=9(AB)^2

86th? Where did the term Your 86th come from?

"You're 86ed" means you are being thrown out or refused service. One source from 1933 says it was soda fountain shorthand for "we're all out".