[ 3 / biz / cgl / ck / diy / fa / ic / jp / lit / sci / vr / vt ] [ index / top / reports ] [ become a patron ] [ status ]
2023-11: Warosu is now out of extended maintenance.

/sci/ - Science & Math

Search:


View post   

>> No.15045447 [View]
File: 2.95 MB, 498x280, vulkan.gif [View same] [iqdb] [saucenao] [google]
15045447

Is there a special name for the task of integrating up Netwon's equations of motion?
You got the force (determining the acceleration, which determines the velocity), and you want the trajectory.
I don't find it on Wikipedia.

>> No.14855062 [View]
File: 2.95 MB, 498x280, vulkan.gif [View same] [iqdb] [saucenao] [google]
14855062

>> No.12466189 [View]
File: 2.95 MB, 498x280, vulkan.gif [View same] [iqdb] [saucenao] [google]
12466189

>>12466102
>Is there any situation where defining n-tuples as nested ordered pairs doesn't work?
Exotic remark: For n-tuples [math]A^n=A\times A\times \cdots\times A[/math], one can go and define, as you suggest [math]A^{k+1}=A^k\times A[/math] recursively, with [math]A^1=A[/math]. but in that case you also have the alternative [math]A^n:=(\{0,1,2,\dots,n-1\}\to A)[/math]. I.e. the functions from [math]\{0,1\}[/math] to [math]A[/math] correspond to pairs in [math]A\times A[/math]. From a ZF perspective, the function definition is somewhat nicer in that it has smaller rank. In the recursive definition, you reach down deeper every time and at for some sets involving the product you then require Replacement.

>> No.11667841 [View]
File: 2.95 MB, 498x280, vulkan.gif [View same] [iqdb] [saucenao] [google]
11667841

>>11667803

Navigation
View posts[+24][+48][+96]