Consider a walking machine that has n legs. The machine can take steps by moving one leg at a time. However, the machine must always have at least one leg on the ground to maintain balance. Given these constraints, what is the formula for how many different events of leg movements possible for this walking machine?
#Does this question make sense to you guys? Do I need to make it more understandable for others?
covert shard
vestal hornetBOT
whole dagger
Yeah formulas need to have independent and dependent variables
So perhaps the dependent variable could be number of combinations
Independent variables could be number of legs or steps or something
Also you should specify the starting position or if it could start at different positions
So when you say formula you should say can you find a formula for the number of combinations of legs movements in terms of (insert dependent variables)
Initially I thought it would be infinite because it could keep walking, so I assume you mean it would be after a finite number of steps or something
potent stirrup
it doesn't make sense
give an example
like a sequence of length 3
say there's 5 legs, what do you mean by a sequence
covert shard
say you have 2 legs, you can only have 6 possible unique events -
raising forward and back for each leg (4) and raising them both together and once and putting them back together at once (2)
@potent stirrup
fervent echo
@covert shard
covert shard
you didnt even get the intution for the area under the curve one 🧌
its okay soli is still support you
fervent echo
@covert shard your anser for this question was 2^(n+1)
fervent echo
Mirin you can use ms paint
covert shard
@fervent echo delete the answer boy
fervent echo
covert shard
goodjob
potent stirrup
@covert shard uhh
okay so moving it back is distinct
we can't do the last part, you said we can only walk
fervent echo
qwertyl has a hard time writing, he isn't native
he might take a while to respond
potent stirrup
so let's take 3 legs
one leg forward: 3 ways
one leg backward: 3 ways
two legs forward: 3
two legs backward: 3
fervent echo
we can tell qwertyl
potent stirrup
is this right or i slighlty misunderstood?
fervent echo
u shouldnt ask qwertyl questions tbh
he could not solve 12th term oh fib
covert shard
slightly misunderstood
because you do not know the order to which the legs may move
covert shard
u shouldnt ask qwertyl questions tbh
he could not solve 12th term oh fib
what r u talking about
fervent echo
what r u talking about
Its okay bro
you dont have to get everything right qwertyl dont cry
covert shard
u didnt know fibonacci on the VQR problem
and then u said it was because you misread it
its okay solia
fervent echo
Im buggin bro got 171 on c-09
covert shard
lol
covert shard
actualyl two
potent stirrup
ok back to 2 legs
covert shard
who said i got 171 in the first place?
potent stirrup
how is it 4 then
fervent echo
nah thats crazy
potent stirrup
if you;re counting the entire sequence, it's 2
potent stirrup
there's 2 ways to move yourself forward: left step right step or reversed
also there's 2 steps you can make coincidentally, left step, right step
i don't understand which one you're counting
suppose "move yourself one step forward" is what you;re counting
so for 3 legs:
step one leg, then step two legs: 3 ways
step two legs, then step one leg: 3 ways
step one, then one, then one: 6 ways