#Contest math

50 messages · Page 1 of 1 (latest)

pure raptor
#

I got the answer 11025, I want to confirm if that would be correct or not.
5.
This one I am confused about, I am not sure how the conditions other than the second and maybe the first matter. I have also seen some peers say that all the conditions matter am I just understanding the question wrong?
6.
I found that a = all numbers that end in a 3 or an 8 and b = all numbers ending in a 2 so would that be 200 pairs? I feel that I did something wrong here as the number seems too perfect. Where did I go wrong?

pallid cliffBOT
pure raptor
#

@wide holly Please help 🙏

wide holly
#
  1. Yes.
  2. Yes.
  3. Why can't b=7?
somber parrot
#

how do u do 4. btw?

pure raptor
pure raptor
wide holly
#

It's as easy as you think it is and points 3 and 4 don't matter'

pure raptor
#

oh really... alright thanks

austere wind
#

6.324 is 18^2 so the whole thing can be written as 2^(2a+b+2)*3^(a+4b+4)=a^5 for some a
That means 2a+b+2 and a+4b+4 must be divisible by 5
Then you can use modulo 5 to find the congruence of a and b to find all of the possible pairs

pure raptor
#

yeah i did that i just did forgot to include all nums that ends in 7 works for b

austere wind
#

Personally i think q5 2 last conditions are the same

pure raptor
austere wind
#

Oh sr i think it was the rightmost digit 🥲

pure raptor
#

o

austere wind
#

I think it might be this

wide holly
#

That's a lot of overkill. The first 4 digits sum to a multiple of 3, as do the last 4, therefore all 8 sum to a multiple of 3.

austere wind
pure raptor
#

The main issue for me with this question why is it a two line question...

austere wind
#

If minimum than n=(357)^2

wide holly
#

read the question again

#

n must be a factor of xyz

#

so n can't be larger than any number that xyz is allowed to equal

pure raptor
#

as I got a = all numbers that end in a 3 or an 8 and b = all numbers ending in a 2 or 7 so 20 each

wide holly
#

Yeah, I think so.

#

It's a bit of a weird question because you can just look at it, see a bunch of equations mod 5, and then realize that you don't have to solve any of them because they will have one solution and it doesn't matter what it is

austere wind
pure raptor
#

@wide holly Also how would you approach proving 4 if it doesnt matter how many digits n has?

#

ecause thats what i think they are really asking

wide holly
wide holly
#

I had didn't know how to solve it until I spent a few minutes writing a bunch of numbers down trying to break it.

pure raptor
wide holly
#

The digts 1 and 4 are the same when all you care about is divisibility by 3

austere wind
wide holly
#

600 is a multiple of 2.
2 is not at least 600

pure raptor
#

or do you mean reduce all the digits for
51182442 it becomes 2 1 1 2 2 1 1 2?

wide holly
#

Just write some numbers and check if they're happy

#

Then figure out what it takes for them to be happy

pure raptor
#

alright thanks 👍

#

oh it repeats doesnt it

austere wind
wide holly
#

Specifically, that means that xyz is a multiple of n when q=1

#

So n is less than or equal to (35)(21)(15)