# Tagged Questions

20 views

### Is my proof correct? Let $a, b, c\in\mathbb Z$. Prove that if $a\mid b$ and $b\mid c$, then $a\mid(b + c)$.

Let $a$, $b$, $c$ $\in\mathbb{Z}$. Prove that if $a\mid b$ and $b\mid c$, then $a\mid (b + c)$. My proof: since $a\mid b$, $b = k\cdot a$ for some integer $k$ since $b\mid c, c = l\cdot b$ for some ...
36 views

### Consecutive natural numbers [duplicate]

Please I want to know what is the most appropriate expression that if it is asked to find the counterexample of "The product of any three consecutive natural numbers is divisible by 9" My expression ...
48 views

37 views

### Divisibility in base $7$ problem

Find all integers between $0 \leq a \leq 2400$ such they are divisible by $8$ and that their base 7 development has at least $3$ equal digits.
48 views

### How can I prove this relation between gcd(a,b)?

I am stuck on starting this proof that involves gcd. Define $g_n=2^{2^n}+1$ and that $g_0g_1g_2...g_{n-1}=g_n-2$. Suppose that $a$ and $b$ are unequal positive integers. Prove that $gcd(g_a,g_b)=1$. ...
33 views

### Find all the $a$ such $539|a3^{253}+5^{44}$

This is what i thought: Given that $539|a3^{253}+5^{44}$ then $11|a3^{253}+5^{44}$ and $7^2|a3^{253}+5^{44}$ using congruences I get: $$a3^{253}+5^{44} \equiv 0 \pmod{7^2}$$ and ...
68 views

### Prove by induction $a-b|a^{n}-b^{n}$ for $n\in\mathbb N$

$P(1)$: $a-b|a-b$ $P(n) \Rightarrow P(n+1)$: $a-b|a^{n}-b^{n}\Rightarrow a-b|a^{n+1}-b^{n+1}$ I'm not sure how to proceed from here. Any help is appreciated.
43 views

### Prove by induction that $99 | 10^{2n} + 197$ for $n\ge 1$

I'm not sure whether I should make use of the transitive property, or this $a|b\Rightarrow b = a*z$ / $z\in\mathbb Z$ to solve the problem. I'm mainly looking to solve it through induction using the ...
97 views

### How many $7$ digits number can be made?

How many $7$ digits number can be made with $1,2,3,4,5,6,7$ so that they are divisible by $11$? (Repetition is not allowed.) I know the divisibility rule of $11$, so the main problem is counting.
77 views

### Prove that $2^{2k-1}+2^{k}+1$ is not divisible by $7$ for any $k$ natural number

I am trying to prove this, but I really can't seem to get anywhere with it.. I tried transforming this into something else, but no transformation yields in any useful expression whatsoever.. As ...
194 views

### Proof that $a^5 b - b^5 a$ is divisible by $30$ for any integers $a$ and $b$

I am trying to prove that $a^5\times b - b^5\times a$ is divisible by $3$. The actual task is to prove divisibility by $30$ but I have managed to prove that the expression is divisible by $5$ and $2$. ...
48 views

### What are a and b?

$a$ and $b$ are two positive integers. If $ab=1260$, $gcd(a,b)=3$, and when $a$ is divided by $b$ the remainder is 18, what are $a$ and $b$? How do you solve this? EDIT It looks like an ...
75 views

### Dynamic programming algorithm for GCD?

I can't seem to find a clear answer on this. I'm inclined to believe that there is not a DP solution for GCD, given the lack of information so far in my searches on the subject. I suppose that in ...
47 views

### Pigeonhole question - divisibility by chosen number

This question should be solved with pigeonhole principle. Let $a,n \in \mathbb N$ such that $a$ is a number whose digits are only $3$'s and $0$'s, and $n$ is an unspecified natural number. Show that ...
30 views

### Computations question

a) Determine the prime factorizations of 3850 and 4125 b) Find the value of d = gcd(3850,4125) c) List all the positive divisors of d This is what I have so far. a) 3850: 11, 5, 5, 7, 2 4125: ...
23 views

### finding unknowns and proof

The procedures for using cutting-adding method for testing a number M to be a multiple of 59 are as follows: 1 cut the units digit of M 2 add the remaining integer by r times of the deleted digit. 3 ...
66 views

### Prove that if $3|(a^2+b^2)$, then $3|a$ and $3|b$, where $a, b$ are integers [duplicate]

I would like to know how to prove the above statement by contradition. Somebody said that one should prove it by this method but I have no idea what it is.
52 views

### What is the concept behind divisibility of large numbers that contain only the digit 1?

An example question I found in a text book is : The 300 digit number with all digits equal to 1 is : A) Divisible by neither 37 nor 101 B) divisible by 37 but not by 101 C) divisible by 101 but not ...
88 views

### gcd Calculations

Let $a, b, c$ be integers. Prove that if $\gcd(a,b)=1$ then $\gcd(ab,c) = \gcd(a,c) \gcd(b,c)$ First time asking here. I'm not sure what your policies are on general homework help but I truly am ...
73 views

### Prove that any number of the form $a_3a_2a_1a_3a_2a_1$ is divisible by 91.

Prove that any number of the form $a_3a_2a_1a_3a_2a_1$ is divisible by 91. I got up to $a_3a_2a_1a_3a_2a_1$ = 1000001$a_3$ + 10010$a_2$ + 1100$a_1$. However none of the coefficients are divisible ...
103 views

### Prove Divisibility test for 11 [duplicate]

Prove Divisibility test for 11 "If you repeatedly subtract the ones digit and get 0, the number is divisible by 11" Example: 11825 -> 1182 - 5 = 1177 1177 -> 117 - 7 = 110 110 -> 11 - 0 = 11 11 ...
548 views

### Does $n \mid 2^{2^n+1}+1$ imply $n \mid 2^{2^{2^n+1}+1}+1$?

There are two ways to try to prove this. One is in the title, the other is its de Morgan counterpart: $n \nmid 2^{2^{2^n+1}+1}+1 \implies n \nmid 2^{2^n+1}+1$. Disproving it requires only one example ...
162 views

### calculate GCD of very large integers

How i can calculate GCD of two very large integers for example: gcd(31415926534676736647, 438478473847834834784748) either by hand or computer? is there any ...
208 views

### Prove that the Euclidean algorithm for gcd works with polynomials

Given the algorithm $E$: ...
52 views

### Divisibility question with 8th powers

so I was assigned a divisibility question for homework. Prove that $27195^8-10887^8+10152^8$ is divisible by $26460$. Am I supposed to use mods? I appreciate the help!