I'm not good at this kind of problem

[molten cypress]

1. Do not ping the Moderators, unless someone is breaking the rules.
2. Do not ping the Helper Moderators, unless there is a conflict between helpers.
3. Do not ping other members randomly for help.
4. Ask your question and show the work you've done so far. If you've posted a screenshot of a question, specify which part you need help with.
5. Wait patiently for a helper to come along.
6. If the Helper has answered your question, remember to thank them with the Mathematics Ranks bot and close the thread with:

+close
Feel free to nominate the person for helper of the week in #helper-nominations
If you're happy with the help you got here, and the server overall, you can contribute financially as well:

[past perch]

Could I have that in English?

[lavish sedge]

yea @serene crescent can u change the language

[serene crescent]

Okay sorry wait

The number of possible sequences of positive integers with six terms a₁, A2, A3, A4, A5, as such that 1 <= a_{1}, a_{2}, a_{3}, a_{4}, a_{5}, a_{6} <= 4 and no two consecutive terms whose sum is 4 is

[lavish sedge]

whats the answer?

@serene crescent

[serene crescent]

1549

[past perch]

Yep

[past perch]

Did you solve it on your own?

[lavish sedge]

i tried using total - (cases where consecutive terms having sum =4 )

[serene crescent]

No

[lavish sedge]

total cases are = 4^6= 4096 ( as we have 6 places and 4 choices i.e 1 ,2,3,4

now

we have to make cases like

1 consecutive term in the sequence

2 consecutive term

3 consecutive terms

4 and then finally 5

and add up the all the cases

its a bit long process but im sure that this is a correct method to solve this

[serene crescent]

Can you Show Me Your work

I'm still stuck at the concept on a solution video of this problem

[serene crescent]

Hello

I know I'm a bit goofy but why you don't show me your work

[serene crescent]

Wtf is n-1 doing there why not use a whole n and also why Q should be pair with S why not R

<@&1309522179368419349>

[neon heath]

@serene crescent

<:HelpIcon:1304095958283321385>| Help Reminder

Hello asephillenburg, this is a friendly reminder that your help request has been inactive for more than 24 hours. If you no longer need assistance, please consider closing the thread using the +close command. This thread will be automatically closed in 3 days if it remains inactive.

[serene crescent]

+close

[neon heath]

Please thank your Helpers before closing!

Please thank the helpers who assisted you by clicking the buttons below. You can thank each helper only once. Once you're done, click "Close Post" to close this thread.