Issue involving primes.

  • Thread starter Calu
  • Start date
  • #1
73
0

Homework Statement



We have n ≥ 2, n not prime, n ∈ ℤ. Take the smallest such n. n is not prime and as such n is not irreducible and can be written as n = n1.n2; n1, n2 not units. We may take n1, n2 ≥ 2. However we have n > n1, n > n2 so n1, n2 have prime factors.

I'm not sure how n > n1, n > n2 implies that n1, n2 have prime factors.

Homework Equations


I'm not sure what's relevant here.

The Attempt at a Solution



From what I can see, the lowest possible n which meets the criteria is 6. 6 has the prime factors 2 and 3, which means that obviously what is stated is true. I'm just not sure how n > n1, n > n2 implies that its true.
 

Answers and Replies

  • #2
Orodruin
Staff Emeritus
Science Advisor
Homework Helper
Insights Author
Gold Member
2021 Award
18,604
8,499
6 is not the smallest non-prime integer larger than or equal to 2, 4 is.

Anyway, if n is the smallest non-prime integer and n1 < n, what does this imply?
 
  • #3
haruspex
Science Advisor
Homework Helper
Insights Author
Gold Member
37,988
7,702
Do you mean, "n1, n2 are prime factors"?
 

Related Threads on Issue involving primes.

Replies
7
Views
3K
Replies
5
Views
1K
  • Last Post
Replies
15
Views
2K
  • Last Post
Replies
2
Views
2K
  • Last Post
Replies
12
Views
1K
  • Last Post
Replies
9
Views
2K
  • Last Post
Replies
10
Views
2K
  • Last Post
Replies
2
Views
2K
  • Last Post
Replies
7
Views
1K
Replies
3
Views
3K
Top