Design and implement algorithms and simulations with suitable technology functions
Key skillsDesign and implement algorithms and simulations with suitable technology functions.
Build the idea
Investigate P′=0.2P(1−P/1000), P(0)=100, with the exact benchmark P(t)=1000/[1+9e(−0.2t)]. A numerical table, symbolic derivative and graph answer different questions. Keep step size, initial values and domain constraints visible. The listed checkpoints support verification of your implementation and are not a claim about an unseen software run.
Try the sample task
Simulate uncertainty in the initial population: choose P₀ uniformly from {80,100,120}, then take one Euler step with h=1. Implement 3000 repetitions. Trace choices generated by U=0.1,0.8,0.4 through index floor(3U), and give the theoretical mean benchmark.
The full worksheet includes the worked solution and remaining task set.
What this activity covers
Follow the workflow in a suitable tool and record your own inputs and outputs. These are expected checkpoints, not evidence of a completed student technology run. Other representations and contexts need further practice.