Recent content by secondprime

  1. S

    Condition for Power Diophantine Equation

    Do you have any specific question @ certainly?
  2. S

    Condition for Power Diophantine Equation

    understand, consider the equation class considered above does not have different kind/class of function/ algebraic expression as a solution.
  3. S

    Condition for Power Diophantine Equation

    @micromass, don't you think its highly unlikely that general solution would have different kind/class of expression??
  4. S

    Condition for Power Diophantine Equation

    Nice example ! I understand now. but if I am not wrong two function of your example seem different to me, I think ##cosx, sinx## goes to transcendent class( Lindemann-Weierstrass) , I did not have this kind of situation in my mind though I wrote "could be transcendental,irrational...
  5. S

    Condition for Power Diophantine Equation

    for each integer ##a##, an integer solution of the equation can be found and as ##a## increases ##g_1,g_2,g_3## increases, because when these ##g_1,g_2,g_3## are plotted on 2D, it can be noticed that from one integer point to another bigger integer point,each of these ##g_1,g_2,g_3## moves...
  6. S

    Condition for Power Diophantine Equation

    it was an example of power Diophantine equation , The human race don't know general solution of every power Diophantine equation. I already gave an example of the idea, why you need this particular equation's example? looks like a threat to me ! is it really necessary ?
  7. S

    Condition for Power Diophantine Equation

    it can be multi-variable, more than 1 variable may be required for general solution. as answered above, you can have more than 1 variable, keeping one variable and other constant, you can be sure of what I said. it is regarding brocards problem which you closed.
  8. S

    Condition for Power Diophantine Equation

    Sir, I am sorry for you inconvenience, nothing has changed, I will try my best to clarify. Sir, these are basic assumption. you assume these facts to be true and consider 2 observations under these 2 assumption. I do not dare to ignore your question. I thought re-posting would clear. (FLT...
  9. S

    Condition for Power Diophantine Equation

    There has been an arrangement problem, please check this post, let me know if any edit work is needed. Below 2 facts are given - 1.A power Diophantine equation of ##k## variables. 2. there exists a “general solution” (provides infinite integer solutions) to the equation which makes the...
  10. S

    Condition for Power Diophantine Equation

    **Observations:** Given a power Diophantine equation of ##k## variables and there exists a “general solution” (provides infinite integer solutions) to the equation which makes the equation true for any integer. 1. The “general solution” (provides infinite integer solutions) is an...
  11. S

    Combinatorial Algorithm for Sorting Adjacency Matrices in Polynomial Time

    Consider ##G## as a strongly ##k## regular graph G(srg(##n,k,\lambda ,\mu##);##\lambda ,\mu >0##).
  12. S

    Combinatorial Algorithm for Sorting Adjacency Matrices in Polynomial Time

    that discussion was incomplete and was the general case, this more specific. It would easier, if this thread is concluded.
  13. S

    Combinatorial Algorithm for Sorting Adjacency Matrices in Polynomial Time

    Given a matrix A of a regular graph G. The matrix A can be divided into 4 sub matrices based on adjacency of vertex ##x \in G##. ## A_x## is the symmetric matrix of the graph ##(G-x)##, where ##C## is the symmetric matrix of the graph created by vertices of ##(G-x)## which are adjacent to...
  14. S

    Help to write a psudoecode (formal) of this procedure.

    This is the core idea- https://www.physicsforums.com/threads/complexity-analysis-problem-of-an-algorithm.812931/ I would like to write a formal psudoecode (latex), but as new writer I am having hard time to write, whatever I wrote is not easy to understand, so i would appreciate forum...
  15. S

    Complexity Analysis problem of an Algorithm.

    I made a presentation according to the algorithm I described, click the below link, https://www.academia.edu/11354697/Graph_regular_Isomorphism_in_n_O_log2_n_ Ignore the complexity analysis( which is bigger than the above post).
Back
Top