Results 1 to 3 of 3

Math Help - prime factorization

  1. #1
    Newbie
    Joined
    Feb 2008
    Posts
    5

    prime factorization

    There has to be an easier way to find prime factorization rather than just keep on dividing your natural number by prime factors. Does anyone have an equation to find out a way to find your prime factors rather than doing this long way?
    Follow Math Help Forum on Facebook and Google+

  2. #2
    is up to his old tricks again! Jhevon's Avatar
    Joined
    Feb 2007
    From
    New York, USA
    Posts
    11,663
    Thanks
    3
    Quote Originally Posted by teeplkyl View Post
    There has to be an easier way to find prime factorization rather than just keep on dividing your natural number by prime factors. Does anyone have an equation to find out a way to find your prime factors rather than doing this long way?
    i don't know of an easier way, but maybe someone else does. usually it is not very long to do it that way. the numbers they ask you to give the prime factorization for are usually relatively small
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Global Moderator

    Joined
    Nov 2005
    From
    New York City
    Posts
    10,616
    Thanks
    9
    Quote Originally Posted by teeplkyl View Post
    There has to be an easier way to find prime factorization rather than just keep on dividing your natural number by prime factors. Does anyone have an equation to find out a way to find your prime factors rather than doing this long way?
    There is an entire area of computational number theory which studies primality testing - that is when we seeking prime factors rather than guessing in a more efficient way. However, this problem is a computationally difficult. Some mathematicians believe it is impossible to find an efficient algorithm because of P versues NP - a problem whose solution is worth one million dollars. The problem is about certain types of algorithms which fall into a category called "NP" computational problem and there is another type of algorithms which fall into a categorty called "P" computational problems. The conjecture asserts that these two categories are completely distinct so if a computational can be solved using NP algorithms then it cannot be solved using P algorithsm, and the other way around too. Now certain algorithms are faster than others. The ones that mathematicians developed for primality testing are not very efficient. Thus, mathematicians fear the sad news that is might be impossible to have efficient algorithms.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Prime Factorization Help
    Posted in the Algebra Forum
    Replies: 11
    Last Post: March 23rd 2014, 11:02 AM
  2. Prime Factorization
    Posted in the Advanced Algebra Forum
    Replies: 2
    Last Post: September 21st 2010, 02:56 PM
  3. Prime factorization question
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: November 9th 2009, 11:16 AM
  4. prime factorization 2
    Posted in the Algebra Forum
    Replies: 7
    Last Post: September 16th 2008, 12:37 PM
  5. prime factorization
    Posted in the Number Theory Forum
    Replies: 2
    Last Post: September 13th 2008, 12:36 PM

Search Tags


/mathhelpforum @mathhelpforum