## Given sum of sequences, choose two sequence elements and make other sequence zero with making some sequence vanishes and others keep untouched

Slightly modified from my previous question Making function for a given input of sum of sequences, choose two sequence $a_i, b_j$ and substitute all other sequence zero

At this time I want to make among many sequences, just pick two sequences and other kept untouched.

For example

input = a1a2b1b2c2c3 + 100a1b2d1 + a1c2b2d3 + a1a2 + a3c1c2 + a3c1 + d1a2 + d2c1

If I choose two sequences $$a$$ and $$b$$, and pick its elements as $$a_1, b_1$$ then I want to put all other sequences of $$a,b$$ are zero with additionally make all $$c$$ vanishes but $$d$$ kept remained.

For example if my input is something like $$f[input, a1,c1]$$ then $$a2=a3=0, c2=c3=0$$ with vanishing sequence of b1,b2,.. but kept $$d1,d2\neq 0$$.

Maybe to be more specified, I want to make function which have [input, sequnece1_{i}, sequence2_{j}, sequence3], where sequence1, sequuence2, have non-zero element for i,j respectively, and the other elements of sequence 3, vanishing for given a,b,c,d,e.,,, sequences.

## Plotting relationship between two variables when their relationship is given by a polynomial (2)

I would like to plot the following function $$p$$ in the $$x$$-axis and $$V$$ in the $$y$$-axis. The function is given by:

62.77142857142857*(6.5+2*(18.57 - V))*(0.005*p*(18.57-V)+(6.5+2 *(18.57-V))*V)*(0.01*p*(18.57-V)+(6.5+2*(18.57-V))*V)*(0.01 *(0.65+ 0.01*(18.57-V))+0.002275*(18.57-V)*V)+0.01*(65+0.0017499999999999998*(18.57-V))*(18.57-V)*((6.5 +2*(18.57-V))*V*(0.005*p*(18.57-V)+(6.5 +2*(18.57-V))*V)-(6.5+2*(18.57-V))*V*(0.01*p*(18.57-V)+(6.5 +2*(18.57-V))*V)+2*(0.005*p*(18.57-V)+ (6.5 +2*(18.57-V))*V)*(0.01*p*(18.57-V)+(6.5+2*(18.57-V))*V))*(-0.05869954325800593*(18.57-V)+0.39*(6.5+2*(18.57-V))*(0.01*(0.65+0.01*(18.57-V))+0.002275*(18.57-V)*V))=0

Note:

I posted a similar question yesterday and @Bob Hanlon was kind enough to provide me with a very helpful code. I tried doing the same thing for this polynomial today, and Mathematica shows an error.

## Given A and B, how to find C if A = CBC?

Given

`A={{0,1,1,0},{1,0,0,-1},{-1,0,0,1},{0,1,1,0}}

and

B={{0,1,0,0},{0,0,0,0},{0,0,0,1},{0,0,0,0}}

and

A=C.B.C, how to find C?

## Given a set of SQL scripts, does there exist software that generates a dependency tree of SQL scripts starting with the root SQL script?

I have a about 100 *.sql scripts located in a directory (let’s say script1.sql, script2.sql, …., script100.sql).

Some of these scripts create tables, some create triggers, some create functions, etc..

Without manually looking through each of the 100 scripts, it is not immediately clear to me which script depends on other scripts.

Is there a software/program out there that, when given as input a directory of SQL scripts, can output a dependency tree, starting with the root SQL script?

## Is it possible to ask Mathematica to give all the roots of the given function?

I have this equation

$$36 \cos \frac{3 x}{4} \cos \frac{27 x}{20} \left(\cos \frac{3 x}{5} +2 \cos \frac{21 x}{10} \right)=0$$

Is it possible to ask Mathematica to give all the roots of the function on the domain $$0? Preferably as a rational multiple of $$\pi$$? (the plot of the function is attached)

36 Cos[(3 x)/4] Cos[(27 x)/20] (Cos[(3 x)/5] + 2 Cos[(21 x)/10]) == 0

## How to spawn an object at a given position and angle?

Let’s say I have an enemy at position ( 150, 150 ) in my screen and I want it to shoot a bullet from its position at an angle of 315° (south-east if we’re cosidering a regular unit circle)…

I’ve tried doing something like this (pseudo-code):

bullet.xpos = enemy.xpos + (cos(315) * bullet.radius )

bullet.ypos = enemy.ypos + (sin(315) * bullet.radius )

The idea is to change the bullet’s position by increasing its radius…

However, the problem with this code is that the angle at wich the bullet gets placed it’s not really the one specified (315° in this case) because of course, the final result going into the bullets position gets influenced by the enemy’s position ( bullet.xpos = enemy.xpos… and bullet.ypos = enemy.ypos… ) but I still need to consider it since it will be the starting point for the bullet.

I might be overlooking something but I’m not sure how to actually do this… Thanks for taking the time

## Is Additional Fighting Style underpowered as the only class feature at a given level?

This question is inspired by considering minor homebrew improvements to the Champion subclass, which is frequently but not universally considered a weak subclass.

Looking at the class features, the following occurred to me about Additional Fighting Style (level 10):

1. Most fighting styles don’t synergize. The main exception is taking both a defensive and offensive fighting style, leading to common recommendations of Defense as the go-to choice for level 10 Champions.
2. Every class that gets a first fighting style gets additional features at that level (e.g. Spellcasting for level 2 Paladins and Rangers).

So Additional Fighting Style by itself seems pretty weak compared to the level 10 features of other fighter subclasses. Hence the question.

## Where do I see a full, exhaustive list of the resources a given Google Cloud Platfrorm project uses?

I have just logged in to a Google Cloud Platform account, and it has several old Projects. I’d like to clean up by deleting the ones I don’t need, but for that I need to see a full list of services each Project uses.

I went to the Cloud Resource Manager, and it mentions a Compute Engine Service Agent here and there, but that’s it. I know one of those Projects must have some API Keys that I still need, but neither this page, nor the Billing page tell me which one.

Searching didn’t help. This looks like the closest, but doesn’t make any sense to me and looks overcomplicated for such a simple task.

Is there one single page that will show me everything a given Project uses, so I am informed enough to decide if I still need it? Please help!

## How can I find in mathematica if my equation have solution or not on a given interval?

I’m new to mathematica, I usually used wolfram alpha, however since the equation that I’m working with is a long equation I need to use mathematica. This is an example of the problem. So, I want to know if the equation will have solution or not when m>=4 and n>=3.41421m. I don’t know what command to use and when I enter this, it said that m>=4 is not a valid variable. What should I do?

Solve[{Binomial[n-1,2]-2[(Binomial[m-1,2])+(n-m)(m-1)-1]<=0}, {m>=4, n>=3.41421m}, Reals]