Showing on-line P = NP

I have developed a theorem that proposes a method to build algorithms. All the algorithms produced by this method are in P … they never go up to more than $ 6(n^{12})$ operations.

Following that, I have defined an algorithm to resolve the TSP-metric. I agree that $ 6(n^{12})$ is a lot, but it is $ P$ and it is the limit of n trending to infinite. For $ n < 45$ the performance is $ 5(n^9)$ .

First question: Assuming the theorem is correct, Is this enough to proof $ P = NP$ ?

Before publishing the results and the method in a paper, I want to show on-line that the algorithm is in $ P$ . I can produce an exact result of 45 cities in less than a half of a day since the Held-Karp algorithm will need more than 16 days.

I will certify with a cloud computing provider the host hardware used, but source code will be black-boxed. Inputs will be provided by anyone and she/he/they may be the only one(s) that know(s) the solution.

Second question: Is this “show” good enough/idea to prove that I actually have solid evidence of it is not a fake?

Important to note that its purpose is only to claim attention showing evidence not substituting the proof of the theorem, I´ll make it publish (public-free) as soon as it will be demanded, I won’t keep it in secret. The reason to do this “show” is that being no one if I publish the “theorem” no one gives it a chance. I have checked that way.

Local Burp Proxy not showing routed packets

I created a hotspot on wlp2s0 and connected an android device, whose IP is 10.42.0.62.

I am trying to route my all packets from my wlp2s0 interface to burp proxy which running on 8080 and I also enabled invisible proxy, but still no luck

I am routing packets using this firewall rule

iptables -t nat -A PREROUTING -s 10.42.0.62 -p tcp -j REDIRECT --to-ports 8080 

After enabling this rule Internet access on device stops working means rule is working, but burp proxy is not showing any data flow.

Please anybody point out what I am doing wrong, I wasted many hours in this.

Update: I was trying Burp Proxy on PC browser and was playing with proxy settings like Socks5 and resolve dns over Socks5 and then burp proxy stopped working even on PC browser. So I think when I route packets through Burp then it not resolves DNS queries and then my android stucks at DNS requests and there is no flow of TCP packets, that’s why Burp Not showing anything. So, I think main question is how we can resolve DNS queries through Burp Proxy.

my site not showing on google ecen with good seo

gymarket.ir

hello there. that’s my website. i get help of yoast seo tool, every thing is fine as yoast seo informed me, i selected my main keywords and my site is indexed well but i can’t find my website on google results even in last page.

site:gymarket.ir is showing my website goods but by searching wordkey i can never find my site.

do i need some backlinks to appear in google? dofollow backlinks? stack overflow has very good DA but its nofollow. please help me to find my problem. please an expert give me his gmail to add to my google console to check my website.

Showing that the quotient function is primitive recursive

I’m asked to show that the quotient function is primitive recursive. I know that the operation of integer division $ div$ is not total, as it is not defined when the denominator is zero, and a recursive function has to be total by definition.

So I could give a function $ div’$ and define a value for the case that the denominator is zero: $ div'(x,y) = 0$ if $ y = 0$ , otherwise $ div'(x,y) = div(x,y)$ . But this is still not primitive recursive because of $ div$ . How can I go about proving that the quotient function is actually primitive recursive? Should it somehow be built from scratch? Any help would be appreciated.

Showing that the class of regular languages are closed under merging / modified shuffle

Consider $ ab$ and $ cd$ which are two words. We merge these two into 6 possibilities: $ abcd, acbd, acdb, cabd, cadb, cdab$

So in general, a merge of words/sequences $ x, y ∈ Σ∗$ , is a word of length $ |x| + |y|$ with both $ x$ and $ y$ as disjoint subsequences in it.

For two languages $ L1$ and $ L2$ their merge is defined as the set of all possible merges of two words $ x ∈ L1, y ∈ L2$ .

So basically, a merge is a modified shuffle and should be of length that of the sum of the length of two languages, and should also be in order (see $ ab$ and $ cd$ example, as $ b$ could not come before $ a$ ).

I was thinking of just connecting the states of all $ L1$ and $ L2$ but this seems wrong as if you connect them all like a fully connected graph, one can jump and go back which is not acceptable.

What’s a basic idea on the construction I could do to prove this?

WooCommerece REST API Api not showing all subcategories by parent

I’m requesting to the following endpoint

wp-json/wc/v3/categories?parent=someID

and getting a response for the first 2 children my problem those children has also children (deeply nested here of categories as showing on the image below ), I need to show all subcategories under a specific parent os how I can do this? enter image description here

My website on checking showing 403 error on HTTP Status [on hold]

My website is running fine but when I check on the https://httpstatus.io/, it is showing the 403 error and also on the Google page insights, it is not showing the report.

My website DNS is currently pointing to the Cloudflare and previously I have installed the Cloudflare plugin in my WordPress and now I have uninstalled it.

If I removed my website from Cloudflare, the problem will be solved or not, Or it will affect my website.

Any help is much appreciated. Thanks In Advance.

Showing multi list and drop down hierachy on page

We are dealing with Roles and assigning users to the Roles. Some of Roles which are Admin are not dependant on Context ( Environment – Production, Demo, Developement ), and some ( portal roles) are dependant on Context. So in the flow, we chose a Role and assign Users as below :

Flow : 1. User selects a role from left 2. Then selects a context 3. Select Users from Available users list and assign to Role

enter image description here

Portal Role having single context

enter image description here

Portal Role having multiple Contexts ,you can select from dropdown and then assign Users

enter image description here

So any advice or suggestions to make it more understandable the flow to users? This was created by other designer and I have to modify it to make it better.

Showing np complete for subset sum variation

The subset sum problem is where you are given a set of integers $ S={x1,x2,…,xn}$ and you want to find a subset $ S′⊆S$ such that its sum equals some k. I already know this problem is NP complete and I’ve seen the proof for it using 3-SAT.

However, what if there was an added condition that we would return YES if the entire set was made up of the same integer? So we return yes if some subset equals $ k$ OR if the set has all the same numbers.

I know this is NP, but I’m struggling to choose which problem to reduce from to show NP completeness.

My question is, what problem should I try to reduce from to make this as easy as possible? I’ve been stuck on this for hours…