What Is a Composite Number With No Co-Prime Factors?

  • Thread starter Thread starter Ventrella
  • Start date Start date
  • Tags Tags
    Composite Factors
Ventrella
Messages
28
Reaction score
4
I have come across a question in my explorations of recursive tilings using Gaussian and Eisenstein Integers. It seems there might be a class of composite numbers which have no factors (divisors) that are co-prime. So, for instance: 10 is composite, but its factors (2 and 5) are co-prime. The same is true for 6 and 12. However, 4, 8, 9, 16, 25 do not have factors which are co-prime. (I am including composite numbers with only one factor in this list). These are then examples of the class of numbers I am looking to identify.

Without going into the details and reasoning for asking this question (unless it helps in finding the answer), I am initially curious if such a class of composites have been identified, and if so, perhaps there may be some significance that can shed some light on my problem.

Any insights, thoughts?

Thanks!
-Jeffrey
 
Mathematics news on Phys.org
Thanks Stephen,

I think your suggestion is helping me to converge on the answer, although I clearly said that I am looking at composite numbers only. However I think that if I take the series pointed out (sequence A246655 in OEIS), and strip out all the primes, I will have the set I am looking for :)

My intuition tells me that this is right because fractals (as I am exploring them with tilings in lattices) obey power laws.

Thanks!
-j
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top