Waste less time on Facebook — follow Brilliant.
×

Please help me with this question....

When a natural number ‘N’ is divided by a positive integer, we get 19 as a remainder. But when 10 times of same number ‘N’ is divided by the same integer we get 10 as a remainder. Then how many such integers are possible?

Note by Kshitij Johary
4 years, 1 month ago

No vote yet
1 vote

  Easy Math Editor

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 \( 2 \times 3 \)
2^{34} \( 2^{34} \)
a_{i-1} \( a_{i-1} \)
\frac{2}{3} \( \frac{2}{3} \)
\sqrt{2} \( \sqrt{2} \)
\sum_{i=1}^3 \( \sum_{i=1}^3 \)
\sin \theta \( \sin \theta \)
\boxed{123} \( \boxed{123} \)

Comments

Sort by:

Top Newest

Let the integer be x, Then,A\q

\( N \equiv 19 \pmod{x} \) - (1)

\( 10N \equiv 10 \pmod{x} \) - (2)

From (1),

\( 10N \equiv 190 \pmod{x} \)

\( 190 \equiv 10 \pmod{x} \)

\( 180 \equiv 0 \pmod{x} \)

From (1) we have \( 19 < x \)

x may be any divisor of 180 greater than 19 which are

\( 180,90,60,45,36,30,20 \)

Siddhartha Srivastava - 4 years, 1 month ago

Log in to reply

which class r u in?

Pratik Shastri - 3 years, 5 months ago

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...