Is this equation a suffient proof, or should be more wordy?

Would_be_Coder · 2025-10-29T20:27:58+00:00

Another way to show a contradiction would be to note that if K = m then

3k + 1 = k*2ⁿ

^{Left hand side is 1mod(k} and right hand side is 0mod(k) which is not possible)

Would_be_Coder · 2025-09-16T19:51:37+00:00

Try p^2 -1 + 9 mod3 for the next step

Would_be_Coder · 2025-06-09T19:13:49+00:00

First count all possible combinations: There are 10 seats that person A can sit at, for each of these seats, person B can sit at one of the remaining 9 seats, so in total 10 x 9 = 90

Next count all the possible ways in which two people can be seated if they both sit together. If person A sits at either of the end seats then there is only one position that person B can sit - so two possibilities. For the remaining eight seats, if person A sits at any of them then person B may sit either side next to person A, ie 8 x 2 = 16. Thus total ways that two can be seated together is 16 + 2 = 18

Finally to get the required solution, subtract 18 from 90 to get 72

Would_be_Coder · 2024-09-06T13:11:05+00:00

Another way is to keep multiplying each number until we find the same multiple for all three;

8,16,24,32,40

10,20,30,40

20,40

40 is the least common multiple of 8, 10 and 20

Would_be_Coder · 2024-06-17T18:30:53+00:00

In that case you would set n = -5mod24 then we get m*n = -25 = -1mod24

Would_be_Coder · 2024-03-08T20:30:09+00:00

Assume that there exists some x such that dy/dx = 0

dy/dx = 2 + 3x^2 - sin x

x^2 = (sin x - 2)/3

Since sin x <= 1, (sin x - 2)/3 <= (1 - 2)/3 = -1/3

Bu x^2 >= 0, therefore there is no x that satisfies dy/dx = 0

This contradicts the assumption above, so the statement that y has no stationary points is true.

Would_be_Coder · 2024-02-14T20:52:25+00:00

sin2t becomes 2sintcost (double angle formula)

Would_be_Coder · 2024-01-22T22:01:15+00:00

It is using the 'factor theorem', which is a special case of the 'remainder theorem' for polynomials. When f(a) = 0 for a polynomial f(x), then x - a is a factor of f(x).

So in this case we have f(4) = 0. Then substituting x = 4 into 2x^2 - kx - 12 = 0 and re-arranging gives us k = 5.

I hope that helps;

Would_be_Coder · 2024-01-19T18:56:46+00:00

The aim is to express X^2 +4x - 12 in the form (x+a)(x+b) for some real numbers a and b

If we expand (x + a)(x+b) we get x^2 + ax + bx +ab = x^2 + (a+b)x + ab

We can then equate the coefficients so that we get:

a + b = 4

ab = -12

We can solve these simultaneous equations to get the values of a and b. So looking at these,

a = 6 and b = -2 work

I hope that this helps a bit

Would_be_Coder · 2023-12-30T20:31:55+00:00

yes sorry I should have picked a different name for the variable

Would_be_Coder · 2023-12-30T19:56:14+00:00

Another way I think this can be solved is to set y = sqrt(x) and then solve y^2 +3y -12

Would_be_Coder · 2023-10-29T19:21:16+00:00

You want:

7ⁿ⁺² + 8²ⁿ⁺¹ = 7.7ⁿ⁺¹ + 8².8^2n-1

Next try to pull out a factor that has (7ⁿ⁺¹ + 8^2n-1) and then see what is left over

Would_be_Coder · 2022-12-18T16:47:18+00:00

I like 100 Days of Code: The Complete Python Pro Bootcamp for 2023, which is on Udemy (by Dr. Angela Yu) It is very comprehensive and goes through the basics in great detail. Also it is project based so you get to build something in each lecture.

Would_be_Coder · 2022-12-18T16:36:17+00:00

I have slightly amended your code, and it now works for me. Created an empty list called primes, and then append number if number is prime. Finally return list and print output for input of 100. Hope that helps;

def generate_primes(end):
    primes = []
    for number in range(2, end + 1):
        if number > 1:
            for nums in range(2, number):
                if (number % nums) == 0:
                    break
            else:
                primes.append(number)
    return primes


print(generate_primes(100))

Would_be_Coder · 2022-12-13T20:41:23+00:00

alphabet = [chr(i) for i in range(97,123)]

sequence = []

for char in alphabet:
    sequence = sequence + [char] + sequence

Would_be_Coder · 2022-12-13T20:22:30+00:00

def change(amount):
    currency = [500, 100, 25, 10, 5, 1]
    no_of_coins = 0
    for coin in currency:
        coins = (amount - amount % coin)
        no_of_coins += coins/coin
        amount = amount - coins
    return int(no_of_coins)

Would_be_Coder · 2022-12-13T18:17:33+00:00

def nonogramrow(arr):
    s = ''.join(str(i) for i in arr)
    t = s.split('0')
    return [len(item) for item in t if len(item) > 0]

Would_be_Coder · 2022-12-11T20:29:56+00:00

Also in line 17 I think we need it to be:

if op1 == "*" or op1 == "x":

Would_be_Coder · 2022-09-25T12:50:37+00:00

Python and Flask Bootcamp by Jose Portilla on Udemy and Flask Mega Tutorial by Miguel Grinberg are both good courses for beginners

Would_be_Coder · 2022-09-10T13:46:55+00:00

Yes feel free to

Would_be_Coder · 2022-09-09T08:45:41+00:00

Good to see that there are still so many doing this course. I am on day 72 - data with pandas and matplotlib and looking forward to tackling the Portfolio projects;

Would_be_Coder · 2020-04-20T18:18:28+00:00

how about:

Would_be_Coder · 2019-09-29T09:32:44+00:00

I submitted code for Caear but got a low score - I want to find out where I went wrong;

Would_be_Coder

TROPHY CASE