Why is the quadratic expression 20*x^2-1 only divisible by 11,19,29....

In summary, Ian in London (South) is interested in number theory and prime numbers. In a conversation, it was discussed that integer iterations of a quadratic expression only yield decimal numbers whose factors end with the digits 1 or 9. This can be generalized by writing the equation modulo 10 and ruling out factors with certain modular arithmetic properties, such as being congruent to 3 mod 10. However, the proof for this is non-trivial and requires careful consideration. It was also mentioned that this phenomenon is applicable to a sub-class of prime pairs and can generate large primes.
  • #1
Janosh89
61
19
Ian in London (South).Interests Number Theory. Prime Numbers...
Integer iterations of this quadratic expression only yield decimal numbers whose factors end with the digit _1, or _9. Why?
 
Mathematics news on Phys.org
  • #2
Janosh89 said:
Ian in London (South).Interests Number Theory. Prime Numbers...
Integer iterations of this quadratic expression only yield decimal numbers whose factors end with the digit _1, or _9. Why?
Do you have any idea? Without the "-1", which is the last digit?
 
  • #3
fresh_42 said:
Do you have any idea? Without the "-1", which is the last digit?
It is not so trivial if you want to consider all factors of the number. 13*23 can give the correct last digit, for example.

@Janosh89: Can you rule out some factors based on modular arithmetic?
Can you generalize that?
 
  • #4
fresh_42 said:
Do you have any idea? Without the "-1", which is the last digit?
The factors are in the set 11,19,29,31,41,59,61,71 and so on but can include prime numbers (^2), (^4),(^6)...
 
Last edited by a moderator:
  • #5
mfb said:
It is not so trivial if you want to consider all factors of the number. 13*23 can give the correct last digit, for example.

@Janosh89: Can you rule out some factors based on modular arithmetic?
Can you generalize that?
299 (13*23) is not expressible by 20*x^2-1 ? where x is an integer
 
  • #6
mfb said:
It is not so trivial if you want to consider all factors of the number.
Yes, I erroneously thought it was about the digits of ##20x^2-1## itself.
Interesting question though and indeed not trivial.
 
  • #7
mfb said:
It is not so trivial if you want to consider all factors of the number. 13*23 can give the correct last digit, for example.

@Janosh89: Can you rule out some factors based on modular arithmetic?
Can you generalize that?

fresh_42 said:
Yes, I erroneously thought it was about the digits of ##20x^2-1## itself.
Interesting question though and indeed not trivial.

This is applicable to a sub-class of prime pairs, 59;61 say ,
45x^2 +15x +1
45x^2 +15x - 1 ( 5x^2+5x +/-1 where x=3*n )
 
  • #8
fresh_42 said:
Yes, I erroneously thought it was about the digits of ##20x^2-1## itself.
Interesting question though and indeed not trivial.
Hope you got my reply. Thanks very much for responce to my initial question.
 
  • #9
Janosh89 said:
This is applicable to a sub-class of prime pairs, 59;61 say ,
45x^2 +15x +1
45x^2 +15x - 1 ( 5x^2+5x +/-1 where x=3*n )
I don't understand what this means. Is it another question, or an attempt at answering the original question?
For the original question, the first step is to write the equation modulo 10.
 
  • #10
SlowThinker said:
For the original question, the first step is to write the equation modulo 10.
And how does that help?

The obvious approaches don't directly lead to a solution. While it is easy to rule out many specific primes as factors, that is not trivial to generalize.
This is an interesting problem. Please be careful with hints if you don't know if they help.
 
  • #11
I think I have a proof, I just didn't want to post it.
In the first step I prove that factors must be 1,3 or 9 mod 10. In the second step I rule out those with 3 mod 10.

Edit: I guess I'll have to rule out 7 mod 10 as well...
Edit2: Yes the first step allows 7 mod 10 as well but second step can be repeated to rule those out as well.
 
Last edited:
  • Like
Likes mfb
  • #12
