Questions on Palindromic & Sequence Numbers

  • Thread starter Thread starter chickenguy
  • Start date Start date
  • Tags Tags
    Numbers Sequence
AI Thread Summary
The discussion revolves around calculating palindromic numbers and applying the pigeonhole principle to a sequence of integers. For 6-digit palindromic numbers, there are 900 possible combinations, as the first digit cannot be zero. For odd 7-digit palindromic numbers with each digit appearing at most twice, the calculations are more complex, and no straightforward method was identified. Additionally, when selecting 14 distinct integers from the range 100 to 124, the pigeonhole principle suggests that at least two numbers will have a difference of 4. The participants are seeking shortcuts to these problems, indicating a desire for more efficient problem-solving techniques.
chickenguy
Messages
16
Reaction score
0
more questions?

Hi more questions again... :blushing: :blushing: i am having a hard time figuring out these questions...
1)a)how many 6-digit palindromic numbers are there?
(i can do this the slow way, but i am looking for shortcuts)
b) how many odd 7-difit palindromic numbers are there in which every digit appears at most twice?
( again, i am looking for a fast way)

2)show that if 14 distinct intergers are chosen form the sequence 100, 101,102, 103...,123,124, there must be two of them whose difference is 4
(i have worked this out by writing out 14 numbers and having all the possibilities(it took a long time) and i am looking for a shortcut) :smile:
 
Mathematics news on Phys.org
chickenguy said:
Hi more questions again... :blushing: :blushing: i am having a hard time figuring out these questions...
1)a)how many 6-digit palindromic numbers are there?
(i can do this the slow way, but i am looking for shortcuts)
What do you mean by the "slow way". Since the numbers are palindromic, once you have the first 3, the others must be the same. There are 103 such numbers.

b) how many odd 7-difit palindromic numbers are there in which every digit appears at most twice?
( again, i am looking for a fast way)
Lazy , eh? Since 7 is odd, we are looking for 4 digits. No digit more than twice? Okay, there are 10 possible first digits, then 10 possible second digits (which might be the same). We might want to separate those: there are 10(9)= 90 two different digit combos, 10 possible where the two digits are the same. Of the "different" two digits, there are again 10 possiblilities for the 3 digit but again we will want to consider separately that digit being the same or not the same as one of the first two... If the first two digits are the same then there are 9 possibilities for the third digit, etc.
I don't see any "easy" way. Sorry.

2)show that if 14 distinct intergers are chosen form the sequence 100, 101,102, 103...,123,124, there must be two of them whose difference is 4
(i have worked this out by writing out 14 numbers and having all the possibilities(it took a long time) and i am looking for a shortcut) :smile:
pigeon hole principal ought to work. How many different "differences" are possible?
 
chickenguy said:
2)show that if 14 distinct intergers are chosen form the sequence 100, 101,102, 103...,123,124, there must be two of them whose difference is 4
(i have worked this out by writing out 14 numbers and having all the possibilities(it took a long time) and i am looking for a shortcut) :smile:

Hint: There's a reason the range is from N to N+24 (includes less than 14*2 - 1 integers)
 
HallsofIvy said:
What do you mean by the "slow way". Since the numbers are palindromic, once you have the first 3, the others must be the same. There are 103 such numbers.

Actually, wouldn't it be 900, since the first digit can't be 0?
 
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Thread 'Imaginary Pythagorus'
I posted this in the Lame Math thread, but it's got me thinking. Is there any validity to this? Or is it really just a mathematical trick? Naively, I see that i2 + plus 12 does equal zero2. But does this have a meaning? I know one can treat the imaginary number line as just another axis like the reals, but does that mean this does represent a triangle in the complex plane with a hypotenuse of length zero? Ibix offered a rendering of the diagram using what I assume is matrix* notation...

Similar threads

Replies
2
Views
1K
Replies
2
Views
2K
Replies
4
Views
2K
Replies
17
Views
2K
Replies
1
Views
2K
Replies
55
Views
5K
Back
Top