My Math Forum prime numbers proof?

 Number Theory Number Theory Math Forum

 April 6th, 2016, 11:46 PM #1 Member   Joined: Mar 2016 From: Nepal Posts: 37 Thanks: 4 prime numbers proof? Playing with primes numbers I've discovered a seemingly trivial fact "the smallest non-trivial ( != 1) divisor of any positive integer is a prime". Does the proof of this exist? Sure it should unless my conclusion is wrong. Anybody else already know about this idea?
 April 7th, 2016, 12:44 AM #2 Senior Member   Joined: Dec 2012 From: Hong Kong Posts: 853 Thanks: 311 Math Focus: Stochastic processes, statistical inference, data mining, computational linguistics Isn't that a consequence of the Fundamental Theorem of Arithmetic? Thanks from Adam Ledger
 April 8th, 2016, 04:04 PM #3 Senior Member   Joined: Jan 2014 From: The backwoods of Northern Ontario Posts: 393 Thanks: 71 Suppose d, the the smallest divisor of a particular integer is NOT prime. Then d must have a non-trivial divisor (other than itself or 1). But this non-trivial divisor would have to be smaller than d. Therefore d is NOT the smallest divisor of that integer. This implies that the original supposition is false, and thus the smallest divisor cannot be composite, and so it must be prime.

 Tags numbers, prime, proof

 Thread Tools Display Modes Linear Mode

 Similar Threads Thread Thread Starter Forum Replies Last Post Pengkuan Math 61 February 29th, 2016 04:46 PM shaimaa saif Algebra 10 November 17th, 2015 08:02 AM diltarget Number Theory 0 October 23rd, 2015 08:13 AM Eureka Number Theory 4 November 3rd, 2012 03:51 AM Dudealadude Abstract Algebra 1 January 28th, 2012 02:03 AM

 Contact - Home - Forums - Cryptocurrency Forum - Top