Re: Sum of k relative primes

Toni Lassila <toni@xxxxxxxxxxxx> writes in article <cvur811a85ghcvhk2jgdogodhitrebjlrd@xxxxxxx> dated Fri, 20 May 2005 18:06:33 +0300:
>Prove or disprove:
>
>For each k >= 2, there exists N_k s.t. for all integers n > N_k there
>exist integers a_1 + ... + a_k = n, a_j >= 2 for all j=1,...k, and
>GCD(a_1,...,a_k) = 1.

For k=2, try this: Choose a_1 < n such that it is some power of a prime
number which does not divide n.

--Keith Lewis klewis {at} mitre.org
The above may not (yet) represent the opinions of my employer.
.

Relevant Pages

  • Re: continuous functions
    ... continuity. ... The above may not represent the opinions of my employer. ... Prev by Date: ...
    (sci.math)
  • Re: minimisation of a function
    ... Do you know anything about the coefficients a, b, c, such as their sign? ... The above may not represent the opinions of my employer. ... Prev by Date: ...
    (sci.math)
  • Re: Least primes in arithmetic progressions
    ... Dirichlet's theorem states that the series a*n+b contains an infinite number ... The above may not represent the opinions of my employer. ... Prev by Date: ...
    (sci.math)
  • Re: E of E = t*k*p
    ... The result is called a "gradient". ... The above may not represent the opinions of my employer. ... Prev by Date: ...
    (sci.math)
  • Re: help with diophantine equation
    ... Options after that include factoring, modulo arithmetic, and the quadratic ... The above may not represent the opinions of my employer. ... Prev by Date: ...
    (sci.math)
Quantcast