Help Solve the Maths Challenge: Positive Integer with All Digits 1

Click For Summary
The discussion revolves around a math challenge involving a positive integer X composed entirely of the digit 1. The task is to determine a possible value for the coefficient q in the expression pX^2 + qX + r, where the result must also consist solely of the digit 1. Participants explore substituting values for X and analyzing the implications of p, q, and r on the structure of the resulting integer. There is a consensus that for certain values of n, specifically when n is less than 11, the expression does not yield a number with all digits as 1. The complexities of number theory are acknowledged, with some uncertainty about the relationships between the coefficients and the resulting integer.
Trail_Builder
Messages
148
Reaction score
0
one of the "maths challenge" questions. one of the only ones i couldn't do :S I've tried for a good number of hours, but havnt found a way to do it. I feel any more time would just be brute forcing it which i wouldn't have time for in the exam anyways.

hope you can help

Homework Statement



X is a positive integer in which each digit is 1; that is, X is of the form 111111...
Given that every digit of the integer pX^2 + qX + r (where p, q, and r are fixed integer coefficients and p > 0) is also 1. Irrespective of the number of digits X. Which of the following is a possible value of q?


Homework Equations





The Attempt at a Solution



:S


thanks
 
Physics news on Phys.org
Well if I understood correctly. Then can't you substitute x=1 and p=1 and then see what numbers for q would give you an integer with each digit being 1. Understand?
 
it has to work for every possibly permutation of X I think.

hence "Irrespective of the number of digits X" and "where p, q, and r are fixed".

is that right?
 
I know absolutely zero number theory, but here are my musings on this:

If X=11111... with n 1's, then X^2 contains all the digits from (and contained in) 1 to n, no more and no less.So
X^2 = 123...n...321 where n is the no. of 1's in X for n<11 (10=>0). n>10, X^2 contains all numbers 0, 1, ...9
pX^2 = p(123...n...321)
qX = qqqqq... n q's in total

So q=0 if n=1 and r= 0. For higher n the digits of X^2 are not all 1's.

p(123...n...321) + qqqq...+r = 111...
Is there a digit q that satisfies:
p(123...n...321) + qqqq... +r = 1111...

Apparently not: p(123...n...321) is of length 2n-1 (number of digits it contains), and qqqq... is of length n.
Im obviously not sure of all this, but it seems like this may have something to do with it. If it does, you can work it out and formalise it, if not, you can ignore me :D
 
Last edited:
well if q is 10 and r is 0 won't the integer be 11?

Edit: qspeechc might be right in what he's saying but I can't understand it at the moment but I hope you did.
 
Last edited:
To repeat myself; I don't know any number theory.

If q is 10^n, then all it does is add n zeroes on the end of the 1's, and you can see then that it doesn't change anything.
 
I don't think he's checked this.
 

Similar threads

  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 20 ·
Replies
20
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
Replies
59
Views
5K
  • · Replies 4 ·
Replies
4
Views
2K
Replies
9
Views
7K
Replies
2
Views
4K
Replies
26
Views
4K
  • · Replies 102 ·
4
Replies
102
Views
11K
Replies
7
Views
3K