Are you a university or school looking for an online tutoring partnership ?

s were written to make slicing a low memory task by storing each triangle at a single place.
We already have code to do the following:
A Generator that returns a triangle one at a time from an STL file (specifically an ASCII STL file). It Return the triangle as a list of 3D points (tuples), ignoring the normal. (from HW4)
A function that takes a list of line segments, each line segment is a list of 2D points (tuples) and returns a single list of 2D points where the start of one segment is the end of another. ( from HW 3)
A function that converts a list of 2D points to G-Code (lab 2)
A function that writes GCode to a file
To make a slicer you need to:
Write a function that calculates the intersection of a triangle with a horizontal plane. The input of the function should be a list of 3D points (tuples). It should return a list of 3D points. See this website for hints on the mathematics http://geomalgorithms.com/a06-_intersect-2.html#Triangle-Plane (Links to an external site.)
( https://web.archive.org/web/20180706054857/http://geomalgorithms.com/a06-_intersect-2.html (Links to an external site.) )
Next you need to combine all of these different functions into a single workflow that takes in an STL file, a slicing height, print temperatures, movement speed , and extrusion speed and returns a G-code String which prints the walls of the STL file. It should have an outer iteration over slice heights of the STL, for each slice height, it should scan all triangles and make a list of the line segments that intersect the plane at that Z height. Then it should order those segments into a list of points. That list of points is then converted into gcode movement and extrusion commands. The entire system combines these slices with setup and shutdown Gcode for the ender 3 printer to make the print job. You may write to a file a layer at a time or at the end.
Once the slicer is done:
Run the previous function with a vase file such as one of the following files:
https://www.thingiverse.com/thing:126567/files
https://www.thingiverse.com/thing:42570/files
https://www.thingiverse.com/thing:31722/files
https://www.thingiverse.com/thing:2795194/files
Submit your code as a Jupiter notebook with the .gcode in it and, and an image of your print.

View More
ooking at how likely a given email is to be spam based on the words it contains. In particular, in this problem we’re going to count how often words are present in spam emails within some set of training data (which here means a set of emails that have already been marked as spam or not spam manually).
We have already started to write a function spam_score(spam_file, not_file, word), which takes in two filenames, along with a target word (a lowercase string). Both filenames refer to text files which must be in the same directory as hw07.py (we’ve provided several such files in hw07files.zip). The text files contain one email per line (really just the subject line to keep things simple) - you can assume that these emails will be a series of words separated by spaces with no punctuation. The first file contains emails that have been identified as spam, the second contains emails that have been identified as not spam.
Since you haven’t learned File I/O yet, we’ve provided code that opens the two files and puts the data into two lists of strings (where each element is one line - that is, one email). You then must complete the function, so that it returns the spam score for the target word. The spam score is an integer representing the total number of times the target word occurs across all the spam emails, minus the total number of times the word occurs in not-spam emails. Convert all words to lowercase before counting, to ensure capitalization does not throw off the count.

View More
. I'm really close to completing it and I'm really stuck on this one situation and I don't know how to solve it. So right now I'm making a guessing game and every time you play the program tells the user how many guesses it took for them to get the answer. And what I need to do is to make sure that I get and isolate the lowest amount of guess and put it into the statistics function so that way it can print out the lowest amount of guesses that I got. Right now it isn't working and I really don't know why as it seems to be mostly adding up all the guesses until the last few. Here's my code:
#include
#include
#include
#include
void haiku(){
printf("Welcome to the game.\n");
printf("Guess a number within range.\n");
printf("Win cool prizes here.\n\n");
}
int compare(int guessiso){
int lowestvalue=0;
int biggervalue=0;
if(guessisooperand){
printf("It's lower.\n");
count++;
isolatedcount++;
}
else if(user0){
lowguess=compare(x);
x=one_game(count);
count=x;
printf("Do you want to play again?\n");
scanf("%d",&usertwo);
userthree=usertwo;
gamecount++;
}
statistics(gamecount,x,lowguess);
}

View More
certain objects. So in this case, I derived a log spiral equation in polar coordinates to model an spiral galaxy. I plan on finding the area as well as volume of the galaxy using the function which I have derived. So is there any way, I could integrate these spiral functions to find area?

View More
subgame perfect Nash equilibrium?
Question 3: In which situations should we need the mixed extension of a game?
Question 4: Find, if any, all Nash equilibria of the following famous matrix game:
L R
U (2,0) (3,3)
D (3,4) (1,2)
Question 5: What is the difference between a separating equilibrium and a pooling equilibrium
in Bayesian games?
Question 6: Give another name for, if it exists, the intersection of the players’ best-response
« functions » in a game?
Question 7: assuming we only deal with pure strategies, the Prisoner’s Dilemma is a situation
with:
No Nash equilibrium One sub-optimal Nash equilibrium
One sub-optimal dominant profile No dominant profile
Question 8: If it exists, a pure Nash equilibrium is always a profile of dominant strategies:
True False
Question 9: All games have at least one pure strategy Nash equilibrium:
True False
Question 10: If a tree game has a backward induction equilibrium then it must also be a Nash
equilibrium of all of its subgames:
Tr
2/2
Question 11: The mixed Nash equilibrium payoffs are always strictly smaller than the pure
Nash equilibrium payoffs:
True False
Question 12: Which of the following statements about dominant/dominated strategies is/are
true?
I. A dominant strategy dominates a dominated strategy in 2x2 games.
II. A dominated strategy must be dominated by a dominant strategy in all games.
III. A profile of dominant strategies must be a pure strategy Nash equilibrium.
IV. A dominated strategy must be dominated by a dominant strategy in 2x2 games.
I, II and IV only I, II and III only II and III only
I and IV only I, III and IV only I and II only
Question 13: A pure strategy Nash equilibrium is a special case of a mixed strategy Nash
equilibrium:
True False
Question 14: Consider the following 2x2 matrix game:
L R
U (3,2) (2,4)
D (-1,4) (4,3)
The number of pure and mixed Nash equilibria in the above game is:
0 1
2 3
Exercise (corresponding to questions 15 to 20 below): assume a medical doctor (M)
prescribes either drug A or drug B to a patient (P), who complies (C) or not (NC) with each of
this treatment. In case of compliance, controlled by an authority in charge of health services
quality, the physician is rewarded at a level of 1 for drug A and 2 for drug B. In case of noncompliance, the physician is « punished » at -1 level for non-compliance of the patient with
drug A and at -2 level for non-compliance with drug B. As for the compliant patient, drug A
should give him back 2 years of life saved and drug B, only 1 year of life saved. When noncompliant with drug A, the same patient wins 3 years of life (due to avoiding unexpected
allergic shock for instance), and when non-compliant with drug B, the patient loses 3 years of
life.
Question 15: You will draw the corresponding matrix of the simultaneous doctor-patient game.
Question 16: Find, if any, the profile(s) of dominant strategies of this game.
Question 17: Find, if any, the pure strategy Nash equilibrium/equilibria of this game.
Question 18: Find, if any, the mixed strategy Nash equilibrium/equilibria of this game.
Questions 19 and 20: Now the doctor prescribes first, then the patient complies or not: draw
the corresponding extensive-form game (= question 19) AND find the subgame perfect Nash
equilibrium/equilibria (=

View More
rts to the fireworks platforms: one part is on the ground and the
other part is on top of a building. You are going to graph all of your results on one
coordinate plane. Make sure to label each graph with its equation. Use the following
equations to assist with this assignment.
• The function for objects dropped from a height where t is the time in
seconds, h is the height in feet at time it t, and 0 h is the initial height is
2
0 ht t h ( ) 16 =− + .
• The function for objects that are launched where t is the time in seconds, h is
the height in feet at time t, 0 h is the initial height, and 0 v is the initial velocity
in feet per second is 2
0 0 ht t vt h ( ) 16 =− + + .
Select the link below to access centimeter grid paper for your portfolio.
Centimeter Grid Paper
Task 1
First, conduct some research to help you with later portions of this portfolio
assessment.
• Find a local building and estimate its height. How tall do you think the
building is?
• Use the Internet to find some initial velocities for different types of fireworks.
What are some of the initial velocities that you found?
Task 2
Respond to the following items.
1. While setting up a fireworks display, you have a tool at the top of the
building and need to drop it to a coworker below.
a. How long will it take the tool to fall to the ground? (Hint: use the first
equation that you were given above, 2
0 ht t h ( ) 16 =− + . For the building’s
height, use the height of the building that you estimated in Task 1.)
b. Draw a graph that represents the path of this tool falling to the
ground. Be sure to label your axes with a title and a scale. Your graph
should show the height of the tool, h, after t seconds have passed.
Label this line “Tool”.

View More
goal is to look to 1) at the fractal nature of the turnover time as a function of initial conditions such as https://en.wikipedia.org/wiki/Double_pendulum#Chaotic_motion. 2) calculating the Lyapunov exponent of the system by looking at separation times of very close initial conditions. Can you help me with this project? I have very limited knowledge on Matlab.

View More
function is to test modeling with function

View More
delines must follow.
The purpose of this assignment is to give you practice using structs, using strings, writing functions and sorting. You will read a student file into an array of structs, determine grades, sort the array and print it out.
Program Steps and Requirements
Use the Student struct shown below.
Read the input file (partially shown below) and store the data in an array of structs. The input file contains 55 student records and one heading line.
Write code to determine the grade for each student. The grade determination is exactly as specified for this class in the syllabus. Remember to discard the lowest assignment grade.
Sort the array of student students in descending order by the total points.
Write the output file using the exact format shown below and include the two lines of headings in the output.
Required Student struct and named constants
const unsigned NumberOfStudents = 55;
const unsigned PointsPossible = 400;
const unsigned NumberOfAssignments = 10;
const unsigned NumberOfExercises = 10;
struct Student
{
int id;
string name;
int exercise[NumberOfExercises];
int assignment[NumberOfAssignments];
int midterm;
int final;
int codelab;
int exerciseTotal;
int assignmentTotal;
int totalPoints;
int percent;
string grade;
};
Input file
-StudId- -------Name-------- -----Exercises----- ---------Assignments--------- Mi Fin CL
12345678 Smartiepants, Sam 5 4 5 4 5 5 5 5 5 5 20 19 20 20 20 20 19 20 20 19 65 98 9
18519268 Mendoza, Victor 4 2 5 4 1 4 5 5 5 4 17 12 17 18 14 17 19 18 14 18 59 49 6
23276929 Chien, Shengfeng 2 3 0 4 4 5 2 5 5 2 9 18 15 8 19 18 18 16 19 13 64 89 8
18242679 Dhaliwal, Shawn 5 5 3 4 5 4 2 4 4 5 9 18 17 15 18 19 12 15 18 14 45 92 9
09869966 Miraftab, Mina 5 3 5 5 3 5 4 0 4 3 17 4 3 18 12 16 14 17 17 12 52 68 7
10930997 Dimas, Abraham 5 3 4 5 4 3 4 3 3 3 12 18 20 11 14 7 15 10 18 15 64 89 6
11545560 Masongsong, Mikhael 1 3 5 4 3 4 5 3 5 5 19 19 9 13 17 20 20 14 14 19 64 96 8
10626377 Zigler, Joshua 4 3 4 3 2 5 4 4 4 5 17 14 18 20 17 18 12 19 14 14 51 90 5
...
Output report file
Stud Id Name Ex Ass Mi Fin CL Tot Pct Gr
-------- ------------------- -- --- -- --- -- --- --- --
12345678 Smartiepants, Sam 48 178 65 98 9 398 100 A+
11545560 Masongsong, Mikhael 38 155 64 96 8 361 90 A-
20767544 Martins, Gustavo 40 144 67 97 10 358 90 A-
23305464 Zumwalt, Jacob 37 160 62 90 8 357 89 B+
23579439 Feirstein, Berent 42 159 55 91 9 356 89 B+
14965959 Ho, Brandon 40 157 66 84 8 355 89 B+
19988142 Wang, Lu 31 157 58 98 9 353 88 B+
09559062 Mora, Gabriel 36 137 67 100 7 347 87 B
19108176 Bailey, Tanequa 44 152 56 85 8 345 86 B
Suggested main function
int main()
{
Student students[NumberOfStudents];
getStudentDataFromFile(students, InputFilename);
determineGrades(students);
sort(students);
printStudentDataToFile(students,OutputFilename);
}

View More
lve an equation, find the derivative of a function at a point, or calculate the value of a definite integral. However, you must clearly indicate the setup of your question, namely the equation, function, or integral you are using. If you use other built-in features or programs, you must show the mathematical steps necessary to produce your results. Your work must be expressed in standard mathematical notation rather than calculator syntax.
Show all of your work, even though the question may not explicitly remind you to do so. Clearly label any functions, graphs, tables, or other objects that you use. Justifications require that you give mathematical reasons, and that you verify the needed conditions under which relevant theorems, properties, definitions, or tests are applied. Your work will be scored on the correctness and completeness of your methods as well as your answers. Answers without supporting work will usually not receive credit.
Unless otherwise specified, answers (numeric or algebraic) need not be simplified. If your answer is given as a decimal approximation, it should be correct to three places after the decimal point.
Unless otherwise specified, the domain of a function f is assumed to be the set of all real numbers x for which f(x) is a real number.
Let f be a twice-differentiable function such that f′(2)=0 . The second derivative of f is given by f′′(x)=x2e2−x−1 for 0≤x≤6 .
(a) On what open intervals contained in 0
View More

13.- I was very sick for a while so I don't really know what I am doing * This homework ...

eation of several BST functions * We have to use Valgrind * We have to create a memory struct that provides a compare function for insertion * The above needs to contain two fields of unsigned int, representing memory address and size int memory_addr_cmp(const void* x, const void* y){ //TODO return 0; } By the instructions: "This function takes two arguments, const void* x and const void* y, you will need to cast both of them to type "memory*", and make comparisons. If x is less than y, return -1. If x is greater than y, return 1. If they are equal, return 0;" Also per the instructions, concerning the BST functions "Note, in particular, that there are two separate structus - the node struct that describes information for a single node in the tree, and a bst struct, that holds the root pointer and a function pointer to the comparison function being used for this tree. When you first create the tree, you pass in the comparison function, and this will be used for all functions that need it thereafter. Therefore, after that, you don't need to specify the comparison function to bst-level functions. The stored function pointer is then passed to the node-level functions." So then we have to create allocation and initialization functions for both the BST and one for the node. * nod_insert, BST_insert then inorder_traversal

View More
nbow is the shape of a parabola.
The equation for this parabola is y = -x2 + 36.
Graph of a parabola opening down at the vertex 0 comma 36 crossing the x–axis at negative 6 comma 0 and 6 comma 0.
Create a table of values for a linear function. A drone is in the distance, flying upward in a straight line. It intersects the rainbow at two points. Choose the points where your drone intersects the parabola and create a table of at least four values for the function. Remember to include the two points of intersection in your table.
Analyze the two functions. Answer the following reflection questions in complete sentences.
What is the domain and range of the rainbow? Explain what the domain and range represent. Do all of the values make sense in this situation? Why or why not?
What are the x- and y-intercepts of the rainbow? Explain what each intercept represents.
Is the linear function you created positive or negative? Explain.
What are the solutions or solution to the system of equations created? Explain what it or they represent.

View More
e a look at this spreadsheet so I can properly explain:
https://docs.google.com/spreadsheets/d/1lEJIPiSZJk9LYUTSA4oeDwyLXCVd18Zdewm6gnjxcXo/edit?usp=sharing
Ok, so for the sake of simplicity We'll just go with row two here. Cell A2 represents the hours worked freelancing, where B2 is for the minutes of the recorded time frame. C2 is the net amount earned in that time. Over in cell N10 I need to figure out an equation using the =SUM() function (treats it as a normal math problem) where it prints the hourly income based on those three integers. I'll admit i was never great at math, but in my defense I've been up since 6 am yesterday (currently 3 pm) and have been running solely on caffiene and nicotine haha... The sheet is editable and I can see any changes you make in realtime. Is there any way you could help me out on this one? It's for a work report type thing.

View More
sed tot he parent function f(x)=x^2 . My main question is why do we use this and when do we use this. (is a translation to the left considered the same thing?) I've only found 1 example other that the one I've shown you in the textbook, but it was with on Axis of symmetry at the origin so it really did nothing.

View More
ping off a cliff into the river. Your height as a function h(t)=-16t^2+16t+370 where t is the time in seconds and h is the height in feet.
a. How Long did it take to reach your maximum height?
b.What is the highest point you reached?

View More
You will use a single backing array(instead of two) and two hash functions (both MultiplicativeHashFunction objects), h1 and h2.
The z values for your hash functions (and all subsequent hash functions needed when resizing or rehashing) will be taken from an array of integers passed to the CuckooHashTable constructor. The first value in the array will be used for the first incarnation of h1, the second value for the first incarnation of h2, the next two values will be used for the next incarnations of h1 and h2, etc.
Note: be careful to follow this. We will be checking your array (via toString()) and correctness will depend on using the same values of z as we do when generating the test code. The MultiplicativeHashFunction objects you will use also have a getParams() method to show the value of z,w,d when that hash function is used.
When adding an item, x, that is not in the hash table already, always add it to t[h1(x)] (even if t[h1(x)] is already taken and t[h2(x)] is available).
The load factor must always satisfy α=n/t.length≤1/2. If adding an item will violate this then resize the table (doubling its size) and rehash everything (before doing the add).
After removing an item, if the load factor satisfies α=n/t.length<1/8 AND the dimension satisfies d≥5 then resize by reducing the size of the bucket table by a factor 2 and rehash everything.
Each time you resize you will create two new hash functions using the next two z values (that were initially passed to the constructor).
Your constructor should initialize an empty bucket array of size 16 (i.e., d=4). This is the minimum size your bucket array should ever be. Never let the dimension be smaller then 4.

View More
he efficacy of this spending is therefore relatively important. When it comes to contagious diseases, there are generally two strategies that can be adopted. The first involves prevention, which includes vaccinations to lower or eliminate the risk of contracting a disease. The second involves treatment of those unfortunate enough to get sick, treatment typically requires some form of a drug. Since pharmaceutical companies can produce both vaccines and drugs, we would like to understand the incentives they have to develop each type of medicine. To explore this question, consider a population of 100 consumers, 90 of whom have a low disease risk, say 10%. The remaining ten have a high risk – to make things simple, assume they are certain to contract the disease. In addition, suppose the disease generates personal harm equal to the loss of $100 for each individual when they are infected. Suppose also that pharmaceuticals of either form (vaccines or drugs) are costless to produce (once R & D has occurred) and are perfectly effective
Question 2. What price would a profit maximising monopolist charge for a vaccine? What are the monopoly profits on the vaccine? What is the efficient outcome (i.e. SMB = SMC)? What is the welfare under the monopoly and at the efficient allocation?
Question 3.Now consider the demand for the drug (assume that the vaccine is not available). Construct the demand function for the drug and plot it on a diagram. What price would a profit maximising monopolist charge for the drug? What are the monopoly profits from the drug? What is the efficient outcome? What is the welfare under the monopoly and at the efficient allocation?
Question 4. If the R&D costs of the vaccine and drug are the same, what will the pharmaceutical company do? Explain your answer in terms of the variation in the willingness to pay and the size of the R& D costs. What would a social planner do?
Question 5. What are the R&D cost for the vaccine and the R&D cost for the vaccine drug that would make a pharmaceutical company indifferent between developing the vaccine and the drug? Is the social planner indifferent in this case? Explain any difference.

View More
les can perform all normal functions at temperatures approaching 90 degrees celsius, while the DNA polymerase found in most bacteria cannot function at such extreme temperatures. Describe the differences in protein structure that could account for such variance in temperature resistance
2) Large nonpolar molecules can be dissolved into polar liquids in the presence of a class of compounds known as surfactants. This process is crucial in the digestion of lipids and the production of these compounds is the primary role of the gall bladder. Describe how the compounds produced in the gall bladder are able to increase the solubility of lipids in the polar environment found within the small intestine.

View More
Hash( const string & key, const int h_size )
{
unsigned int value = 0;
for ( int i=0; i
View More

list uses dynamic memory allocation to grow as the size of the data set grows. Unlike linked lists, a binary search tree is very fast to insert, delete and search.
Project Description
When an author produce an index for his or her book, the first step in this process is to decide which words should go into the index; the second is to produce a list of the pages where each word occurs. Instead of trying to choose words out of our heads, we decided to let the computer produce a list of all the unique words used in the manuscript and their frequency of occurrence. We could then go over the list and choose which words to put into the index.
The main object in this problem is a "word" with associated frequency. The tentative definition of "word" here is a string of alphanumeric characters between markers where markers are white space and all punctuation marks; anything non-alphanumeric stops the reading. If we skip all un-allowed characters before getting the string, we should have exactly what we want. Ignoring words of fewer than three letters will remove from consideration such as "a", "is", "to", "do", and "by" that do not belong in an index.
In this project, you are asked to write a program to read any text file and then list all the "words" in alphabetic order with their frequency together appeared in the article. The "word" is defined above and has at least three letters.
Note:
Your result should be printed to an output file named YourUserID.txt.
You need to create a Binary Search Tree (BST) to store all the word object by writing an insertion or increment function. Finally, a proper traversal print function of the BST should be able to output the required results.
The BST class in the text can not be used directly to solve this problem. It is also NOT a good idea to modify the BST class to solve this problem. Instead, the following codes are recommended to start your program.
//Data stored in the node type
struct WordCount
{
string word;
int count;
};
//Node type:
struct TreeNode
{
WordCount info;
TreeNode * left;
TreeNode * right;
};
// Two function's prototype
// Increments the frequency count if the string is in the tree
// or inserts the string if it is not there.
void Insert(TreeNode*&, string);
// Prints the words in the tree and their frequency counts.
void PrintTree(TreeNode* , ofstream&);
//Start your main function and the definitions of above two functions.
Sample Run
Please type the text file name: Lincoln.txt
Please give the output text file name: mus11.txt
You are done! You can open the file "mus11.txt" to check.
Press any key to continue
------------------------------------------------------------------------------------------------------------------------------------------------
lincoln.txt---
The Gettysburg Address
Gettysburg, Pennsylvania
November 19, 1863
Four score and seven years ago our fathers brought forth on this continent, a new nation, conceived in
Liberty, and dedicated to the proposition that all men are created equal.
Now we are engaged in a great civil war, testing whether that nation, or any nation so conceived and
so dedicated, can long endure. We are met on a great battle-field of that war. We have come to dedicate
a portion of that field, as a final resting place for those who here gave their lives that that nation
might live. It is altogether fitting and proper that we should do this.
But, in a larger sense, we can not dedicate -- we can not consecrate -- we can not hallow -- this ground.
The brave men, living and dead, who struggled here, have consecrated it, far above our poor power to add
or detract. The world will little note, nor long remember what we say here, but it can never forget what
they did here. It is for us the living, rather, to be dedicated here to the unfinished work which they
who fought here have thus far so nobly advanced. It is rather for us to be here dedicated to the great
task remaining before us -- that from these honored dead we take increased devotion to that cause for
which they gave the last full measure of devotion -- that we here highly resolve that these dead shall not
have died in vain -- that this nation, under God, shall have a new birth of freedom -- and that government
of the people, by the people, for the people, shall not perish from the earth.
------------------------------------------------------------------------------------------------------------------------------------------------
mus11.txt
1863 1
Address 1
But 1
Four 1
Gettysburg 2
God 1
Liberty 1
November 1
Now 1
Pennsylvania 1
The 3
above 1
add 1
advanced 1
ago 1
all 1
altogether 1
and 6
any 1
are 3
battle-field 1
before 1
birth 1
brave 1
brought 1
but 1
can 5
cause 1
civil 1
come 1
conceived 2
consecrate 1
consecrated 1
continent 1
created 1
dead 3
dedicate 2
dedicated 4
detract 1
devotion 2
did 1
died 1
earth 1
endure 1
engaged 1
equal 1
far 2
fathers 1
field 1
final 1
fitting 1
for 5
forget 1
forth 1
fought 1
freedom 1
from 2
full 1
gave 2
government 1
great 3
ground 1
hallow 1
have 5
here 8
highly 1
honored 1
increased 1
larger 1
last 1
little 1
live 1
lives 1
living 2
long 2
measure 1
men 2
met 1
might 1
nation 5
never 1
new 2
nobly 1
nor 1
not 5
note 1
our 2
people 3
perish 1
place 1
poor 1
portion 1
power 1
proper 1
proposition 1
rather 2
remaining 1
remember 1
resolve 1
resting 1
say 1
score 1
sense 1
seven 1
shall 3
should 1
struggled 1
take 1
task 1
testing 1
that 13
the 9
their 1
these 2
they 3
this 4
those 1
thus 1
under 1
unfinished 1
vain 1
war 2
what 2
whether 1
which 2
who 3
will 1
work 1
world 1
years 1

View More
that models profit earned is D = n(54 – n) – 10n. I need to find the vertex of this equation, and what does the vertex tell me about this situation.. For what x-values is the function increasing? Decreasing? What does this mean in terms of daily profit for Water World? Rewrite the function in vertex form. . Solve the equation 0 = n(54 – n) – 10n for n. Describe your solution method. How are the solutions from part (e) related to the graph of this function? Are the solutions real or complex? How do you know? What do the solutions from part (e) tell you about this situation?

View More
24.Hi! I need help with my Netlogo homework, where I need to have turtles create an image of a tree. ...

sically, Tree 1 is just a vertical line, Tree 2 is that line plus two branches, Tree 3 is Tree 2 but with two additional branches on each of the original ones, and so on. Please help! I don't understand how recursions are supposed to be used with this and how to call a previous tree function. Below are additional instructions my teacher gave me.
draw-tree3 [ levels blen bangle]
levels : number of levels
blen : length of each branch
bangle : angle of the branches
The branch length should decrease as the function calls itself. This does NOT mean you decrease a variable, it means that just like fib(n-1) or fib(n-2) you decrease the parameter as you pass it to the next copy.
----Your slider is the STARTING value, the parameter can be changed every time your function is called.
Have the branch decay by multiplying by 0.85 before passing it to the next recursive call.
-When this works, try making the branch decay a slider from 0.1 to 0.9 in increments of 0.01

View More
1.AU MAT 120 Systems of Linear Equations and Inequalities Discussion

mathematicsalgebra Physics