Janosh89 said:
This is applicable to a sub-class of prime pairs, 59;61 say ,
45x^2 +15x +1
45x^2 +15x - 1 ( 5x^2+5x +/-1 where x=3*n )
These have the same factors , being derived from 20x^2-1 !
 
  • #13
Thanks for signposting! Maybe it is more trivial, but
60*x^2+1 has only factors in the sets

30*n+1, +17, +19, +23
 
  • #14
45x2+15x +/-1. ... 59;61 ,209;211 ,449;451 ,779;781 ...
45x2-15x +/-1 ... 29;31 ,149;151 ,359;361 ,659;661 ...
have the same factors as 20x2-1
 
  • #15
45*1383768138376181^2-15*1383768138376181-1 = 61 × 1 412567 897300 469698 405475 260189
45*1383768138376181^2-15*1383768138376181+1 = 11 × 7 833331 066848 059236 612180 988321
45*1383768138376181^2+15*1383768138376181-1 = 547 101119 × 157496 738249 823782 787361
45*1383768138376181^2+15*1383768138376181+1 = 86 166641 735328 693115 778142 156961 (prime)

45*332222111111111111113837681383761^2-15*332222111111111111113837681383761-1 = 41 × 15031 × 473798 391866 453915 014639 × 17 009998 181762 817836 249229 315400 436941
45*332222111111111111113837681383761^2-15*332222111111111111113837681383761+1 = 79 × 101 582219 × 2 051039 191429 × 301 752471 096290 191134 883798 553758 009803 236039
45*332222111111111111113837681383761^2+15*332222111111111111113837681383761-1 = 11 × 451519 900000 050505 057916 361767 462680 924222 331768 767051 457652 135169
45*332222111111111111113837681383761^2+15*332222111111111111113837681383761+1 = 4 966718 900000 555555 637079 979442 089490 166445 649456 437566 034173 486861 (prime, 67 digits)

It certainly generates large primes!

Edit: Found an alternative way to factorize the one nasty case.
 
Last edited:
  • #16
You've made my evening. See you soon. Great!
 

1. Why can the quadratic expression 20*x^2-1 only be divided by 11, 19, 29... and not other numbers?

This is because the quadratic expression has been specifically constructed to have a remainder of 1 when divided by these particular numbers. This is known as a congruence relation, where the remainder of a division is equal to a given number. In this case, the remainder is always 1 when divided by 11, 19, 29, and so on.

2. Is there a specific reason why the numbers 11, 19, 29... are used in this quadratic expression?

Yes, these numbers are known as prime numbers, which means they can only be divided by 1 and themselves. This property makes them useful for constructing congruence relations, as seen in the quadratic expression 20*x^2-1.

3. Can other numbers be used instead of 20 in the quadratic expression?

Yes, other numbers can be used. However, the numbers must be chosen carefully in order to maintain the congruence relation. Also, the numbers used must be relatively prime to the divisor (11, 19, 29, etc.), meaning they have no common factors other than 1.

4. How is the concept of congruence used in mathematics?

Congruence is used in various areas of mathematics, such as number theory and algebra, to study patterns and relationships between numbers. It is also used in cryptography to create secure codes and in geometry to determine if two shapes are identical or have the same properties.

5. Is there a real-world application for understanding why the quadratic expression 20*x^2-1 is only divisible by 11, 19, 29...?

Yes, this concept can be applied in fields such as computer science and engineering, where congruence relations are used in algorithms and coding. It can also be used in data encryption to create secure communication channels.

Similar threads

  • New Member Introductions
Replies
1
Views
288
  • General Math
Replies
2
Views
1K
Replies
6
Views
1K
  • General Math
Replies
1
Views
3K
  • Precalculus Mathematics Homework Help
Replies
12
Views
2K
Replies
4
Views
2K
  • General Math
Replies
3
Views
4K
  • Precalculus Mathematics Homework Help
Replies
14
Views
1K
Replies
4
Views
2K
  • Precalculus Mathematics Homework Help
Replies
7
Views
757
Back
Top