MHB Im assuming a factorization problem?

  • Thread starter Thread starter Ilikebugs
  • Start date Start date
  • Tags Tags
    Factorization
Ilikebugs
Messages
94
Reaction score
0
See attached image.
 

Attachments

  • 8760b55089b34e1393e60bacf6d2a0ad.png
    8760b55089b34e1393e60bacf6d2a0ad.png
    32.9 KB · Views: 97
Mathematics news on Phys.org
Hi Ilikebugs and welcome to MHB! :D

It is preferable that you attach images to your post instead of linking to an image site, which may be unreliable. I've attached the image you linked to.

Also, we ask that users show some effort when posting questions so we may best know how to help. Why do you think the problem may involve factoring?
 
Well I have to justify why the shortest path is the shortest one. I can't find any way to justify why. The shortest path I've found is 13.
 
Ilikebugs said:
Well I have to justify why the shortest path is the shortest one. I can't find any way to justify why. The shortest path I've found is 13.

Hi Ilikebugs! That's a nice problem! ;)

The shortest I've found is 13 as well and I have no "hard" justification.
Perhaps only a "fuzzy" justification is needed?
Such as that it's the shortest path the goes between the King's Lake and the King's Forest.
And we might mention that without those 2 obstacles, we could get to 9.
Btw, what makes you think it's a factorization problem?
 
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.

Similar threads

Back
Top